Skip to content

Gate-Zero Growth: A Geometric Framework for Function-Preserving Continual Learning

Jul 2026 · arXiv.org · Vol abs/2607.14571 · 0 citations · 28 references
Computer Science

TL;DR

The same geometric analysis covers LoRA, ReZero, and zero-init adapter constructions, establishing gate-zero growth as the canonical instance of a shared local geometry that governs safe capacity activation in CL.

Abstract

We introduce \emph{gate-zero growth}, a function-preserving (FP) operator for continual learning that adds new residual blocks through a zero-initialised gate. Under a transversality condition, gate-zero growth induces \emph{rank separation} in the functional Jacobian: old directions are unchanged, new-weight directions are exactly flat at the growth point, and new gate directions are the only first-order source of new functional variation. As gates open during continual learning, function drift is $O(\|\boldsymbol{\alpha}\|^2)$ and Jacobian leakage $O(\|\boldsymbol{\alpha}\|_\infty)$, giving a controlled departure from the FP locus. On a $300\mathrm{M}\to857\mathrm{M}$ Transformer adapted from WikiText-103 to BookCorpus, gate-zero growth reaches near-zero old-domain forgetting ($\Delta_A<0.1$) under both exact-preservation (Isolation) and joint-frontier (Freeze-Nothing) operating points, while a non-FP control ($G_{\text{stack}}$) suffers an order-of-magnitude larger forgetting under the same recipe. The same geometric analysis covers LoRA, ReZero, and zero-init adapter constructions, establishing gate-zero growth as the canonical instance of a shared local geometry that governs safe capacity activation in CL.

View source

Similar papers

Preprint Aug 2026

Sequential Euclidean connections with exponential memory: distributional performance and adversarial robustness

Comparison with the running mean highlights the stationary insertion-length distribution, its time-homogeneous update, stationary coefficient profile, and fixed effective memory, and its time-homogeneous update, stationary coefficient profile, and fixed effective memory.

P. D. de Castro · 1 citation · ⚡1
Preprint Sep 2026

A global spectral gap for Metropolis-adjusted Langevin algorithm with a uniformly randomized step size

Let $\pi(\mathrm{d} x)\propto e^{-U(x)}\,\mathrm{d} x$ on $\mathbb R^d$, where $0<m\leq L<\infty$, $mI_d\preceq\nabla^2U(x)\preceq LI_d$, and $\kappa=L/m$. It is known that, under warm-start assumptions, fixed-step Metropolis-adjusted Langevin algorithm (MALA) with properly tuned step size has mixing time of order $\ka...

Qian Qin · 0 citations
Jul 2026

Scaling Limits of Constant-Stepsize SGD at Flat Minima

This work proves existence, uniqueness, and geometric convergence to an augmented invariant law in a Wasserstein distance induced by an $\alpha$-dependent metric and analysis of the small-stepsize scaling limit gives corresponding results for coordinate-separable objectives with unequal flatness exponents.

Jing-Yi Zhang, Cheng Mao, Debankur Mukherjee · 0 citations
Preprint Jul 2026

Projected Inner-Function Dynamics and Crystalline Measures of Meyer-Blaschke type

We generalize a construction of Yves Meyer of sparse crystalline measures arising from powers of a Blaschke factor. Starting from a recursion $f_n=\theta^n f_0$ on the unit circle where $\theta$ is an inner function, we project the Fourier coefficient array $\widehat{f_n}(k)$ to the real line by placing its entries at...

O. Szehr, R. Zarouf · 0 citations
Preprint Aug 2026

Revisiting Decomposition-Invariant Conditional Gradient Methods for Polytopes

A method is introduced whose number of iterations to reach an $\epsilon$-approximate solution is of the order of n, and whose number of iterations to $\epsilon$-approximation scales with $\frac{\beta{}D^2n}{\alpha}\log(1/\epsilon)$, in a meaningful regime.

Dan Garber · 0 citations

Related blog posts

Microsoft Research Blog Nov 3, 2026

Learn the rules: The hacker mindset

Research Manager Mike Walker reflects on a career spanning hacker culture, cybersecurity, and AI, sharing lessons about trust, teamwork, leadership, and why solving difficult problems requires curiosity, judgment, agility—and an understanding of the rules. The post Learn the rules: The hacker mindset appeared first on Microsoft Research.

Google DeepMind Blog Nov 3, 2026

Agentic cheminformatics with Google Antigravity

Learn how Google Antigravity and our Cheminformatics Skills accelerate drug discovery workflows, search compounds, and propose novel rigidified macrocycles.

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

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