Skip to content

The Ups and Downs of Backprop Weights

Sep 2026 · 0 citations · 51 references
Computer Science

TL;DR

It is argued that functional parameter identifiability may provide an organizing principle for models that systematically reuse and recombine learned functions while adapting only the components that need to change.

Abstract

Backpropagation (BP) has driven the remarkable success of modern deep learning by enabling large hierarchical networks to learn complex functions end-to-end. Yet it does not by itself determine how parameters should be organized so that functional components can be reused and adapted selectively. For example, object recognition and motion prediction may depend on overlapping parameter sets, making them difficult to isolate or modify independently. We call this condition weight entanglement. Modern architectures dynamically select which parts of a network process each sample: nonlinearities gate units, attention selects interactions, and Mixture-of-Experts architectures route inputs to modules. Yet such selection does not ensure that the same functional component remains linked to an identifiable parameter set across samples. We propose weight operators: parameterized modules that implement reusable functional components and can be composed at inference to form the function required by each sample. Learning proceeds in two stages: the model first infers the required operator composition, then updates only the selected operators'parameter sets. Vector Networks (VNs) provide one implementation. They couple operator selection to local error-driven updates within each layer and show that learned operators can be reused in combinations absent from training while updates remain restricted to the selected parameter sets. This provides a basis for testing functional parameter identifiability: whether an operator remains linked to the same functional component during learning. We argue that functional parameter identifiability may provide an organizing principle for models that systematically reuse and recombine learned functions while adapting only the components that need to change.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

LocalProp: Neuro-Localized Memory-Efficient Backpropagation

This work proposes LocalProp, a training procedure that locally updates the weights of a model, where the pre-training is based on I-JEPA, and empirically shows that it reaches good performance at a fraction of GPU peak memory.

Diana-Nicoleta Grigore, Iuliana Georgescu, R. Ionescu · 0 citations
#machine learning Preprint Sep 2026

NGN: Learning Neural Network Size as a Differentiable Count

The Neurogenesis Network (NGN), a differentiable parameterization for learning how many ordered structural components a model should use, is introduced and results show that structural capacity can be optimized directly as a count.

Li-Xing Li · 0 citations
#artificial intelligence Preprint Sep 2026

A Study of Hidden-State Optimization Order in Predictive Coding Networks

A boundary-first inference schedule that partitions a model into chunks, first coordinates hidden states at chunk boundaries, and then refines representations within each chunk is proposed, which instantiate in predictive coding networks (PCNs), a local-learning framework in which hidden activities and prediction error...

Xue-Yuan Li, Danilo Vasconcellos Vargas · 0 citations
#machine learning Preprint Aug 2026

Residual-Guided Randomized Neural Networks

A simple and broadly applicable residual guided procedure that greedily constructs the hidden layer using a closed form residual decrease criterion and yields a progressive training process with a guaranteed monotonic decrease of the training objective.

M. Akhtar, M. Tanveer, Mohd. Arshad · 0 citations
#machine learning Preprint Sep 2026

Backpropagated Output Momentum: Relocating Optimizer History from Parameters to Task Space

Optimizer momentum is usually stored as a parameter-sized moving average of past gradients, which makes history costly and fixes each past signal in the coordinates in which it was computed. We introduce Backpropagated Output Momentum (BOM), which instead stores a compact moving average of prediction errors at the mode...

Yu-Chen Li, Zong-Qi Fan, Nguyen H. Tran et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

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