analiza aiqbench
This theoretical study reframes gradient descent in deep ReLU networks as collective dynamics on training-set fields, revealing that information transport across layers requires a hierarchy of weight-induced Gram operators starting at depth three. The work establishes a backward pullback recursion governing conjugate-field dynamics, offering a rigorous mathematical closure for residual dynamics beyond shallow architectures. For researchers in neural network theory, this provides a structural framework for understanding how depth fundamentally alters the geometric and dynamical properties of learning.
Learning Dynamics Reveal a Hierarchy of Weight-Induced Layerwise Gram Metrics
arXiv:2606.09744v2 Announce Type: replace Abstract: We study feed-forward ReLU networks with fixed readout and quadratic loss. The aim is to rewrite gradient descent not primarily as a dynamics in weight space, but as a collective dynamics closed in terms of fields defined on the training-set space. For a single hidden layer, the weight variables can be eliminated from the activation dynamics, yielding a closed equation for the residuals governed by a collective kernel that factorizes into an input-geometric matrix and a dynamical co-activation matrix. For deeper networks, the residual dynamics retains a clean layer-wise kernel structure. However, from depth three onward, closure requires a hierarchy of weight-induced Gram operators that mediate information transport across layers. Moreover, the conjugate-field dynamics is governed by operators satisfying a backward pullback recursion, of which the weight-induced Gram operators are the first nontrivial instances.
Abstract:We study feed-forward ReLU networks with fixed readout and quadratic loss. The aim is to rewrite gradient descent not primarily as a dynamics in weight space, but as a collective dynamics closed in terms of fields defined on the training-set space. For a single hidden layer, the weight variables can be eliminated from the activation dynamics, yielding a closed equation for the residuals governed by a collective kernel that factorizes into an input-geometric matrix and a dynamical co-activation matrix. For deeper networks, the residual dynamics retains a clean layer-wise kernel structure. However, from depth three onward, closure requires a hierarchy of weight-induced Gram operators that mediate information transport across layers. Moreover, the conjugate-field dynamics is governed by operators satisfying a backward pullback recursion, of which the weight-induced Gram operators are the first nontrivial instances.
26 pages. v3: Added Proposition 4 on recursive transport closure of the conjugate-field dynamics. Minor clarifications
Machine Learning (cs.LG); Disordered Systems and Neural Networks (cond-mat.dis-nn)
arXiv:2606.09744 [cs.LG]
(or arXiv:2606.09744v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2606.09744 Focus to learn more arXiv-issued DOI via DataCite
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.
Text integral sub licența deschisă a publicației · 248 cuvinte
Subiecte conexe
Learning Dynamics Reveal a Hierarchy of Weight-Induced Layerwise Gram Metrics
arXiv · 9 iun. 2026
Learning Dynamics Reveal a Hierarchy of Weight-Induced Layerwise Gram Metrics
arXiv · 12 iun. 2026

PIRAMID: Progress and Plans
LessWrong · 27 iul. 2026

Research Note: Filtering Subversion-Relevant Information From Pretraining Data Is Feasible
LessWrong · 5 oct. 2026