arXiv Machine Learning By Qian-Rui Lee, Daw-Wei Wang

Efficient identification of critical regions via Flow Matching-based Monte Carlo initialization

Read the original on arXiv Machine Learning →

arXiv:2508. 15318v5 Announce Type: replace-cross Abstract: Markov chain Monte Carlo (MCMC) is a standard tool for studying many-body systems, but its practical cost can become substantial, especially when simulations must be repeated across temperatures and lattice sizes or near transition regions where equilibration becomes increasingly difficult.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Sep 4

Generative Nested Sampling of Atomistic Thermodynamic Landscapes

The paper introduces NS‑Flows, a flow‑based nested sampling method that replaces Markov‑chain updates with a conditional normalizing flow trained on live sets. By applying this technique to a Lennard‑Jones particle system, the authors achieve over two orders of magnitude fewer energy evaluations and a roughly one‑third reduction in wall‑clock time compared to traditional nested sampling. The study also shows that the flow’s generation efficiency varies non‑monotonically along the annealing trajectory, providing a diagnostic of the system’s internal mode complexity and identifying liquid‑like ensembles as the most challenging for current flow architectures.

By Alessandro Coretti, Nico Unglert, Sebastian Falkner, Georg K. H. Madsen, Christoph Dellago
arXiv AI
Sep 15

IsingFormer: Augmenting Parallel Tempering With Learned Proposals

The paper introduces IsingFormer, a Transformer model trained on long‑run MCMC configurations, which provides global proposal moves for Parallel Tempering (PT). By integrating these learned proposals into PT—forming Transformer‑Augmented Parallel Tempering (TAPT)—the authors demonstrate lower residual energies on 3D spin‑glass instances and improved efficiency on integer factorization tasks. A scaling study shows TAPT reduces the time‑to‑solution exponent by about 33% compared to standard PT across tested problem sizes.

By Saleh Bunaiyan, Corentin Delacour, Shuvro Chowdhury, Kyle Lee, Abdelrahman S. Abdelrahman, Kerem Y. Camsari
arXiv Machine Learning
Sep 22

SPIBER: Reconstructing Free Energy Landscapes from Short, Unconverged Trajectories with Generative Flow Networks

arXiv:2609.22663v1 Announce Type: cross Abstract: Molecular systems have many degrees of freedom, but their metastable behavior can often be described by a few collective variables. Identifying these...

By Venkata Sai Sreyas Adury (Chemical Physics Program and Institute for Physical Science and Technology, University of Maryland), Pratyush Tiwary (Biophysics Program and Institute for Physical Science and Technology, University of Maryland, Department of Chemistry and Biochemistry and Institute for Physical Science and Technology, University of Maryland, University of Maryland Institute for Health Computing, Bethesda, USA)