Skip to content

Hidden Gauge Controls Feature Specialization in ReLU Networks

Aug 2026 · 1 citation · 26 references
Computer Science

TL;DR

This work shows that changing the scale of initial weights can determine which neurons learn a feature without altering any neuron's initial contribution, and reveals how initialization can control the organization of a learned representation without changing what the network initially represents.

Abstract

The success of deep learning depends on learning useful representations, yet predicting how training organizes these representations across neurons remains difficult. In this work, we show that changing the scale of initial weights can determine which neurons learn a feature without altering any neuron's initial contribution. We construct ReLU networks with identical initial features and predictions that reach the same final predictions with different roles for their neurons. In one, all neurons share the learned feature. In the other, one neuron acquires it while every other neuron's contribution vanishes. The only change is the relative scale of each neuron's input and output weights. Our analysis explains how an initial learning advantage persists through convergence: as one neuron learns the target, it reduces the error driving the others and limits their subsequent adaptation. We prove this outcome in a nonlinear model under gradient flow and small-step gradient descent, and quantify how scale changes the speed and path of feature learning. Experiments verify the predicted dynamics and show that scale also changes feature assignment when two features compete. These results reveal how initialization can control the organization of a learned representation without changing what the network initially represents.

View source

Similar papers

#machine learning Preprint Sep 2026

A Theoretical Analysis of Generalization Dynamics in Neural Networks under Gradient Descent with Weight Decay

A broad class of neural networks trained under the $\ell^2$ loss by gradient descent with weight decay with weight decay is studied, and the convergence of GD to a neighbourhood of the global minimizers of the empirical loss is proved.

Yu-Qing Wang, I. Kevrekidis, Mikhail Belkin · 1 citation
Preprint Aug 2026

Learning in Deep Networks under Dale's Constraint

This work introduces a biologically motivated neural architecture in which both neural activations and learning signals are represented by non-negative activity, and synapses have fixed sign, while still supporting backpropagation-like learning.

Roy Abel, Shimon Ullman · 0 citations
Preprint Aug 2026

Neural Quadratic Forms: A Unified Minimal Model for Sudden Learning and Scaling Laws

It is shown that a symmetry fixes what variables are: a network layer is a sum over interchangeable units, so relabeling the units leaves it unchanged; given smoothness and the condition that a unit's gradient vanish at the origin, symmetry then enforces a universal leading form for the expansion about the near-zero we...

Zi-Yin Liu, Yi-Zhou Xu, Tomaso A. Poggio et al. · 0 citations
Open access Sep 2026

Predictive learning with local plasticity in excitatory-inhibitory networks

Overall, these results link predictive coding to local circuit plasticity, show it does not require an explicit prediction error representation, and suggest a normative role for BCM-like plasticity in excitatory synapses.

Henrique Reis Aguiar, M. Hennig · 0 citations
#machine learning Preprint Aug 2026

Correlation flow governs learning at criticality

Combining mean-field theory and random matrix theory, a direct link between correlation propagation and the Neural Tangent Kernel (NTK) is established that governs learning in the sequential limit of infinitely wide, infinitely deep networks.

andrea Combette, Nelly Pustelnik, Antoine Venaille · 0 citations
Jul 2026

Simplifying Neural Networks During Training

This work proposes an NC-inspired training framework for simplifying deep networks during training, monitoring representation dynamics through the Inverse Fisher Criterion to identify both the split point between feature extraction and classification and the training stage at which simplification becomes viable.

Lorenzo Sciandra, Samuele Fonio, Roberto Esposito · 0 citations

Related blog posts

Microsoft Research Blog Oct 12, 2026

Simulating student learning for better AI tutoring

StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.