KMS Fall Meeting, GIST

Neural-Network Wess-Zumino-Witten,
Duality and Machine Learning

Benjamin Suzzoni
2026/10/31

with
PCPietro CapuozzoBRBrandon Robinson

A neural network is a composable map

Neural network:

\(\Phi_{\Theta}:\mathbb R^D\rightarrow\mathbb R\)


Operations: composition, addition and scalar multiplication.


Its functional form is the architecture; its weights and biases are the parameters.

one hidden layer x Φ(x) basis functions φᵢ weights Θᵢ

\[ \qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\qquad\Phi_{\Theta}(x)=\sum_i \Theta_i \varphi_i(x) \]

The Universal Approximation Theorem (UAT)

one width parameter \(L\) controls both pictures
\(L=1\)   width parameter; displayed nodes are schematic
coarse approximation   schematic error
UAT: expressivity/density in a function space.
NNGP: a suitably normalized iid large-width limit can become Gaussian.

A functional integral through the UAT


Network at initialization: weights \(\Theta\) follow a distribution \(P\).


function space

\[ \int\mathcal D\phi\,\mu[\phi]\,\mathcal F[\phi] \]

integrate over field configurations

↔ pushforward
through \(\Phi_\Theta\)
parameter space

\[ \lim_{L\to\infty}\int_{\Theta_L} d\Theta\,P_L(\Theta)\, \mathcal F[\Phi_\Theta] \]

ordinary integrals over network parameters


Key Idea: replace the functional integral with a statistical average.

But: conformal correlators can already emerge at finite architecture—the UAT limit is not required to define an nn-CFT.

What has NNFT achieved?

Foundation of modern NNFT

[Halverson, et al; 2021]

Fermions and supersymmetry

[Frank, et al; 2025]

Virasoro symmetry using NNs

[Robinson; 2025]

String-theory amplitudes

[Frank, Halverson; 2026]

Topological effects: BKT and T-duality

[Ferko, et al; 2026]

T-duality identified in the bosonic-string setting

momentum↔winding

What about other dualities?

WZW and level-rank duality [Ostrik, Sun; 2014]

A 2d sigma model

\[g:\Sigma\longrightarrow SU(N)\]

worldsheet   to   group manifold

Affine current algebra

\[J^a(z)J^b(w)\sim\frac{K\delta^{ab}}{2(z-w)^2}+\frac{if^{ab}{}_{c}J^c(w)}{z-w}\]

Direct / coset

\[SU(N)_K\simeq\frac{SU(NK)_1}{SU(K)_N}\]

a common chiral current sector

Level-rank for neural networks [Wakimoto; 1986]

The Wakimoto representation builds WZW currents from free fields.

neural free fields

\(\phi\)   and   \((\beta,\gamma)\)

one scalar, one commuting pair

Wakimoto readout

Polynomials and derivatives

with normal ordering

WZW observables

\(J^1,\ J^2,\ J^3\)

and the stress tensor \(T\)

One current, for example:

\[J^3=i\sqrt{\frac{K+2}{2}}\,\partial\phi+:\!\beta\gamma\!:\]

The prescribed readouts reproduce the affine algebra in the ordered continuum limit.

One current sector, two neural presentations

The same limiting \(SU(2)_3\) sector, at the same feature width \(L\).

Direct W
\(SU(2)_3\)
Coset C
\(SU(6)_1/SU(3)_2\)
Scalar fields15
Commuting \(\beta\gamma\) pairs115
Gaussian output amplitudes\(3L\)\(35L\)
Real sampled parameters\(6L\)\(38L\)
Observables retainedThree currents and the stress tensor

Baseline shared frequencies and scalar phases. Count each complex frequency as two real parameters; fixed hyperparameters are excluded.

The continuum relation leaves different finite architectures and readouts.

Real life neural networks are not infinite...
what happens there?

Finite-width accuracy depends on the presentation

Compare stress-tensor correlations with the common CFT reference.

\(L\): feature width.   \(\alpha\): spectral tilt at fixed elementary covariance.

UV damping (R¹)

Direct W
Interactive TT error heatmap. Full-precision numerical data are bundled in data/tt-heatmaps.js.
Coset C
Interactive TT error heatmap. Full-precision numerical data are bundled in data/tt-heatmaps.js.

IR and UV damping (R³)

Direct W
Interactive TT error heatmap. Full-precision numerical data are bundled in data/tt-heatmaps.js.
Coset C
Interactive TT error heatmap. Full-precision numerical data are bundled in data/tt-heatmaps.js.
\(\log_{10}E_X^{TT}\)
−115.231.447.663.880
white: resolved minimum
hatched: within 5%

Hover to inspect \(L\), \(\alpha\) and \(E^{TT}\). Same 64 pairs, \(p_-=.01\), \(p_+=1000\). Sampling uncertainty is separate.

Computational cost depends on the task

Coset / direct median CPU time, at \(L=256\), \(\alpha=0\), \(R^3\).

Ensemble-correlation workloadTime ratio (log scale)
Production + calibration
10.25×
1000 amplitude-dependent calls
72.03×
1000 fixed-amplitude calls
1.27×
131030100

Fixed coefficients allow more reuse. New insertion points require integration again.

A continuum identification does not select the most economical finite network.

These workloads evaluate ensemble correlations. Neither complete task reached the prescribed 1% full-vector accuracy target.

Thank you

Benjamin Suzzoni

with Pietro Capuozzo and Brandon Robinson