arXiv Machine Learning By Ro Jefferson, Shradha Ramakrishnan

Deep neural networks as lattice gauge theories

Read the original on arXiv Machine Learning →

arXiv:2608. 19331v1 Announce Type: cross Abstract: We modify the NN/QFT duality [1] to incorporate the layerwise permutation symmetry of the network, resulting in a $(0\!

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Hugging Face Trending Papers
Aug 27

Neural Renormalization Group Flow for Percolation

The paper introduces a supervised, scale‑shared neural architecture for two‑dimensional site percolation, implementing a neural renormalization group flow. The model recursively applies a learned coarse‑graining rule across scales, producing a latent field that predicts crossing probability and a fine‑graining decoder that reconstructs the largest‑cluster mask. Trained only on small lattices, it extrapolates to larger systems, accurately recovers the spanning cluster, and yields observables that follow expected finite‑size scaling near the critical point, highlighting the importance of critical fluctuations in the latent representation.

arXiv Machine Learning
Aug 28

Neural Renormalization Group Flow for Percolation

The paper presents a supervised, scale‑shared neural architecture that learns a coarse‑graining rule for two‑dimensional site percolation. By recursively applying this rule, the model generates a latent field from which the crossing probability is predicted and a fine‑graining decoder reconstructs the largest‑cluster mask. Trained only on small lattices, the network extrapolates to larger systems, accurately recovers the spanning cluster, and reproduces finite‑size scaling near the critical point, demonstrating that the latent representation captures critical fluctuations and scale‑dependent flows consistent with renormalization‑group theory.

By Anaclara Alvez, Luca Camagna, Sergio Chibbaro, Cyril Furtlehner, Fran\c{c}ois Landes, Gianluca Manzan, Lorenzo Mensi
arXiv Machine Learning
Aug 31

What Neural Network Field Theory Can and Cannot Realise on a Computer

The paper investigates the limits of implementing neural network field theory on a computer, focusing on function classes that are regular enough for computation. It presents a no‑go theorem showing that finite‑width network ensembles cannot consistently realize either a quantum or effective field theory due to violations of reflection positivity and lack of scale separation. The study distinguishes between finite‑width and infinite‑width interpretations, concluding that only smeared correlators of the infinite‑width limit are computable with controlled error, and identifies two possible ways to evade the theorem—by relaxing finite variance or exact rotation invariance.

By Thomas R. Harvey