- Rating
- 4(+1)
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper presents a hybrid model that uses a transformer combined a differentiable DSM layer where coupling weights are learned. This allows the model to construct and solve a wide variety of Ising and Potts model problems. Crucially, a relaxation is used to make the DSM layer differentiable during training, and then inference in the DSM layer is done in the standard discrete manner. The model is tested on a small but diverse set of problems, showing improved performance over vanilla transformer models.
Critical strengths
The presented model is compelling, and the allegory with the brain is nice additional motivation. For the most part, the approach to making DSMs learnable seems very natural, and thus provides a good baseline for understanding how DSMs can be combined with neural networks.
The proposed model offers clear benefits over standard transformers. This shows that the addition of the DSM layers is indeed performing useful computation.
This is a particularly clearly written paper that is easy to understand and follow.
The combination of reasoning and perception in the Sudoku problem gives an especially nice example of the power of these hybrid systems. This really highlights the novelty.
Critical weaknesses
The most useful application of this model appears to be in combinatorial optimization, but evaluation is limited to easy instances that classical algorithms can easily solve.
Empirical comparisons are strong against traditional transformers, but appear somewhat mixed against more sophisticated models. It would be nice to have a conceptual comparison against the most closely related neural combinatorial optimization models, and to place the model in the context of neural algorithmic reasoning more broadly.
Although the DSM model seems effective, it is unclear where it will be useful over existing approaches, making it hard to judge practical impact.
Questions for authors
For the experiments, is there currently available DSM hardware that matches the performance of the simulated circuit? If so, why not use it? If not, what barriers remain?
Have the authors considered hybrid models that use the DSM layer in conjunction with other neural algorithmic reasoning architectures, e.g., a recurrent transformer? The composability of the DSM layer seems to be a significant strength.
Can you give motivation for your choice of learned coupling rule? There are a wide range of choices that could be made here.
4 comments
Response to Reviewer 25H1 (part2)
Q3 (choice of the coupling rule).
The couplings are an output of the network, in the same role as attention weights: the coupling between each pair of variables is computed by a symmetric pairwise map of their features, and this is the rule behind all our models. We learn the couplings rather than prescribe them because the rules are usually hidden in the input, in images, language or implicit structure, and cannot be written down in advance. The constraints on the form of this map come from the hardware rather than from the task:
- the couplings are symmetric (), so that the energy is well defined;
- interactions are pairwise, the only kind a DSM implements, and relations among three variables are expressed through auxiliary variables;
- the energy is normalized in scale, so that a given noise amplitude has the same meaning in training and inference.
Thank you for your response. You have addressed all of my concerns and I have raised my score. Not being able to implement this model directly on current hardware is a significant limitation, as other reviewers have mentioned.
We sincerely appreciate your encouraging scores and valuable suggestions. Regarding your additional comment, we fully understand and agree that implementing the method on real hardware is important for a more reliable evaluation. To further strengthen the manuscript at this stage, we have now added and highlighted the experimental results from an existing coupled-oscillator Ising chip in Appendix C.4, providing additional evidence to support the reliability of our simulation-based evaluation. Due to the limited number of available spins, we mainly evaluated a standard synthetic 6×6 Sudoku dataset. The following table compares the hardware measurements with software simulation results, with all reported values averaged over 10 runs.
Table: Comparison of the 2-State Model Between Software Simulation and Measurements on an Oscillator-Based Ising Machine.
| Dataset | Accuracy (%) | Inference (s) | Energy (J) |
|---|---|---|---|
| Sudoku 6×6 (Simulated) | 98.01 ± 0.05 | 4.88 × 10⁻³ | 2.44 × 10⁻⁴ |
| Sudoku 6×6 (Measured) | 98.23 ± 0.03 | 4.65 × 10⁻³ | 2.26 × 10⁻⁴ |
As shown in the table, the hardware measurements from the real chips show good agreement with the simulation results. Interestingly, we observe that the annealing quality (reflected as final accuracy) on real hardware is slightly better than that in simulation. One possible explanation is that the non-idealities in real hardware may perform as an additional noise source, which help the system better escape local minima during annealing. These results provide preliminary hardware evidence supporting the feasibility of our approach and the consistency between simulation and physical implementation.
We also would like to emphasize that we are actively developing a customized chip dedicated to DS-OPT, with tape-out planned for the first half of 2027. Once the chip is fabricated and tested, we plan to replace the corresponding simulation-based results with actual silicon measurements, enabling a more comprehensive hardware evaluation of our proposed approach.
Once again, we sincerely thank you for your time and constructive feedback, which have helped us further strengthen the manuscript. As the discussion phase is approaching its end, we regret that there may not be enough time to receive your further feedback. Nevertheless, we sincerely hope that our response and the additional experimental results have helped address your current concerns.
Response to Reviewer 25H1 (part1)
We thank the reviewer for the positive assessment and the constructive questions.
W1 & W3 (evaluation on easy combinatorial instances; where DS-OPT is useful).
Our target is not to solve explicitly stated combinatorial problems faster than classical solvers, which indeed handle Sudoku or Zebra puzzles easily once the rules are written down. It is reasoning tasks in which the problem is hidden in raw input and must first be constructed: a classical solver cannot read the digit images of visual Sudoku, the free-text clues of a logic puzzle, or write down the rules of image completion. Our results show that this construction step, not the solving, is where the difficulty lies. In visual Sudoku, solving the LeNet's fixed readings with the same DSM succeeds on only 61.1% of the boards, while joint reading and reasoning solves 97.2%. To make this point clearer, we have added ZebraLogic (Lin et al., 2025), which states Zebra puzzles in natural language and is challenging even for large reasoning models (new Table and Section 4.4):
A small language model only needs to read the clues and construct the energy, while the DSM performs the reasoning; models up to 50 times larger that must also reason in their forward pass stay far below. As for practical impact, DS-OPT targets this class of perception- and language-grounded reasoning, and the DSM gives it an efficient substrate: circuit-level simulation estimates its inference time and energy at a fraction of those of neural models of similar accuracy (Tables 1–2), a step toward complex reasoning on power-limited edge devices. Scaling to larger and harder combinatorial instances, across several DSM cores, is a natural next step.
W2 (comparison with more sophisticated models; neural combinatorial optimization and algorithmic reasoning).
The published models that surpass DS-OPT use far more parameters or data: on Zebra, masked diffusion and flow models reach 98.5–100% with 14–19× more parameters and 5× more training puzzles, and on visual Sudoku IRED reports 98.3% with at least 36× more parameters. At comparable scale DS-OPT is the most accurate, and we have added comparisons that make this explicit: TRM and HRM scaled to our compute (Section 4.5) and the Recurrent Transformer trained with the same data as DS-OPT (Table 2). We have also measured the published models on an A100: their inference energy is 2–1,700× our circuit-level estimate. Following the reviewer's suggestion, we have added a paragraph to the related work on neural combinatorial optimization and neural algorithmic reasoning. Both learn how to solve a problem that is stated explicitly, either by constructing solutions or heatmaps for routing and graph problems, or by imitating the steps of classical algorithms. DS-OPT addresses the complementary setting in which the problem must be constructed from raw input, and leaves the solving to the native dynamics of the DSM.
Q1 (available DSM hardware).
No existing chip yet matches the multi-state DSM of DS-OPT exactly; we are developing this chip and expect to tape it out next year. As described in Appendix C.4, we have also run the 2-state form of DS-OPT on an existing coupled-oscillator Ising chip, where its behavior agreed well with the simulation.
Q2 (combining the DSM layer with other reasoning architectures).
We appreciate the reviewer for pointing out that the composability is actually a strength of DS-OPT. We have tested in a new experiment, where we place DS-OPT inside a recurrent loop in which the DSM state is fed back to the Transformer for a second pass. The looped model solves 99.1% of the Zebra test puzzles, compared with 98.4% for a single pass (Table 1), showing that the DSM layer composes with recurrent architectures and benefits from them. We have also mentioned this in the contribution part in the revision.
(Due to the word limit, the rest of response will follow in the next message.)