2 papers
cond-mat.dis-nn2026
Universal Spin Models are Universal Approximators in Machine Learning
Tobias Reinhart, Gemma De les Coves
One of the theoretical pillars that sustain certain machine learning models are universal approximation theorems, which prove that they can approximate all functions from a functio…
cond-mat.stat-mech2025
The grammar of the Ising model: A new complexity hierarchy
Tobias Reinhart, Gemma De les Coves
How complex is an Ising model? Usually, this is measured by the computational complexity of its ground state energy problem. Yet, this complexity measure only distinguishes between…