- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes a certified compression framework for finite instrumental-variable (IV) partial identification. The main idea is to reduce the outcome support using a stochastic mapping that preserves the causal target while allowing the identified set to become less sharp. The authors establish theoretical guarantees for target preservation and outer validity, introduce an anytime refinement procedure, and demonstrate substantial computational speedups on synthetic experiments and the JTPA dataset.
Critical strengths
The theoretical framework is generally well developed. The main results are supported by explicit constructions and proofs, including a useful counterexample showing the limitations of mesh-based sharpness guarantees.
The paper addresses a meaningful computational problem in causal inference, with a clear distinction between target preservation, validity, and sharpness.
Critical weaknesses
The core construction builds on existing barycentric stochastic quantization. While the causal lifting interpretation is useful, several theoretical results follow rather directly from linearity, stochasticity, and set inclusion. Hence, I suppose the novelty of contributions is limited.
The sharpness bounds depend on optimal dual solutions of the original problem, which largely defeats the purpose of compression. As a result, the method guarantees validity but does not provide a practical way to determine how much sharpness has been lost.
The improvement over simple geometric refinement is relatively small in most reported settings. E.g., median width inflation decreases only from 2.13% to 1.99% in nonadversarial experiments.
Questions for authors
The authors should prioritize address the weaknesses in rebuttal.
3 comments
Response to rebuttal
Dear authors,
I remain concerned about the novelty of this work, so I will keep my assessment unchanged. Thank you for your effort.
Best.
Thank you for recognizing the rigorous construction, the sharpness counterexample, and the distinction between target preservation, validity, and sharpness. We have substantially strengthened the third version along precisely these lines.
1. Theoretical contribution and novelty boundary. We distinguish the established barycentric interpolation primitive from the causal model-level guarantee of Theorem 1. Theorem 3 characterizes necessity within the shared product-kernel class, while Theorem 5 proves that mesh size alone cannot uniformly control sharpness loss. Beyond the original affine setting, the new Proposition prop:nonlinear (main Section 3; Appendix A) proves preservation of mixed cross-world moments and polynomial restrictions, including an explicit nonconvex zero-covariance IV example. This extension is intentionally scoped, not presented as a universal nonlinear causal abstraction theorem.
2. We agree with your original-dual objection. The conditional bounds on numerical sharpness loss require optimal dual solutions of the original problem; they are not inexpensive surrogate-only numerical gap estimates. We have made this limitation explicit in Section 4 and Appendix app:dual.
Our practical guarantee answers a different question. If a compressed certified outer interval is , then identified-set inclusion implies
Consequently, or certifies the corresponding threshold conclusion for every original-compatible causal effect. This decision certificate requires neither original optimal dual solutions nor original sharp endpoints during execution (Section 4; Proposition prop:outercomposition; Algorithm 1). We do not conflate decision certification with estimating the remaining sharpness gap.
3. Adaptive refinement makes an important difference in the challenging regime. We agree that ordinary-family improvements are modest: at , median width inflation decreases only from 2.13% (geometric) to 1.99% (dual-guided). We therefore added a counterexample-derived hard family emphasizing actual sign-certification success.
At , geometric/mass/displacement refinement certifies 12/80, 72/80, and 80/80 identifiable signs. At , the corresponding counts are 6/144, 122/144, and 114/144. Thus no adaptive policy universally dominates; nevertheless, refinement choice can decisively affect whether a valid original-target conclusion is reached.
A separate fresh-process comparison against strong exact HiGHS sign-first baselines measures the complete refinement procedure. For mass-weighted compression at , it reports 240/240 successful repeated decisions and a 3.199× median paired runtime improvement, conditional on successful certification (Section 5; Appendix app:decision-benchmark).
These revisions acknowledge the dual-dependence limitation while demonstrating a separate, operationally useful certificate and substantially more informative evidence on adaptive refinement.
We respectfully invite you to reassess the stronger theoretical scope and decision-oriented experiments in the third version.
We thank the reviewer for recognizing the explicit theoretical constructions, the sharpness counterexample, and the distinction between target preservation, validity, and sharpness. We revised the manuscript and added targeted experiments addressing all three principal concerns.
1. Novelty relative to barycentric stochastic quantization.
Our construction uses established mean-preserving interpolation. The additional theoretical contribution is a finite-IV causal feasible-model transformation.
Theorem 1 maps each original feasible latent response-type distribution to a compressed distribution while preserving its designated causal effect, observation equations, and admissible treatment-response patterns. This proves original-to-compressed identified-set inclusion for the complete set of compatible causal effects.
Theorem 3 characterizes preservation requirements within the shared coordinatewise product-kernel class. Theorem 5 establishes a sharpness limitation that motivates the certified refinement procedure.
We revised Sections 1–3 to explain these results as one coherent causal representation guarantee and to distinguish the mathematical contribution from the underlying interpolation primitive.
2. Practical certification and dependence on original optimal dual solutions.
Your observation about the conditional sharpness-loss bounds is correct: the numerical sensitivity estimates use optimal dual coefficients of the original IV problem.
We now distinguish numerical sharpness-loss estimation from certification of the causal conclusion itself.
The revised Section 4 includes an explicit decision-stopping corollary and short proof.
Let [L,U] be the original sharp interval and [a,b] a certified compressed outer interval. Theorem 1 guarantees
a ≤ L ≤ U ≤ b.
Consequently, if a > τ, every original compatible causal effect exceeds τ; if b < τ, every such effect is below τ.
For τ=0, this provides a certified ATE-sign decision. The stopping rule requires the current surrogate outer interval and threshold, without solving the original LP or obtaining its optimal dual coefficients.
This gives an operational guarantee for a practically relevant task. Numerical certification of the remaining sharpness gap remains a distinct objective addressed by the conditional dual sensitivity analysis.
3. Are adaptive improvements meaningful?
We retain the original nonadversarial experiments, including the modest median width-inflation improvement from 2.13% to 1.99%.
To investigate instances where support allocation substantially affects the result, we added a targeted hard family derived from the sharpness counterexample.
At n=48, M=8, the numbers of certified signs are:
At n=96, M=8, the corresponding results are 6/144, 122/144, and 114/144. At M=16, both mass-weighted and displacement-guided refinement certify all 144 identifiable signs.
These experiments demonstrate that the choice of refinement policy can materially affect the resolution needed to establish a causal decision. They also show that displacement guidance is not uniformly superior: mass weighting performs better at n=96, M=8.
4. End-to-end computational value.
We additionally evaluated complete time to certified decision against strong original-IV LP baselines, including sign-first algorithms. The n=48 experiment uses 80 predefined populations and three fresh-process timing repetitions per case, with all algorithmic refinement overhead included. Mass-weighted refinement certifies 240/240 repeated decisions by M=16, with a median paired exact/compressed runtime ratio of 3.199× on successful certifications.
The revised Section 5 and Appendix C provide the full experimental design, certification outcomes, timing methodology, and limitations of this constructed stress-test family.
Together, the revisions make the causal representation contribution more precise, establish a useful decision certificate independent of the original optimal dual during execution, and directly demonstrate when adaptive refinement matters. We hope these additions provide stronger grounds for reconsidering the recommendation.