Abstract The detection of phase transitions is a central task in many-body physics. To automate this process, the task can be phrased as a classification problem. Classification problems can be approached in two fundamentally distinct ways: through either a discriminative or a generative method. In general, it is unclear which of these two approaches is most suitable for a given problem. In this work, we answer the question of how one should approach the detection of the thermal transition within the classical two-dimensional square-lattice ferromagnetic Ising model by performing a systematic numerical case study. We find that in a data-driven setting with limited system knowledge, neural network-based approaches outperform nonparametric generative methods in terms of the achieved accuracy for a given dataset size. Both parametric generative and discriminative approaches may be viable depending on how the classification task is set up. Conversely, in a knowledge-driven setting where the system Hamiltonian is known, nonparametric generative approaches leveraging sufficient statistics are superior in terms of the accuracy reached at a given budget of computation time for all but the smallest sample sizes or highest error tolerances. Our findings provide a guide for the selection of machine-learning strategies for phase transition detection based on criteria such as the amount of available system knowledge, the number of data points, or computational constraints.
Abstract The detection of phase transitions is a central task in many-body physics. To automate this process, the task can be phrased as a classification problem. Classification problems can be approached in two fundamentally distinct ways: through either a discriminative or a generative method. In general, it is unclear which of these two approaches is most suitable for a given problem. In this work, we answer the question of how one should approach the detection of the thermal transition within the classical two-dimensional square-lattice ferromagnetic Ising model by performing a systematic numerical case study. We find that in a data-driven setting with limited system knowledge, neural network-based approaches outperform nonparametric generative methods in terms of the achieved accuracy for a given dataset size. Both parametric generative and discriminative approaches may be viable depending on how the classification task is set up. Conversely, in a knowledge-driven setting where the system Hamiltonian is known, nonparametric generative approaches leveraging sufficient statistics are superior in terms of the accuracy reached at a given budget of computation time for all but the smallest sample sizes or highest error tolerances. Our findings provide a guide for the selection of machine-learning strategies for phase transition detection based on criteria such as the amount of available system knowledge, the number of data points, or computational constraints.
Detection of phase transitions is a critical task in statistical physics, traditionally pursued through analytic methods and direct numerical simulations. Recently, machine-learning techniques have emerged as promising tools in this context, with a particular focus on supervised and unsupervised learning methods, along with nonlearning approaches. In this paper, we study the performance of unsupervised learning in detecting phase transitions in the J_{1}-J_{2} Ising model on the square lattice. The model is chosen due to its simplicity and complexity, thus providing an understanding of the application of machine-learning techniques in both straightforward and challenging scenarios. We propose a simple method based on a direct comparison of configurations. The reconstruction error, defined as the mean-squared distance between two configurations, is used to determine the critical temperatures. The results from the comparison of configurations are contrasted with those of the configurations generated by variational autoencoders. Our findings highlight that for certain systems a simpler method can yield results comparable to more complex neural networks. This paper contributes to the broader understanding of machine-learning applications in statistical physics and introduces an efficient approach to the detection of phase transitions using machine determination techniques.
Identifying phase transitions in complex many-body systems traditionally necessitates the definition of specific order parameters, a task often requiring prior knowledge of the statistical model and the symmetry-breaking mechanism. In this work, we propose a framework for detecting phase transitions directly from raw (experimental) data without requiring knowledge of the underlying model Hamiltonian, parameters, or pre-defined labels. Inspired by generative modeling in machine learning, our method utilizes autoregressive networks to estimate the normalized probability distribution of the system from raw configuration data. We then quantify the intrinsic sensitivity of this learned distribution to control parameters (such as temperature) to construct a robust indicator of phase transitions. This indicator is based on the expectation of the change in absolute logarithmic probability, derived entirely from the raw data. Our approach is purely data-driven: it takes raw data across varying control parameters as input and outputs the most likely estimate of the phase transition point. To validate our approach, we conduct extensive numerical experiments on the 2D Ising model on both triangular and square lattices, and on the Sherrington-Kirkpatrick (SK) model utilizing raw data generated via Markov Chain Monte Carlo and Tensor Network methods. The results demonstrate that our generative approach accurately identifies phase transitions using only raw data. Our framework provides a general tool for exploring critical phenomena in model systems, with the potential to be extended to realistic experimental data where theoretical descriptions remain incomplete.
Identifying phase transitions and classifying phases of matter is central to understanding the properties and behavior of a broad range of material systems. In recent years, machine-learning (ML) techniques have been successfully applied to perform such tasks in a data-driven manner. However, the success of this approach notwithstanding, we still lack a clear understanding of ML methods for detecting phase transitions, particularly of those that utilize neural networks (NNs). In this work, we derive analytical expressions for the optimal output of three widely used NN-based methods for detecting phase transitions. These optimal predictions correspond to the results obtained in the limit of high model capacity. Therefore, in practice they can, for example, be recovered using sufficiently large, well-trained NNs. The inner workings of the considered methods are revealed through the explicit dependence of the optimal output on the input data. By evaluating the analytical expressions, we can identify phase transitions directly from experimentally accessible data without training NNs, which makes this procedure favorable in terms of computation time. Our theoretical results are supported by extensive numerical simulations covering, e.g., topological, quantum, and many-body localization phase transitions. We expect similar analyses to provide a deeper understanding of other classification tasks in condensed matter physics.
One of the central tasks in many-body physics is the determination of phase diagrams. However, mapping out a phase diagram generally requires a great deal of human intuition and understanding. To automate this process, one can frame it as a classification task. Typically, classification problems are tackled using discriminative classifiers that explicitly model the probability of the labels for a given sample. Here we show that phase-classification problems are naturally suitable to be solved using generative classifiers based on probabilistic models of the measurement statistics underlying the physical system. Such a generative approach benefits from modeling concepts native to the realm of statistical and quantum physics, as well as recent advances in machine learning. This leads to a powerful framework for the autonomous determination of phase diagrams with little to no human supervision that we showcase in applications to classical equilibrium systems and quantum ground states.
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.
Machine learning is capable of discriminating phases of matter, and finding associated phase transitions, directly from large data sets of raw state configurations. In the context of condensed matter physics, most progress in the field of supervised learning has come from employing neural networks as classifiers. Although very powerful, such algorithms suffer from a lack of interpretability, which is usually desired in scientific applications in order to associate learned features with physical phenomena. In this paper, we explore support vector machines (SVMs), which are a class of supervised kernel methods that provide interpretable decision functions. We find that SVMs can learn the mathematical form of physical discriminators, such as order parameters and Hamiltonian constraints, for a set of two-dimensional spin models: the ferromagnetic Ising model, a conserved-order-parameter Ising model, and the Ising gauge theory. The ability of SVMs to provide interpretable classification highlights their potential for automating feature detection in both synthetic and experimental data sets for condensed matter and other many-body systems.