Discriminative and generative machine learning for spin systems based on physically interpretable features
Bibliographic record
Abstract
Recently, much effort has been devoted to studying whether machine learning methods are capable of recognizing phase boundaries in spin systems. This is typically done using deep neural networks, trained on system configurations at fixed control parameter values, but without receiving any a priori knowledge of physical features. Opening the ‘black-box algorithms’ and uncovering which features are captured by the neural network is a crucial and oft-overlooked step. Without this additional step, one cannot guarantee that the algorithm's decision on the phase boundaries is based on physically relevant features, or on less relevant characteristics—which would limit its applicability. We use the example of exploring the two-dimensional phase diagram of a non-equilibrium spin system (active Ising model) to highlight the importance of scrutinizing the internal representation of a neural network. By only training networks on a small slice of the phase diagram, we show that some networks capture the relevant physics to complete the remainder of the phase diagram. Other networks fail in doing so—even though they are perfectly capable of reaching their training objective. We demonstrate that by highlighting on which input regions networks base their decision, we can select the relevant networks and show that they can capture physical features such as emergent magnetization patterns [Casert, C., Vieijra, T., Nys, J., & Ryckebusch, J. (2019). Physical Review E, 99(2), 023304]. An additional test of whether deep neural networks can recognize physical characteristics is in its potential to generate additional system configurations. We show that a generative adversarial network (GAN) can create spin configurations that are indistinguishable from the training data [Mills, K., & Tamblyn, I. (2017). arXiv preprint arXiv:1710.08053]. By conditioning the GAN on physical quantities, we show it can accurately learn how to use this information in its generation procedure, and create configurations at a requested value of an observable, e.g. at a fixed energy. Furthermore, we show how we can use GANs to create configurations at system sizes much larger than the training data, allowing for highly efficient sampling of arbitrarily large configurations.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".