- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper introduces an algorithm called iPAMM to solve QUBO problems. The proposed algorithm relies on adding a quadratic shift term analogous to self-feedback in soft-spin Ising models. The author provides in length some theoretical guarantee of fitness increase under specific conditions and numerical results comparing some other QUBO solvers.
Critical strengths
-
The method is quite simple and clear to understand.
-
The paper includes ablation studies and comparisons with several recent learning-based QUBO solvers.
Critical weaknesses
My main concerns are about novelty, practical relevance of the results and limits of empirical results.
- iPAMM's dynamics seems very similar to a hard-threshold soft-spin Ising machine.
- The theoretical guarantee only applies in a limited range for sufficiently large self-gain where spin flipping is already a very rare event. It is unclear how the theoretical guarantees actually describe the benefit of the overall algorithm.
- A large part of the paper is dedicated to the limited scope theoretical analysis, leaving little space for required empirical results for such a work. Comparison to modern Ising machine algorithm is largely absent.
Questions for authors
Q1) Can you clarify the connection with soft-spin Ising models? In particular, the quadratic shift term resembles self-gain and hard thresholding replaces continuous saturation. How does this differ from existing gain-annealing approaches? See in particular:
https://www.nature.com/articles/s42005-021-00655-8
Q2) Can you provide a clear comparison with existing Ising machine algorithms including dSBM, CAC, and hyperspin machine? See:
https://doi.org/10.1103/PhysRevLett.122.040607 https://doi.org/10.1126/sciadv.abe7953 https://doi.org/10.1103/PhysRevLett.132.017301
Q3) How much does the theoretical monotonicity guarantee contribute to the overall optimization performance? How much fitness improves after the gain reaches the guaranteed regime?
Q4) Could the author include benchmarks on planted instances such as Wishart-planted and tile-planted, where instance difficulty with known ground-states can be tuned?
Q5) Could the author report computational time or time-to-solution for the GSET ? This would allow a more meaningful comparison against SOTA Ising machines.