aiqbench analysis
This paper reframes neural plasticity as a control theory problem, deriving exact bounds on the energy required to reach specific task targets under history-dependent dynamics. By introducing a task-conditioned adaptation cost and utilizing Wasserstein transport, it establishes a rigorous learning-retention frontier that challenges previous assumptions about capacity thresholds and volume monotonicity. The work provides critical mathematical tools for understanding the fundamental trade-offs between retaining past knowledge and adapting to new tasks in continual learning scenarios.
A Thermodynamic Theory of Learning Part II: History-Dependent Reachability and Continual Learning
arXiv:2602.07950v3 Announce Type: replace Abstract: We formulate plasticity as target-dependent, finite-horizon reachability under history-dependent dynamics, using standard minimum-energy control theory. An extended state includes parameters and internal variables that affect future updates. Around a reference trajectory, the input-to-endpoint response and its controllability Gramian determine the minimum input energy for each reachable displacement. Minimizing this energy over the joint task target defines a task-conditioned adaptation cost, exact for the arbitrary-input linear model. A solvable learning-retention example shows that this cost can increase without any rank loss, and distinguishes small directional gain from an inaccessible direction. Wasserstein transport supplies a complementary global lower bound, while learning-map Jacobians describe deformation of initial perturbations rather than response to future inputs. The resulting learning-retention frontier depends on the current extended state, admissible updates, target, horizon, and cost metric; nonlinear and constrained-update applications require additional control of these modeling choices.
Abstract:We formulate plasticity as target-dependent, finite-horizon reachability under history-dependent dynamics, using standard minimum-energy control theory. An extended state includes parameters and internal variables that affect future updates. Around a reference trajectory, the input-to-endpoint response and its controllability Gramian determine the minimum input energy for each reachable displacement. Minimizing this energy over the joint task target defines a task-conditioned adaptation cost, exact for the arbitrary-input linear model. A solvable learning-retention example shows that this cost can increase without any rank loss, and distinguishes small directional gain from an inaccessible direction. Wasserstein transport supplies a complementary global lower bound, while learning-map Jacobians describe deformation of initial perturbations rather than response to future inputs. The resulting learning-retention frontier depends on the current extended state, admissible updates, target, horizon, and cost metric; nonlinear and constrained-update applications require additional control of these modeling choices.
13 pages. Part II of the series. Substantially revised: withdraws the earlier compatible capacity threshold, unconditional volume-monotonicity claim, and universal dissipation-to-forgetting inference; reformulates the analysis around history-dependent reachability and task-conditioned adaptation cost. Includes counterexamples, an exact learning-retention frontier
Machine Learning (cs.LG)
arXiv:2602.07950 [cs.LG]
(or arXiv:2602.07950v3 [cs.LG] for this version)
Full text under the publisher's open licence · 188 words
Related coverage

Game Design Creativity evals
LessWrong · Oct 12, 2026
Synthesis Superintelligence: from Semiconductors to Superconductors — Periodic Labs’ Liam Fedus and Ekin Dogus Cubuk
Latent Space · Oct 8, 2026
Dialogue with Eliezer Yudkowsky on Neural Networks
LessWrong · Oct 2, 2026

The Entangled Dimensions of Decision Theory
LessWrong · Jul 30, 2026