We propose that simple neural networks (NNs) trained on crossing symmetry can reconstruct conformal correlators restricted to a line to remarkable accuracy. The input is minimal: an external scaling dimension, a spectral gap, and the value of the correlator at a single point. We present evidence across a wide range of conformal theories and dimensions, for both four-point and thermal two-point functions. We attribute these observations to the spectral bias of gradient-based NN training, which appears to align with an intrinsic smoothness property of conformal field theory. This suggests a novel variational principle for conformal correlators and opens a path towards a powerful new computational framework for non-perturbative quantum field theory.We propose that simple neural networks (NNs) trained on crossing symmetry can reconstruct conformal correlators restricted to a line to remarkable accuracy. The input is minimal: an external scaling dimension, a spectral gap, and the value of the correlator at a single point. We present evidence across a wide range of conformal theories and dimensions, for both four-point and thermal two-point functions. We attribute these observations to the spectral bias of gradient-based NN training, which appears to align with an intrinsic smoothness property of conformal field theory. This suggests a novel variational principle for conformal correlators and opens a path towards a powerful new computational framework for non-perturbative quantum field theory.

arXiv:2604.18673Apr 20, 20260 citations

Neural Spectral Bias and Conformal Correlators I: Introduction and Applications

Kausik Ghosh, Sidhaarth Kumar, Vasilis Niarchos B +1 more

We demonstrate that simple feed-forward neural networks (NNs) can accurately compute correlation functions of conformal field theories (CFTs) on a line. Strikingly, by optimising a NN solely on crossing symmetry and providing only the scaling dimension of the leading non-trivial operator and the correlator's value at a single "anchor point", we can reconstruct target physical correlators to within a few percent. We establish the robustness of this minimal-data approach across a broad class of theories and dimensions, including generalised free fields, contact and one-loop Witten diagrams in AdS $_2$ , unitary and non-unitary 2d minimal models, the 3d Ising model, and half-BPS correlators in 4d $\mathcal{N}=4$ super-Yang-Mills theory, together with several thermal two-point functions, notably including those of the 3d Ising model. We argue that this remarkable alignment between NNs and CFTs stems from the spectral bias of gradient-based training, which heavily favours smooth functions. To ground this connection, we analyse the smoothness of conformal correlators using fractional Sobolev semi-norms, Chebyshev spectral decompositions, and a measure based on curvature. Finally, we establish the broader reconstructive power of this technique by extending it beyond the diagonal kinematics of the line.We demonstrate that simple feed-forward neural networks (NNs) can accurately compute correlation functions of conformal field theories (CFTs) on a line. Strikingly, by optimising a NN solely on crossing symmetry and providing only the scaling dimension of the leading non-trivial operator and the correlator's value at a single "anchor point", we can reconstruct target physical correlators to within a few percent. We establish the robustness of this minimal-data approach across a broad class of theories and dimensions, including generalised free fields, contact and one-loop Witten diagrams in AdS$_2$, unitary and non-unitary 2d minimal models, the 3d Ising model, and half-BPS correlators in 4d $\mathcal{N}=4$ super-Yang-Mills theory, together with several thermal two-point functions, notably including those of the 3d Ising model. We argue that this remarkable alignment between NNs and CFTs stems from the spectral bias of gradient-based training, which heavily favours smooth functions. To ground this connection, we analyse the smoothness of conformal correlators using fractional Sobolev semi-norms, Chebyshev spectral decompositions, and a measure based on curvature. Finally, we establish the broader reconstructive power of this technique by extending it beyond the diagonal kinematics of the line.

arXiv:2604.18686Apr 20, 20260 citations

Neural Spectral Bias and Conformal Correlators II: Modular and Annulus Bootstrap

Kausik Ghosh, Sidhaarth Kumar, Vasilis Niarchos B +1 more

We develop a neural network bootstrap framework for reconstructing partition functions of two-dimensional conformal field theories (CFTs) based on modular invariance and the Cardy condition, which are recast as crossing equations for four-point correlators. For torus partition functions, we use the twist-field representation in the symmetric-orbifold description to map modular S-invariance to four-point crossing and focus on the diagonal kinematics of four insertions on a line. For annulus partition functions, we formulate open/closed channel duality as crossing symmetry for mixed four-point functions of defect-changing operators in interface CFT. In both cases, the reconstruction problem is formulated in the anchored-bootstrap form, where the crossing constraints are supplemented by minimal spectral input (a gap) and anchor data. We solve this under-determined problem by using lightweight feed-forward neural networks to parametrise the correlators and their corresponding partition functions. A key ingredient of this approach is the spectral bias of the neural networks in the lazy training regime, which selects specific crossing-symmetric configurations. This reformulation unifies standard modular and annulus constraints in two dimensions with the anchored neural approach for CFT correlators, providing a new way to reconstruct full partition functions from sparse data with remarkable accuracy.We develop a neural network bootstrap framework for reconstructing partition functions of two-dimensional conformal field theories (CFTs) based on modular invariance and the Cardy condition, which are recast as crossing equations for four-point correlators. For torus partition functions, we use the twist-field representation in the symmetric-orbifold description to map modular S-invariance to four-point crossing and focus on the diagonal kinematics of four insertions on a line. For annulus partition functions, we formulate open/closed channel duality as crossing symmetry for mixed four-point functions of defect-changing operators in interface CFT. In both cases, the reconstruction problem is formulated in the anchored-bootstrap form, where the crossing constraints are supplemented by minimal spectral input (a gap) and anchor data. We solve this under-determined problem by using lightweight feed-forward neural networks to parametrise the correlators and their corresponding partition functions. A key ingredient of this approach is the spectral bias of the neural networks in the lazy training regime, which selects specific crossing-symmetric configurations. This reformulation unifies standard modular and annulus constraints in two dimensions with the anchored neural approach for CFT correlators, providing a new way to reconstruct full partition functions from sparse data with remarkable accuracy.

