- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper studies geometric limitations of ray-based learning-to-optimize methods. It introduces ((A,K))-star-coverability, where (A) counts interior anchors and (K) counts feasible segments along each ray. PRISM uses a shared network and a ray-intersection oracle to generate feasible candidates, then selects one through hard routing. The paper provides conditional approximation and reachability results, a data-driven configuration procedure, and experiments on synthetic geometries and parametric optimization problems, including a separate certified AC-OPF extension.
Critical strengths
-
The distinction between feasibility, reachability, and trainability is useful. The geometric examples clearly demonstrate why training cannot overcome an insufficient representation.
-
The anchor–segment formulation is interpretable, and the controlled synthetic experiments support the benefits of increasing geometric coverage.
-
The authors explicitly disclose limitations, experimental selection procedures, and negative results.
Critical weaknesses
-
The presentation obscures the central contribution. The generic ray method, the specialized SOCP active-manifold configuration, and the case30 certified-path method have different mechanisms and guarantees. Their presentation under one framework makes it difficult to identify which results validate the proposed anchor–segment representation.
-
Some empirical results require independent confirmation. Appendix D.14 selects the better anchor descriptor retrospectively on the reporting split. Appendix D.13 also states that the SOCP-100D configuration was developed using data overlapping the reporting split. Furthermore, the three legacy AC-OPF rows evaluate coordinate-surrogate objectives and box residuals, rather than generation cost and full AC feasibility. These distinctions limit the interpretation of the aggregate “12/15” result.
-
Practical benefits remain conditional. PRISM requires valid interior anchors and an exact or certified intersection oracle, which may be expensive to obtain for complex non-convex problems. The synthetic experiments establish the geometric mechanism, but broader application benefits are less convincing. On certified case30, initial roots are available for 54/64 loads, and the numerical-gradient direction outperforms both learned directions in mean cost gap. This supports the certification mechanism more strongly than the benefit of learning.
Questions for authors
-
Can the authors provide results with descriptor and configuration choices fixed independently of the reporting data, separating the generic ray method from specialized extensions?
-
In the intended application setting, what is the end-to-end cost, including anchor acquisition and oracle evaluation, and what measurable benefit does learning provide?
3 comments
Thanks for your efforts. I will maintain my assessment.
Thank you for taking the time to read our response. We appreciate your feedback on separating the generic ray method from the specialized extensions and reporting the evaluation with choices fixed before testing.
Thank you. We added tests with choices frozen before generating new inputs and report both descriptors. The revision distinguishes complete-predictor performance, learning attribution and costs within PRISM's feasibility-first design.
Weakness 1 - Distinct mechanisms. Generic PRISM uses valid anchors, ordered ray segments and hard selection. Specialized SOCP uses a numerical active-manifold proposal followed by ray readout, not path certification. Case30 certifies local feasible root paths and cost-decreasing re-anchoring. These are native extensions with separate contracts and evidence, not interchangeable theorems or latencies. The pooled "12/15" headline is removed.
Weakness 2 - Independent confirmation. Each task has 2,048 fresh instances. Saved checkpoints were frozen; missing slot checkpoints were reproduced with fixed recipes and identified. Both descriptors are reported. Coordinate-minus-slot losses are -0.380 [-0.527,-0.243] on Rings-8 and +0.039 [0.026,0.051] on Spiral; Disks-16 is unresolved (pointwise paired 95% intervals).
PRISM/HoP objective-minus-reference losses are 0.549/0.755 on TwoDisks, 0.122/0.330 on Annulus and 0.862/1.516 on Sin-QP; both pass 10−5. These compare configured predictors, not one changed resource. Generic SOCP, specialized SOCP and OptNet give 16.16, 3.46 and 3.15. Legacy AC rows retain their surrogate-objective/box-residual scope. Fresh tests evaluate fixed choices without erasing historical selection exposure (Sec. 5.2, App. F.1).
Weakness 3 - Practical conditions. The ray-based method targets repeated solves of families with valid anchors and closed-form or soundly isolated one-dimensional crossings. We do not assume arbitrary nonconvex constraints provide cheap anchors/oracles. Curved paths use a separate local certificate. Initial roots are certified on 54/64 loads; the other ten remain unavailable, not proven infeasible. MOVE-GRAD and MOVE-NN both use our proposed certification/re-anchoring mechanism. The gradient policy has a lower mean cost gap (1.43% versus 1.55%/1.67%); this limits the learning claim, not the validity of that construction (Sec. 5.3, App. B).
Question 1 - Frozen choices and separate results. Yes: pipeline choices precede the new inputs, both descriptors are retained without test-set selection, and frozen checkpoints are distinguished from fixed-recipe reproductions. Generic rays, specialized SOCP and case30 have separate results (Weaknesses 1-2; App. F.1).
Question 2 - Cost and learning benefit. Learning: A separate fresh stream shares anchors, oracle, radial search and selection and counts every ray call. Learned directions beat random on five tasks, including four-times-budget random. At equal queries they beat both numerical proposers on Spiral (-0.052/-0.045) and Sin-QP (-2.64/-1.43). Numerical search is stronger on Disks-16, Rings-8 is unresolved, and NUMERIC is stronger on QCQP (+1.55). Larger budgets remove or reverse gains. These isolate finite-budget direction quality, not native radius/router performance (App. F.3).
Batch cost: For the first frozen checkpoint on existing E1 inputs, batch-512 five-pass median transfer-inference-return-check times on an A100 are 17.48/42.62 microseconds per input for QCQP/generic SOCP, versus 90.61/169.62 on one pinned CPU logical core. These are amortized batch times, not request latencies. Small batches and Sin-QP show no GPU benefit; HoP is faster on the matched grid. All five-pass ranges on the shared host are reported. Collation, loading, fixed-anchor acquisition and offline costs are excluded: this is a same-method hardware profile, not complete amortized cost or an equal-hardware solver speedup (App. F.8).
Including acquisition: Our historical case30 numerical service and sequential local-reference service return checked states on the same 57/64 loads. Three-repeat mean times for all 64 attempts are 2.204/28.795 s, including 1.607 s for our acquisition; the 2.214% mean cost premium concerns 57 common successes. This exposed engineering workload is not fresh confirmation, a quality-matched speedup or certified-path timing (App. B.3).
Components: On 225 stored selection states, network-only proposals average 0.18 ms versus 1.19 ms for gradients. The current NN arm computes both; prefix certification dominates separately recorded trajectory costs. No full no-gradient certified trajectory was tested. Serial speculative acquisition reduces solver calls without a consistent time gain (App. D.15, F.8).