- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes PB-HGNN, an unsupervised hypergraph neural network framework for solving PUBO problems. It follows the same hypergraph modeling paradigm as prior work, while introducing training mechanisms aimed at enhancing HyperGNN's performance. The evaluation covers hypergraph max-cut, minimum hitting set, and max-3-sat problems.
Critical strengths
1.High-order combinatorial optimization on hypergraphs is an important challenge.
Critical weaknesses
1.The idea is incremental. This paper adopts BIPNN's hypergraph modeling for PUBO problems, while recurrent feedback has been explored in prior methods such as QRF-GNN. The main contributions therefore appear to lie in adapting these ideas to high-order hypergraph optimization, together with LOO messages and incumbent tracking. Although these adaptations may be useful, the authors should better clarify their novelty.
2.Important baselines are missing. The PUBO problem can be transformed into a QUBO formulation and solved with QUBO solvers such as PyQUBO. Since this paper focuses on unconstrained PUBO, comparisons against strong baselines like Gurobi and PyQUBO are absent and sorely needed.
Questions for authors
The core methodological contribution appears to be an integration and adaptation of existing ideas, and the distinction from BIPNN and prior recurrent neural optimization methods is not yet sufficiently compelling. I would encourage the authors to strengthen the novelty discussion and provide more comprehensive ablations and baseline comparisons.