- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper aims to accelerate the repair procedure of the constraint satisfaction method. Previously, the SOTA methods iterated between the constraint projector and the evaluator, using soft penalties to design the training loss. This paper identifies three drawbacks of prior works: 1) computational overheads induced by iterative repairs, 2) hard constraint satisfaction not guaranteed by soft penalties, and 3) insufficient awareness of constraint satisfaction during training. Accordingly, the paper addresses them by using single-step repair in training and proposing a projection-adaptive loss to enhance feasibility awareness. The proposed method is evaluated on synthetic and engineering benchmarks, achieving acceleration and higher feasibility in nonlinear problems.
Critical strengths
- This work is well-motivated and easy to follow.
- The effectiveness of the proposed method is validated in extensive benchmarks.
- The code is provided, facilitating future work.
Critical weaknesses
- The overall idea is quite straightforward with limited novelty.
- Why can the projection-adaptive loss enhance feasibility awareness? I would expect a more in-depth understanding or justification.
- The tables are hard to follow. For example, Table 1 uses too many colors without explanation.
- The evaluation metrics are not sufficiently justified. Why can forward and backward passes represent computational overhead? The efficiency of these processes depends on network size and architecture, which differ across methods. Why use different metrics- memory and time- in different benchmarks?
- It would be better to provide an anytime comparison for different baselines.
Questions for authors
See Weaknesses
2 comments
Follow-up on our Rebuttal
Dear Reviewer Dns1,
Thank you again for your feedback and questions.
As the discussion period nears its end, we'd appreciate any final thoughts you may have on our responses, if time permits. We'd also be happy to clarify further.
If you feel that our responses have addressed your concerns, we would appreciate it if you could take them into account when finalizing your evaluation.
Reply to Reviewer Dns1
Novelty
We disagree.
In-depth Understanding and Justification
The paper answers this in several places:
If something remains unclear, we kindly ask the reviewer to point to it more specifically, and we will gladly clarify!
Table readability
We have added a colorbar to Table 1. If you find any other table is hard to read, please let us know more specifically and we will gladly consider further improvements.
Evaluation Metrics
We focus on applications where constraint evaluation is expensive. Measuring forward and backward passes on the constraint evaluation is the best non-polluting method for measuring compute. It is not dependent on controlling implementation details across 7-8 methods. Given same net size, this overhead is constant across all methods.
We would like to clarify that all methods use the same network size and architecture on each benchmark (Appendix N.2).
In the engineering benchmarks, we focus on practical implications and highlight how, on different problem archetypes, PAL helps with core challenges. For Urban and UAV this is memory due to the very expensive evaluator. On the ACOPF benchmark, it is the extremely high number of constraints resulting in costly Jacobian builds. Peak memory and wall-clock time measure these challenges directly.
### Anytime comparison
We have added an anytime comparison in the new Appendix Q since it also helps answer some questions by other reviewers. This is not a new experiment, just a more detailed visualization. Thank you for this suggestion!
Further Points
We would be glad to hear whether these clarifications and improvements change your view of the paper. If there is anything else we could do to support a higher score in your view, please let us know!