- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 3
Read review
Paper summary
Given a confidence set of counts is already constructed, the paper considers improving it by using two samples with overlapping observations. The main idea is through taking into account the constraints due to the fact the observation and the sampled counts from the existing confidence set must comply with each other. This is essentially a constrained optimization problem, where the initial solution to the optimization may not satisfy the constrained. The algorithm is in sampling from the original set, and correct the original set when violation of the constraint is discovered.
Critical strengths
It seems to consider a very challenging problem because any optimization on the integer domain is difficult.
Critical weaknesses
It is extremely difficult to read the paper. After several rounds of reading through the paper, I still do not get the technical details or the key of the methodological breakthrough of the paper.
The writing of the paper mixes vectors and scalars, which creates unnecessary difficulties in reading.
The numerical improvement seems also limited.
Questions for authors
- In taking into account the constraints to improve confidence set calculation, is the key only in the fact that the constraints are taking into account? Or is the key in how these constraints are taken into account?
- Is the breakthrough due to better handling integer optimization problem? What is the most critical contribution in terms integer optimization if so? Is your idea generalizable to other integer optimization problems?
- Has the consideration of improving a given confidence set based on a single sample been considered? If not, will it be easier to explain the basic idea in this situation first help understanding?
- You considered two samples with overlapping. Is your idea generalizable to three or even more samples simultaneously? How hard will the procedure be?
- You assume t is known.Is this reasonable in practice? What is the consequence of incorporating a t too large and t too small? Can the deviation from the promised guarantee be quantified?
- Figure 1 is difficult to understand in its current form. The terms “plot” and “forest” are introduced but are not connected to other parts of the main text. It would also be helpful to map the example explicitly to the notation used later in the paper (). Could the authors rewrite the figure and caption so that the example is directly connected to the notation and the subsequent methodological development?
- The role of as statistical bounds seems to be unclear. Also, it is unclear whether the subsequent replacement memberships are random variables. Could the authors state explicitly what underlies the 95% coverage claim for and whether the guarantee involves randomness in the replacement mechanism as well?
- Could the authors rearrange the current presentation for clarity? a) The last sentence about computational cost in the Proof idea for Proposition 1 should be moved to the next paragraph. b) In equation (5) of Proposition 1, it is unclear what is defined and what is the statement.
Dear AC and Reviewers,
First of all, thank you for your time and helpful feedback, both the recognition of the core idea and theory and the concerns about clarity and practical usefulness.
A revised version has been uploaded with a clearer abstract, introduction and overall presentation, plus a simpler appendix. I believe the narrative is now much clearer, and we agree that the original needed more clarity and focus. To be honest, the technical substance is unchanged: the average gain is small, and it has not shown practical usefulness. This is simply what the empirical results show.
For background, this work grew out of a practical difficulty with low-resolution scientific maps. A real-data case study needs more preparation, so this paper presents a kick-off trial.
Thank you again. Your comments will improve our future work.