- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes AdaptCNLM, a SAT model-finding framework that combines variable aggregation with adaptive clause weighting. A variable-clause GNN supplies grouping information; tying variables reduces the Boolean search space, simplifies clauses, and lowers the size of a subsequent QUBO. The deployed pipeline additionally builds a pool through confidence-weighted WalkSAT, fixes variables that agree across the sampled pool, performs affinity-filtered greedy merges, and selects reduced models using projected-pool violation counts. Static clause difficulty weights, dynamic increases for currently violated clauses, probabilistic smoothing, and a global energy scale guide subsequent search.
Critical strengths
-
A clear and useful characterization of lossy restriction. Theorem 1 then establishes exact weighted-objective agreement at every lifted assignment and a bijection to the original solutions that lie in the restricted image. Theorem 2 gives a simple, explicit first-moment warning about overly aggressive instance-independent compression. These results do not guarantee the learned grouping succeeds, but they provide an appropriate mathematical foundation and make the loss of feasible assignments visible instead of hiding it. This is a substantive positive for a heuristic compression method.
-
Promising measured resource savings with useful budget transparency. Table 1 reports materially smaller logical and embedded models alongside improved verified success under the same simulated-annealing sampler. The SATLIB comparison covers multiple families and includes strong classical local-search references as well as learned methods. These details make the result more credible as an end-to-end empirical observation, even though component attribution remains unresolved.
Critical weaknesses
-
The learned-compression contribution is not isolated, and the QUBO construction is under-specified. The appendix relies on extensive classical preprocessing and model construction, including variable fixing and certificate-based selection, so the ablation cannot show whether the neural component drives the gains. A direct control would compare the no-network setting and random affinities while holding the pool, fixing, guard, gadget, and time budget identical. Successes from pre-annealing certificates should also be separated from new solutions found by the sampler, and the ancilla-count, penalty, and certificate-acceptance details need explicit definition.
-
The evidence does not yet justify the claimed additional confidence or general solver benefits. The ablation’s marginal contrast is small, and the reported uncertainty concerns the full method versus the baseline rather than that contrast; repeated runs with paired uncertainty are needed. The dynamic weighting also needs sharper positioning against prior precedent and a closely related control, since reweighting cannot recover assignments excluded by aggregation. The quantum interpretation remains conditional: the theorem assumes a WKB-style rate law and common prefactor, so it does not establish applicability to the reported QUBOs or the plotted gap scaling without further validation or a narrower claim.
Questions for authors
-
With the same elite pool, empirical fixings, merge procedure, compact gadget, and total time budget, how do the trained affinities compare with rho=1 and random affinities at rho=0.6? Please also report how many instances already have a verified solution during pool/certificate construction, and the sampler's additional success on the unresolved cases. A clear advantage here would materially strengthen the central neural-compression claim.
-
What are the exact compact-gadget polynomial, t(kappa), sufficient penalty weights, simplification rules, and candidate-merge acceptance conditions? Does the guard constrain cert(g), and how are harmful empirical fixings or failed reduced models handled? Explicit pseudocode and the precise represented objective would resolve the present gap between the CNF theorem and the deployed solver.
-
Can you provide per-instance, repeated-seed results for A+B+ versus A+B-, separating static weighting, dynamic weighting, and the global scale/effective-temperature schedule, together with a closely related dynamic-weighting baseline? Please give paired uncertainty for both this marginal effect and the reported 105-versus-102 SATLIB comparison. This would determine whether the second component and overall classical advantage are reliable.
-
For which explicit driver, problem Hamiltonian, and annealing schedule does Fig.4's minimum-gap scaling hold, and what evidence supports using the assumed WKB law for the proposed QUBOs? A derivation or small exact spectral calculation would help; alternatively, would you limit these statements to an illustrative conditional model and state the demonstrated contribution in terms of classical search and encoding resources?
Thanks
Once again, we sincerely thank you for your valuable comments. We hope that our responses have adequately addressed all of your concerns. We would be happy to address any further questions or provide additional clarification regarding the novelty and contributions of our work.