- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes SnareNet, an end2end neural-based framework to ensure strict feasibility. The work uses a differentiable repair layer to make the output of neural network within the feasible region. Meanwhile, it proposes a technique called adaptive relaxation (AdaRel), to guide the early exploration of the neural network by relaxing feasibility requirements during the initial training phase. Experimental results show that SnareNet works well in constraint optimization problems and trajectory planning benchmarks.
Critical strengths
-
This paper studies the constraint satisfactory in convex and non-conex problem, which is important, and through regularized adaptive Newton update to implement repair layer. The paper is very well-writen and easy to follow.
-
The theoratical analysis shows the convergence of SnareNet in linear, convex, and non-convex constraint problem.
Critical weaknesses
-
The same repair technique seems already used in a published paper, HardNet++: Nonlinear Constraint Enforcement in Neural Networks [1], which uses the formula . Additionally, the proposed training method AdaRel is more like an engineering optimization.
-
Another main concern is about the scalability. The results in App. H show the memory bottleneck in large problems, which is predictive since it uses an iterative matrix computation and also as the analysis in Sec. 4.4. Although the authors gives some explanation, the reviewer think is a key problem, since many real-world physical problems, such as the optimal power flow problem in electrical systems mentioned in the author's introduction, often involve thousands of variables and constraints.
[1] Goertzen, Andrea, et al. "HardNet++: Nonlinear Constraint Enforcement in Neural Networks." IEEE Control Systems Letters (2026).
Questions for authors
- Could the authors clarify the difference between SnareNet and HardNet++ and compare their performance?
- Could the authors further explan that why iterative methods like conjugate gradient got divergence in SnareNet?
- Could the AdaRel method be generalized to other iterative-based repairation method? Additionally, could the authors analyze the sensitivity of in convex/non-convex QCQPs?