Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Symposium on Lattice Field Theory (LATTICE)

Machine learning inspired analysis of the Ising model transition

Sam Foreman, Joel Giedt, Yannick Meurice, Judah Unmuth-Yockey

Published May 29, 2019• 2 citations
Publisher

Abstract

We illustrate how principal component analysis of simulation data represented as images generated from the worm algorithm, a method to sample the strong coupling contributions, can be used to identify the critical temperature $T_c$ in the Ising model. It is shown that the eigenvalue corresponding to the first principal component of the covariance matrix obtained from pixel ensembles scales logarithmically as one approaches $T_c$, in a way that is similar to the specific heat. We then illustrate how to block the resulting worm configurations under renormalization group transformations. It is found that curves for the variance of the average number of bonds can be scaled appropriately to illustrate universal behavior under the renormalization group transformation, and that discrepancies can be understood as an effect of approximations.

DOI
10.22323/1.334.0245

Related papers

RG-inspired machine learning for lattice field theory

Sam Foreman, Joel Giedt, Yannick Meurice +1 more

Machine learning has been a fast growing field of research in several areas dealing with large datasets. We report recent attempts to use renormalization group (RG) ideas in the context of machine learning. We examine coarse graining procedures for perceptron models designed to identify the digits of the MNIST data. We discuss the correspondence between principal components analysis (PCA) and RG flows across the transition for worm configurations of the 2D Ising model. Preliminary results regarding the logarithmic divergence of the leading PCA eigenvalue were presented at the conference. More generally, we discuss the relationship between PCA and observables in Monte Carlo simulations and the possibility of reducing the number of learning parameters in supervised learning based on RG inspired hierarchical ansatzes.

•Mar 26, 2018•8 citations

RG-inspired machine learning for lattice field theory

Sam Foreman, Joel Giedt, Yannick Meurice +1 more

Machine learning has been a fast growing field of research in several areas dealing with large datasets. We report recent attempts to use renormalization group (RG) ideas in the context of machine learning. We examine coarse graining procedures for perceptron models designed to identify the digits of the MNIST data. We discuss the correspondence between principal components analysis (PCA) and RG flows across the transition for worm configurations of the 2D Ising model. Preliminary results regarding the logarithmic divergence of the leading PCA eigenvalue were presented at the conference. More generally, we discuss the relationship between PCA and observables in Monte Carlo simulations and the possibility of reducing the number of learning parameters in supervised learning based on RG inspired hierarchical ansatzes.

arXiv:1710.02079•EPJ Web of Conferences•Jan 1, 2018•9 citations

Examples of renormalization group transformations for image sets

Sam Foreman, Joel Giedt, Yannick Meurice +1 more

Using the example of configurations generated with the worm algorithm for the two-dimensional Ising model, we propose renormalization group (RG) transformations, inspired by the tensor RG, that can be applied to sets of images. We relate criticality to the logarithmic divergence of the largest principal component. We discuss the changes in link occupation under the RG transformation, suggest ways to obtain data collapse, and compare with the two-state tensor RG approximation near the fixed point.

arXiv:1807.10250•Physical review. E•Nov 26, 2018•9 citations

Non-parametric learning critical behavior in Ising partition functions: PCA entropy and intrinsic dimension

Rajat Kumar Panda, Roberto Verdel, Álex Rodríguez +3 more

We provide and critically analyze a framework to learn critical behavior in classical partition functions through the application of non-parametric methods to data sets of thermal configurations. We illustrate our approach in phase transitions in 2D and 3D Ising models. First, we extend previous studies on the intrinsic dimension of 2D partition function data sets, by exploring the effect of volume in 3D Ising data. We find that as opposed to 2D systems for which this quantity has been successfully used in unsupervised characterizations of critical phenomena, in the 3D case its estimation is far more challenging. To circumvent this limitation, we then use the principal component analysis (PCA) entropy, a “Shannon entropy” of the normalized spectrum of the covariance matrix. We find a striking qualitative similarity to the thermodynamic entropy, which the PCA entropy approaches asymptotically. The latter allows us to extract-through a conventional finite-size scaling analysis with modest lattice sizes-the critical temperature with less than 1% error for both 2D and 3D models while being computationally efficient. The PCA entropy can readily be applied to characterize correlations and critical phenomena in a huge variety of many-body problems and suggests a (direct) link between easy-to-compute quantities and entropies.

