Globally Gated Deep Linear Networks
Qianyi Li, Haim Sompolinsky
摘要
Recently proposed Gated Linear Networks (GLNs) present a tractable nonlinear network architecture, and exhibit interesting capabilities such as learning with local error signals and reduced forgetting in sequential learning. In this work, we introduce a novel gating architecture, named Globally Gated Deep Linear Networks (GGDLNs) where gating units are shared among all processing units in each layer, thereby decoupling the architectures of the nonlinear but unlearned gating and the learned linear processing motifs. We derive exact equations for the generalization properties of Bayesian Learning in these networks in the finite-width thermodynamic limit, defined by N, P → ∞ while P/N = O(1) where N and P are the hidden layers' width and size of training data sets respectfully. We find that the statistics of the network predictor can be expressed in terms of kernels that undergo shape renormalization through a data-dependent order parameter matrix compared to the infinite-width Gaussian Process (GP) kernels. Our theory accurately captures the behavior of finite width GGDLNs trained with gradient descent (GD) dynamics. We show that kernel shape renormalization gives rise to rich generalization properties w.r.t. network width, depth and L 2 regularization amplitude. Interestingly, networks with a large number of gating units behave similarly to standard ReLU architectures. Although gating units in the model do not participate in supervised learning, we show the utility of unsupervised learning of the gating parameters. Additionally, our theory allows the evaluation of the network's ability for learning multiple tasks by incorporating task-relevant information into the gating units. In summary, our work is the first exact theoretical solution of learning in a family of nonlinear networks with finite width. The rich and diverse behavior of the GGDLNs suggests that they are helpful analytically tractable models of learning single and multiple tasks, in finite-width nonlinear deep networks.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper4
- Dissecting the Interplay of Attention Paths in a Statistical Mechanics Theory of TransformersLorenzo Tiberi, Francesca Mignacco, Kazuki Irie, Haim SompolinskyNeurIPS 2024 · 被引用 12 次
- Adaptive kernel predictors from feature-learning infinite limits of neural networksClarissa Lauditi, Blake Bordelon, Cengiz PehlevanICML 2025
- Make Haste Slowly: A Theory of Emergent Structured Mixed Selectivity in Feature Learning ReLU NetworksDevon Jarvis, Richard Klein, Benjamin Rosman, Andrew M. SaxeICLR 2025
- From Kernels to Features: A Multi-Scale Adaptive Theory of Feature LearningNoa Rubin, Kirsten Fischer, Javed Lindner, Inbar Seroussi 等ICML 2025
它引用的顶会 Paper4
- Pay Attention to MLPsHanxiao Liu, Zihang Dai, David R. So, Quoc V. LeNeurIPS 2021 · 被引用 912 次
- The Neural Race Reduction: Dynamics of Abstraction in Gated NetworksAndrew M. Saxe, Shagun Sodhani, Sam Jay LewallenICML 2022 · 被引用 52 次
- A self consistent theory of Gaussian Processes captures feature learning effects in finite CNNsGadi Naveh, Zohar RingelNeurIPS 2021 · 被引用 38 次
- Gaussian Gated Linear NetworksDavid Budden, Adam H. Marblestone, Eren Sezener, Tor Lattimore 等NeurIPS 2020 · 被引用 12 次
相关 Paper
- Gated Linear NetworksJoel Veness, Tor Lattimore, David Budden, Avishkar Bhoopchand 等AAAI 2021 · 被引用 49 次
- Asymptotics of representation learning in finite Bayesian neural networksJacob A. Zavatone-Veth, Abdulkadir Canatar, Benjamin S. Ruben, Cengiz PehlevanNeurIPS 2021 · 被引用 45 次
- Critical feature learning in deep neural networksKirsten Fischer, Javed Lindner, David Dahmen, Zohar Ringel 等ICML 2024 · 被引用 15 次
- Fixing the NTK: From Neural Network Linearizations to Exact Convex ProgramsRajat Vadiraj Dwaraknath, Tolga Ergen, Mert PilanciNeurIPS 2023 · 被引用 1 次
- A unified theory of feature learning in RNNs and DNNsJan Bauer, Kirsten Fischer, Moritz Helias, Agostina PalmigianoICML 2026 · 被引用 4 次
