aiqbench analysis
This research demonstrates how supervised neural networks can implement data-driven real-space renormalization, effectively learning coarse-graining rules to predict critical observables in 2D percolation systems. By training on small lattices, the model successfully extrapolates to larger scales and reconstructs spanning clusters while adhering to finite-size scaling laws near critical points. The study highlights that high-fidelity performance relies on latent representations capturing scale-dependent flows consistent with renormalization-group structures.
Neural Renormalization Group Flow for Percolation
arXiv:2608.26764v1 Announce Type: cross Abstract: Machine learning offers a possible route to data-driven real-space renormalization when the relevant observables are nonlocal and difficult to prescribe explicitly. We explore this idea for two-dimensional site percolation developping a supervised, scale-shared neural architecture. The model recursively applies the same learned coarse-graining rule across scales, producing a latent field from which the crossing probability is predicted, while a corresponding fine-graining decoder reconstructs the largest-cluster mask. Trained only on small lattices, the model extrapolates to substantially larger systems, recovers the spanning cluster with high fidelity, and produces observables obeying the expected finite-size scaling near the critical point. We observe that to get such performance it is key that the learned latent representation exhibits critical fluctuations and scale-dependent flows consistent with the renormalization-group structure of percolation.
Abstract:Machine learning offers a possible route to data-driven real-space renormalization when the relevant observables are nonlocal and difficult to prescribe explicitly. We explore this idea for two-dimensional site percolation developping a supervised, scale-shared neural architecture. The model recursively applies the same learned coarse-graining rule across scales, producing a latent field from which the crossing probability is predicted, while a corresponding fine-graining decoder reconstructs the largest-cluster mask. Trained only on small lattices, the model extrapolates to substantially larger systems, recovers the spanning cluster with high fidelity, and produces observables obeying the expected finite-size scaling near the critical point. We observe that to get such performance it is key that the learned latent representation exhibits critical fluctuations and scale-dependent flows consistent with the renormalization-group structure of percolation.
Disordered Systems and Neural Networks (cond-mat.dis-nn); Machine Learning (cs.LG)
arXiv:2608.26764 [cond-mat.dis-nn]
(or arXiv:2608.26764v1 [cond-mat.dis-nn] for this version)
https://doi.org/10.48550/arXiv.2608.26764 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 225 words
Related coverage
Rank Collapse, Fixed Points, and the Renormalization Group Structure of MLP Residual Networks
arXiv · Jun 10, 2026

Order Parameter Discovery for Quantum Many-Body Systems
Quantum Journal · Sep 29, 2026
Connecting finite-size scaling and renormalization-group flows in Anderson localization on random graphs
arXiv · Sep 30, 2026

Dharma vs Adharma - The Perplexity of Being Alive
hillpost.in · Aug 25, 2026