Sampling algorithms for validation of supervised learning models for Ising-like systems
Nataliya Portman, Isaac Tamblyn

TL;DR
This paper introduces novel sampling algorithms, ID-MH and block-ID, for validating supervised learning models on Ising model data, effectively capturing phase transitions and improving model assessment.
Contribution
The paper proposes the ID-MH and block-ID sampling methods tailored for Ising systems, enhancing validation of machine learning models by preserving phase transition features.
Findings
ID-MH retains phase transitions in datasets
PCA-based Decision Tree best predicts magnetizations
Energy prediction accuracy remains limited
Abstract
In this paper, we build and explore supervised learning models of ferromagnetic system behavior, using Monte-Carlo sampling of the spin configuration space generated by the 2D Ising model. Given the enormous size of the space of all possible Ising model realizations, the question arises as to how to choose a reasonable number of samples that will form physically meaningful and non-intersecting training and testing datasets. Here, we propose a sampling technique called ID-MH that uses the Metropolis-Hastings algorithm creating Markov process across energy levels within the predefined configuration subspace. We show that application of this method retains phase transitions in both training and testing datasets and serves the purpose of validation of a machine learning algorithm. For larger lattice dimensions, ID-MH is not feasible as it requires knowledge of the complete configuration…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
