- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper investigates transferring the FORGE representation-learning framework from mixed-integer programming (MIP) to Boolean satisfiability (SAT). Motivated by their shared constraint–variable graph structure and the cost of solver-generated labels, the authors explore direct MIP-pretrained transfer, SAT-specific feature adaptation, and SAT-native unsupervised pretraining. Experiments show that MIP-pretrained embeddings retain structural information, while FORGE-SAT achieves the highest clustering NMI and provides frozen representations with average cross-distribution prediction performance comparable to baselines.
Critical strengths
- The paper addresses a question about reusing unsupervised representations across optimization and decision problems. Such reuse could reduce dependence on task-specific training and solver-generated labels.
Critical weaknesses
- The technical contribution is limited. Most of proposed techniques reuse the existing FORGE, including model architecture and pretraining tasks.
- The benefit of transferring MIP-pretrained model to SAT is not clear enough. In Table 1, Forge-SAT, trained from scratch on SAT, achieves better NMI than the others.
- The existing downstream tasks provide limited evidence of practical utility for SAT solving. It only considers satisfiability prediction.
Questions for authors
- Please clarify the above weaknesses.
- Can the learned representions enhance SAT solver? Please give an example or explanation. If so, what’s the runtime overhead to obtain the embeddings? Does it account for a substantial fraction of the total solving time?
Rebuttal
Thank you for your review. We appreciate that you recognize the value of reusing unsupervised representations across optimization and decision problems. We address your concerns below.
[W1] Technical contribution. We intentionally reused FORGE to explore what transfers, without labels, between two very different problem classes. The contribution is the evidence that this reuse works to some extent, and we additionally characterize how:
These findings show the possibilities and limits of cross-problem transfer, and what a unified MIP–SAT encoder would need, such as width-preserving normalization, with edge weighting and literal polarity as further candidates.
[W2] Benefit of transferring the MIP-pretrained model. The benefit is to show that, to some extent, we don't need SAT training at all. The MIP-pretrained models work for SAT:
Hence, MIP transfer is a free, label-free starting point, and FORGE-SAT improves clustering on G4SATBench and can be potentially useful for downstream prediction. We attribute the transfer to the MIP-pretrained encoder as a whole and do not separate its design from its weights.
[W3, Q2] Practical utility for SAT solving, and overhead. While preparing this response we found that our GGNN baseline applied a sigmoid twice. Retrained correctly, the supervised GGNN reaches 0.758 held-out AUROC (submitted 0.604), above frozen FORGE-SAT (0.600). The revised paper reports this and positions FORGE-SAT as a label-free, reusable representation, not a replacement for a supervised GNN. This work is about the potential and limits of FORGE transferability across problem classes. Beyond satisfiability prediction, the NeuroSAT result above is the most direct evidence: NeuroSAT is itself a neural SAT solver, and FORGE-SAT embeddings make it train faster on most families. A random-weight FORGE encoder gives a comparable speed-up, so much of it comes from FORGE’s features and architecture (Appendix A.6). We also added real-world clustering by application family, which is relevant to per-instance solver selection.
For Q2, we find that FORGE-SAT is the fastest of the three learned pipelines. Medians per instance (unbatched, GPU, shared machine; indicative):
FORGE-SAT is about 2× faster than GGNN and NeuroSAT on Easy and slightly faster on Hard, where CNF → graph preprocessing dominates all three (105–128 ms) end-to-end. Its forward pass alone is 7–9$\times$ cheaper. On most instances any learned pipeline costs more than solving; on the hardest ones, where learned guidance matters most, it is a small fraction (Hard 3-SAT median solve: 934 ms). The encoder is pretrained once without labels and reused frozen; a new task needs only a small head (about 6.5 s to train). We have not evaluated a solver integration and already list it, with assignment and UNSAT-core prediction, as future work
Hence, our claim is that FORGE representations capture SAT family structure, transfer from MIP with no SAT training, and speed up NeuroSAT training on most families. We hope this clarifies the contribution and would be grateful if you would consider raising the score.