Consolidation-Expansion Operator Mechanics:A Unified Framework for Adaptive Learning

TL;DR

The paper introduces OpMech, a unified framework for adaptive learning that uses the order-gap to control and optimize the alternation between consolidation and expansion operations.

Contribution

It formalizes the order-gap as a real-time control signal and demonstrates its application across multiple domains, including recursive language models.

Findings

Order-gap decays along convergent trajectories.

A large order-gap indicates the system is far from convergence.

Order-gap-based stopping guarantees convergence in various settings.

Abstract

Every adaptive learning system must alternate between two operations: consolidating what it already knows and expanding into new evidence. We propose \emph{Consolidation-Expansion Operator Mechanics} (OpMech), a framework that makes this structure precise. The central object is the \emph{order-gap} $\Ogap(\theta; e)$, the degree to which a consolidation operator~$Q$ and an expansion operator~$P_e$ fail to commute at a given knowledge state. Because the order-gap is computable from the system's own trajectory, it serves as a real-time control signal: large values indicate that the system is still sensitive to the ordering of consolidation and expansion; once the order-gap falls and stays small, further processing is unlikely to change the outcome. Three results give the signal precise meaning: the order-gap decays along convergent trajectories; a persistently large order-gap implies the system is far from its settled state; and an order-gap-based stopping rule terminates with provable guarantees in both noiseless and bounded-noise settings. The framework applies across five domains: bandits, reinforcement learning, stochastic optimization, continual learning, and recursive language models. We give conditions under which the order-gap reliably tracks convergence in three representative cases. We develop the recursive language model application in detail, showing how OpMech replaces heuristic stopping rules and fixed recursion budgets with principled, evidence-driven alternatives.