- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes IP-ADMM and a checkpoint variant for block-structured nonconvex optimization with nonlinear inequality constraints. It establishes finite-time guarantees for several stationarity certificates and evaluates the methods on small physics simulation problems.
Critical strengths
The method preserves independent local updates with closed-form constraint handling. The analysis explicitly distinguishes guarantees available without constraint qualifications from stronger KKT guarantees under Uniform Band-MFCQ, providing a useful theoretical treatment of constrained splitting methods.
Critical weaknesses
1, Insufficient relevance to ICLR. The central contribution concerns convergence analysis for general constrained optimization, making the paper appear more naturally suited to operations research or mathematical optimization. Although the introduction discusses differentiable simulation and world models, the experiments do not demonstrate an application to learning or establish a concrete consequence for machine learning. The relevance to the ICLR audience therefore remains insufficiently justified.
2, Limited connection between theory and practical performance. The main convergence experiments involve small 2D problems with only 8–24 objects or nodes. The practical parameters are not covered by the stated sufficient parameter construction, while Appendix C shows substantially worse finite-budget certificates with theorem-sufficient settings. Moreover, the KKT guarantees require an unverified Uniform Band-MFCQ condition, and neither variant reaches the KKT threshold on the larger main instances. The additional timing study shows only approximately 1.3× speedup and measures fixed sweeps rather than time to a common solution tolerance. These results leave the practical significance of the guarantees unclear.
Questions for authors
1, What concrete implication for a learning problem follows from the proposed guarantees, beyond the general motivation that simulation supports AI?
2, Can the guarantees be extended to the practical parameter settings, or can comparable practical performance be demonstrated with parameters satisfying the theoretical conditions?