This work aims at determining whether artificial intelligence can recognize a phase transition without prior human knowledge. If this were successful, it could be applied to, for instance, analyzing data from the quantum simulation of unsolved physical models. Toward this goal, we first need to apply the machine learning algorithm to well-understood models and see whether the outputs are consistent with our prior knowledge, which serves as the benchmark for this approach. In this work, we feed the computer data generated by the classical Monte Carlo simulation for the $XY$ model in frustrated triangular and union jack lattices, which has two order parameters and exhibits two phase transitions. We show that the outputs of the principal component analysis agree very well with our understanding of different orders in different phases, and the temperature dependences of the major components detect the nature and the locations of the phase transitions. Our work offers promise for using machine learning techniques to study sophisticated statistical models, and our results can be further improved by using principal component analysis with kernel tricks and the neural network method.
This work aims at determining whether artificial intelligence can recognize a phase transition without prior human knowledge. If this were successful, it could be applied to, for instance, analyzing data from the quantum simulation of unsolved physical models. Toward this goal, we first need to apply the machine learning algorithm to well-understood models and see whether the outputs are consistent with our prior knowledge, which serves as the benchmark for this approach. In this work, we feed the computer data generated by the classical Monte Carlo simulation for the XY model in frustrated triangular and union jack lattices, which has two order parameters and exhibits two phase transitions. We show that the outputs of the principal component analysis agree very well with our understanding of different orders in different phases, and the temperature dependences of the major components detect the nature and the locations of the phase transitions. Our work offers promise for using machine learning techniques to study sophisticated statistical models, and our results can be further improved by using principal component analysis with kernel tricks and the neural network method.
This work aims at the goal whether the artificial intelligence can recognize phase transition without the prior human knowledge. If this becomes successful, it can be applied to, for instance, analyze data from quantum simulation of unsolved physical models. Toward this goal, we first need to apply the machine learning algorithm to well-understood models and see whether the outputs are consistent with our prior knowledge, which serves as the benchmark of this approach. In this work, we feed the compute with data generated by the classical Monte Carlo simulation for the XY model in frustrated triangular and union jack lattices, which has two order parameters and exhibits two phase transitions. We show that the outputs of the principle component analysis agree very well with our understanding of different orders in different phases, and the temperature dependences of the major components detect the nature and the locations of the phase transitions. Our work offers promise for using machine learning techniques to study sophisticated statistical models, and our results can be further improved by using principle component analysis with kernel tricks and the neural network method.
In this work, we apply a principal component analysis (PCA) method with a kernel trick to study the classification of phases and phase transitions in classical XY models of frustrated lattices. Compared to our previous work with the linear PCA method, the kernel PCA can capture nonlinear functions. In this case, the Z 2 chiral order of the classical spins in these lattices is indeed a nonlinear function of the input spin configurations. In addition to the principal component revealed by the linear PCA, the kernel PCA can find two more principal components using the data generated by Monte Carlo simulation for various temperatures as the input. One of them is related to the strength of the U (1) order parameter, and the other directly manifests the chiral order parameter that characterizes the Z 2 symmetry breaking. For a temperature-resolved study, the temperature dependence of the principal eigenvalue associated with the Z 2 symmetry breaking clearly shows second-order phase transition behavior.
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.
The identification and characterization of phase transitions is one of the oldest and most central problems in condensed matter physics, traditionally approached through order parameters, free-energy expansions, renormalization-group analysis, and direct numerical simulation. Over the past decade, machine learning (ML) has emerged as a complementary and, in some regimes, transformative methodology for this task. Supervised classifiers can learn to distinguish phases directly from raw configurations without an a priori order parameter; unsupervised and self-supervised techniques such as principal component analysis, autoencoders, and learning-by-confusion can locate transition points with minimal or no labeled data; and generative and variational architectures, including neural-network quantum states, now approximate ground-state wavefunctions of strongly correlated systems well beyond the reach of exact diagonalization. This paper reviews the theoretical foundations of phase transitions relevant to machine-learning applications, surveys the principal families of algorithms used to detect and classify phases, and examines their application across classical spin systems, percolation, topological and quantum phases, strongly correlated electron systems, and experimentally measured spectroscopic data. Representative case studies are discussed, including convolutional and graph-neural-network classifiers of lattice configurations, explainable-ML detection of thermodynamic transitions in photoemission spectra, and deep-learning-guided discovery of high-temperature superconductors. The review closes with a critical discussion of persistent challenges interpretability, data scarcity in correlated-electron experiments, generalization across Hamiltonians, and the reliability of learned order parameters near criticality and outlines directions for future research, including physics-informed architectures, uncertainty quantification, and closed-loop integration with autonomous experimentation.
In recent years Machine Learning has proved to be successful in many technological applications and scientific tasks, such as image and speech recognition, natural language
understanding and more. In this work we apply both supervised and unsupervised Machine Learning to three key problems in statistical physics: design of Hamiltonian from data,
phase recognition and study of critical properties of a system undergoing phase transition.
As an example of model design, we use a dataset with spin configurations and corresponding energies randomly sampled from a one dimensional Ising model. We then make two
guesses for the correct Hamiltonian: the former involving interactions of spins with an external local field, the latter involving two body interactions among spins.
The coupling constants are determined with a linear penalized regression, comparing the effects of L1 and L2 penalization terms of the cost function. We pay specific attention
to the problem of overfitting and to the validation process, which is critical for accepting or rejecting the proposed model.
The phase recognition problem is faced with the two dimensional Ising and XY models as examples. After showing the limits of a simple softmax regression for this task,
we build suitable neural networks to overcome these limits. In particular, a feed forward network is built and the learning process is investigated for the Ising model;
while a more sophisticated convolutional network is proposed for the XY model in order to detect local topological structures.
The last part of the work is dedicated to the unsupervised study of phase transitions, and the determination of critical properties (order parameter, critical
temperature, critical exponents). The discussed techniques are Principal Component Analysis (PCA) for dimensional reduction and K-means clustering for organizing data into
subsets with specific properties. PCA is applied to the two dimensional Ising, Potts and XY models, and it is used to find suitable order parameters. The study of the
proposed order parameter as a function of temperature provides evidence of phase transition, and a finite size scaling allows to extrapolate both the critical temperature
in the thermodynamic limit, and the ν critical exponent for the correlation length. K-means clustering is applied to equilibrium configurations of the two dimensional
Ising model, before and after the dimensional reduction, and the critical temperature is estimated. Moreover, a clustering of relaxation curves of magnetization in a
Monte Carlo dynamics is used to build a phase diagram on the parameter space of temperature and magnetic field.
A synergy of C++, Python and Wolfram Mathematica 12.0 is used throughout this work in order to sample input datasets and to build and control customized neural networks
and learning tools. The most relevant codes are provided in the appendix.
We assess the quality of a set of machine-learning (ML) techniques for the prediction of the phase diagrams of two frustrated 2D Ising models with competing interactions, that feature phase transitions characterized by critical manifolds rather than a single critical point. Using raw Monte Carlo spin configurations generated for random system parameters, we apply principal-component analysis (PCA) and auto-encoders to achieve dimensionality reduction, followed by clustering using the DBSCAN method and a support-vector machine classifier. The resulting estimates for the critical manifolds of both systems are in excellent agreement with available exact results, with the auto-encoders leading to quantitatively superior results. Notably, both the structure of the optimized auto-encoder as well its corresponding dimensionality-reduced and clustered space correlate with fundamental physical characteristics of the systems under consideration, which is useful when \emph{a priori} theoretical insight is unavailable.