arXiv:2607.24913Jul 27, 20260 citations

Machine learning etudes in conformal field theories

Heng‐Yu Chen, Yang‐Hui He, Shailesh Lal +1 more

We demonstrate that various aspects of Conformal Field Theory are amenable to machine learning. Relatively modest feed-forward neural networks are able to distinguish between scale and conformal invariance of a three-point function and identify a crossing-symmetric four-point function to nearly 100% accuracy. Furthermore, neural networks are also able to identify conformal blocks appearing in a putative CFT four-point function and predict the values of the corresponding operator product expansions (OPE) coefficients. Neural networks also successfully classify primary operators by their quantum numbers under discrete symmetries in the CFT from examining OPE data. We also demonstrate that neural networks are able to learn the available OPE data for scalar correlation function in the 3D Ising model and predict the twists of higher-spin operators that appear in scalar OPE channels by regression.We demonstrate that various aspects of Conformal Field Theory are amenable to machine learning. Relatively modest feed-forward neural networks are able to distinguish between scale and conformal invariance of a three-point function and identify a crossing-symmetric four-point function to nearly 100% accuracy. Furthermore, neural networks are also able to identify conformal blocks appearing in a putative CFT four-point function and predict the values of the corresponding operator product expansions (OPE) coefficients. Neural networks also successfully classify primary operators by their quantum numbers under discrete symmetries in the CFT from examining OPE data. We also demonstrate that neural networks are able to learn the available OPE data for scalar correlation function in the 3D Ising model and predict the twists of higher-spin operators that appear in scalar OPE channels by regression.

arXiv:2006.16114International Journal of Data Science in the Mathematical SciencesNov 28, 202212 citations

Notes on algebraic perspective on neural network conformal theories

Samuel Leutheusser, Joydeep Naskar

Neural network conformal theories were first introduced in \cite{Halverson:2024axc} and exact two-, three- and four-point correlators were computed from an ensemble of infinite-width neural networks. In particular, the four-point correlator of any scalar operator satisfied crossing-symmetry and conformal block decomposition across different channels were in agreement without any constraint on moments. An infinite tower of degenerate operators with the same scaling dimension were found. In this note, we take a closer look at the structure of correlators and relation between operators. We also layout a recipe to construct the algebra of the theory.Neural network conformal theories were first introduced in \cite{Halverson:2024axc} and exact two-, three- and four-point correlators were computed from an ensemble of infinite-width neural networks. In particular, the four-point correlator of any scalar operator satisfied crossing-symmetry and conformal block decomposition across different channels were in agreement without any constraint on moments. An infinite tower of degenerate operators with the same scaling dimension were found. In this note, we take a closer look at the structure of correlators and relation between operators. We also layout a recipe to construct the algebra of the theory.

arXiv:2609.37074Sep 29, 20260 citations

Conformal fields from neural networks

James Halverson, Joydeep Naskar, Jiahua Tian

A bstract We use the embedding formalism to construct conformal fields in D dimensions, by restricting Lorentz-invariant ensembles of homogeneous neural networks in ( D + 2) dimensions to the projective null cone. Conformal correlators may be computed using the parameter space description of the neural network. Exact four-point correlators are computed in a number of examples, and we perform a 4D conformal block decomposition that elucidates the spectrum. In a non-unitary example the decomposition precisely matches OPE coefficients for the self-correlator, but not for the mixed correlator. In others, the analysis is facilitated by recent approaches to Feynman integrals. Generalized free CFTs are constructed using the infinite-width Gaussian process limit of the neural network, enabling a realization of the free boson. The extension to deep networks constructs conformal fields at each subsequent layer, with recursion relations relating their conformal dimensions and four-point functions. Numerical approaches are discussed.A bstract We use the embedding formalism to construct conformal fields in D dimensions, by restricting Lorentz-invariant ensembles of homogeneous neural networks in ( D + 2) dimensions to the projective null cone. Conformal correlators may be computed using the parameter space description of the neural network. Exact four-point correlators are computed in a number of examples, and we perform a 4D conformal block decomposition that elucidates the spectrum. In a non-unitary example the decomposition precisely matches OPE coefficients for the self-correlator, but not for the mixed correlator. In others, the analysis is facilitated by recent approaches to Feynman integrals. Generalized free CFTs are constructed using the infinite-width Gaussian process limit of the neural network, enabling a realization of the free boson. The extension to deep networks constructs conformal fields at each subsequent layer, with recursion relations relating their conformal dimensions and four-point functions. Numerical approaches are discussed.

arXiv:2409.12222Journal of High Energy PhysicsOct 3, 202510 citations

_2

, unitary and non-unitary 2d minimal models, the 3d Ising model, and half-BPS correlators in 4d

\mathcal{N}=4

super-Yang-Mills theory, together with several thermal two-point functions, notably including those of the 3d Ising model. We argue that this remarkable alignment between NNs and CFTs stems from the spectral bias of gradient-based training, which heavily favours smooth functions. To ground this connection, we analyse the smoothness of conformal correlators using fractional Sobolev semi-norms, Chebyshev spectral decompositions, and a measure based on curvature. Finally, we establish the broader reconstructive power of this technique by extending it beyond the diagonal kinematics of the line.