arXiv:2308.13636•SciPost Physics Core•Dec 14, 2023•10 citations

Can machine learning truly decode phase transitions? A deep dive into the Ising model with competing interactions

Maninder Kaur, Ying Wai Li, Dilina Perera +1 more

We investigate phase transitions in the two-dimensional Ising model with competing nearest-neighbor (NN) and next-nearest-neighbor (NNN) interactions, where the NNN coupling generates a degenerate superantiferromagnetic (SAF) ground state, by combining machine-learning methods with Monte Carlo simulations and finite-size scaling (FSS). Going beyond earlier studies, we show that unsupervised learning can recover order-parameter and Binder cumulant analogs that obey FSS. Principal component analysis (PCA) reveals the two-component structure of the SAF order parameter, and k-means clustering is used to visualize qualitative differences between ordered and disordered configurations in the principal-component space. A fully connected neural network (FCNN), trained without prior knowledge of the order parameter or the critical temperature, learns the strength of SAF stripe ordering and uses it as the internal feature for phase classification. FSS of thermodynamic observables, the PCA-derived quantity, and the FCNN output yields consistent estimates of the critical temperature and correlation-length exponent. These results demonstrate that machine learning can decode ordering patterns, extract meaningful order-parameter analogs, and reproduce critical behavior in frustrated Ising systems.

Physical review. E•May 19, 2026•0 citations

Discovering phases, phase transitions, and crossovers through unsupervised machine learning: A critical examination

Wenjian Hu, Rajiv R. P. Singh, Richard T. Scalettar

We apply unsupervised machine learning techniques, mainly principal component analysis (PCA), to compare and contrast the phase behavior and phase transitions in several classical spin models-the square- and triangular-lattice Ising models, the Blume-Capel model, a highly degenerate biquadratic-exchange spin-1 Ising (BSI) model, and the two-dimensional XY model-and we examine critically what machine learning is teaching us. We find that quantified principal components from PCA not only allow the exploration of different phases and symmetry-breaking, but they can distinguish phase-transition types and locate critical points. We show that the corresponding weight vectors have a clear physical interpretation, which is particularly interesting in the frustrated models such as the triangular antiferromagnet, where they can point to incipient orders. Unlike the other well-studied models, the properties of the BSI model are less well known. Using both PCA and conventional Monte Carlo analysis, we demonstrate that the BSI model shows an absence of phase transition and macroscopic ground-state degeneracy. The failure to capture the "charge" correlations (vorticity) in the BSI model (XY model) from raw spin configurations points to some of the limitations of PCA. Finally, we employ a nonlinear unsupervised machine learning procedure, the "autoencoder method," and we demonstrate that it too can be trained to capture phase transitions and critical points.

