mlsanityData to 7 Oct 2026

Scalable Physics-Inspired Transformers for Spin Glasses

arXiv 2606.22984 ↗First posted 22 Jun 2026cond-mat.dis-nn cond-mat.stat-mech cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Efficient sampling of the Boltzmann distribution in frustrated spin glasses is central to statistical mechanics and combinatorial optimization. Despite advances in machine-learning-based approaches, two issues persist: limited understanding of why variational models fail to benefit from increased scale, unlike the monotonic scaling law of large language models; and high computational cost on large systems that negates advantages over classical sampling methods. Here, we develop a physics-inspired transformer with interpretable sparse attention and spin-tailored positional embeddings to address these challenges. By further leveraging FlashAttention for parallel ancestral sampling, it achieves up to two orders of magnitude speedup over vanilla variational autoregressive networks, enabling neural-network simulations of spin-glass systems to unprecedented sizes on a single GPU. It can resolve full probability distributions, free energies, and overlap statistics across temperatures, for Sherrington-Kirkpatrick and 2D or 3D Edwards-Anderson models, where existing machine-learning methods encounter limitations at certain temperatures. This framework thus establishes a scalable paradigm for frustrated spin-glass systems.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 24 of its 68 references that are in the map. First posted on arXiv 22 Jun 2026.

Builds on

24 of 68 references.

References · 24

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
  3. 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,581
  4. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
  5. 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,551
  6. 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 776
  7. 2022Efficiently Scaling Transformer Inferencecited by 529
  8. 2024FlashAttention-3: Fast and Accurate Attention with Asynchrony and Low-precisioncited by 507
  9. 2025Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attentioncited by 391
  10. 2025Muon is Scalable for LLM Trainingcited by 381
  11. 2023The Impact of Positional Encoding on Length Generalization in Transformerscited by 319
  12. 2015MADE: Masked Autoencoder for Distribution Estimationcited by 306
12 more
  1. 2019Limitations of the Empirical Fisher Approximation for Natural Gradient Descentcited by 213
  2. 2018Online normalizer calculation for softmaxcited by 154
  3. 2018A high-bias, low-variance introduction to Machine Learning for physicistscited by 108
  4. 2021Combinatorial Optimization with Physics-Inspired Graph Neural Networkscited by 107
  5. 2018Solving Statistical Mechanics Using Variational Autoregressive Networkscited by 99
  6. 2016Neural Autoregressive Distribution Estimationcited by 94
  7. 2021Variational Neural Annealingcited by 45
  8. 2022Neural-network solutions to stochastic reaction networkscited by 8
  9. 2024Are queries and keys always relevant? A case study on Transformer wave functionscited by 5
  10. 2023Deep reinforced learning heuristic tested on spin-glass ground states: The larger picturecited by 3
  11. 2025Demonstrating Real Advantage of Machine-Learning-Enhanced Monte Carlo for Combinatorial Optimizationcited by 3
  12. 2025Tracking large chemical reaction networks and rare events by neural networkscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.