arXiv:1704.00080•Physical review. E•Jun 19, 2017•333 citations
We illustrate how principal component analysis of simulation data represented as images generated from the worm algorithm, a method to sample the strong coupling contributions, can be used to identify the critical temperature TcT_cTc​ in the Ising model. It is shown that the eigenvalue corresponding to the first principal component of the covariance matrix obtained from pixel ensembles scales logarithmically as one approaches TcT_cTc​, in a way that is similar to the specific heat. We then illustrate how to block the resulting worm configurations under renormalization group transformations. It is found that curves for the variance of the average number of bonds can be scaled appropriately to illustrate universal behavior under the renormalization group transformation, and that discrepancies can be understood as an effect of approximations.
Machine learning has been a fast growing field of research in several areas dealing with large datasets. We report recent attempts to use renormalization group (RG) ideas in the context of machine learning. We examine coarse graining procedures for perceptron models designed to identify the digits of the MNIST data. We discuss the correspondence between principal components analysis (PCA) and RG flows across the transition for worm configurations of the 2D Ising model. Preliminary results regarding the logarithmic divergence of the leading PCA eigenvalue were presented at the conference. More generally, we discuss the relationship between PCA and observables in Monte Carlo simulations and the possibility of reducing the number of learning parameters in supervised learning based on RG inspired hierarchical ansatzes.
Machine learning has been a fast growing field of research in several areas dealing with large datasets. We report recent attempts to use renormalization group (RG) ideas in the context of machine learning. We examine coarse graining procedures for perceptron models designed to identify the digits of the MNIST data. We discuss the correspondence between principal components analysis (PCA) and RG flows across the transition for worm configurations of the 2D Ising model. Preliminary results regarding the logarithmic divergence of the leading PCA eigenvalue were presented at the conference. More generally, we discuss the relationship between PCA and observables in Monte Carlo simulations and the possibility of reducing the number of learning parameters in supervised learning based on RG inspired hierarchical ansatzes.
Using the example of configurations generated with the worm algorithm for the two-dimensional Ising model, we propose renormalization group (RG) transformations, inspired by the tensor RG, that can be applied to sets of images. We relate criticality to the logarithmic divergence of the largest principal component. We discuss the changes in link occupation under the RG transformation, suggest ways to obtain data collapse, and compare with the two-state tensor RG approximation near the fixed point.
We provide and critically analyze a framework to learn critical behavior in classical partition functions through the application of non-parametric methods to data sets of thermal configurations. We illustrate our approach in phase transitions in 2D and 3D Ising models. First, we extend previous studies on the intrinsic dimension of 2D partition function data sets, by exploring the effect of volume in 3D Ising data. We find that as opposed to 2D systems for which this quantity has been successfully used in unsupervised characterizations of critical phenomena, in the 3D case its estimation is far more challenging. To circumvent this limitation, we then use the principal component analysis (PCA) entropy, a “Shannon entropy” of the normalized spectrum of the covariance matrix. We find a striking qualitative similarity to the thermodynamic entropy, which the PCA entropy approaches asymptotically. The latter allows us to extract-through a conventional finite-size scaling analysis with modest lattice sizes-the critical temperature with less than 1% error for both 2D and 3D models while being computationally efficient. The PCA entropy can readily be applied to characterize correlations and critical phenomena in a huge variety of many-body problems and suggests a (direct) link between easy-to-compute quantities and entropies.
We investigate phase transitions in the two-dimensional Ising model with competing nearest-neighbor (NN) and next-nearest-neighbor (NNN) interactions, where the NNN coupling generates a degenerate superantiferromagnetic (SAF) ground state, by combining machine-learning methods with Monte Carlo simulations and finite-size scaling (FSS). Going beyond earlier studies, we show that unsupervised learning can recover order-parameter and Binder cumulant analogs that obey FSS. Principal component analysis (PCA) reveals the two-component structure of the SAF order parameter, and k-means clustering is used to visualize qualitative differences between ordered and disordered configurations in the principal-component space. A fully connected neural network (FCNN), trained without prior knowledge of the order parameter or the critical temperature, learns the strength of SAF stripe ordering and uses it as the internal feature for phase classification. FSS of thermodynamic observables, the PCA-derived quantity, and the FCNN output yields consistent estimates of the critical temperature and correlation-length exponent. These results demonstrate that machine learning can decode ordering patterns, extract meaningful order-parameter analogs, and reproduce critical behavior in frustrated Ising systems.
We apply unsupervised machine learning techniques, mainly principal component analysis (PCA), to compare and contrast the phase behavior and phase transitions in several classical spin models-the square- and triangular-lattice Ising models, the Blume-Capel model, a highly degenerate biquadratic-exchange spin-1 Ising (BSI) model, and the two-dimensional XY model-and we examine critically what machine learning is teaching us. We find that quantified principal components from PCA not only allow the exploration of different phases and symmetry-breaking, but they can distinguish phase-transition types and locate critical points. We show that the corresponding weight vectors have a clear physical interpretation, which is particularly interesting in the frustrated models such as the triangular antiferromagnet, where they can point to incipient orders. Unlike the other well-studied models, the properties of the BSI model are less well known. Using both PCA and conventional Monte Carlo analysis, we demonstrate that the BSI model shows an absence of phase transition and macroscopic ground-state degeneracy. The failure to capture the "charge" correlations (vorticity) in the BSI model (XY model) from raw spin configurations points to some of the limitations of PCA. Finally, we employ a nonlinear unsupervised machine learning procedure, the "autoencoder method," and we demonstrate that it too can be trained to capture phase transitions and critical points.