In the current era of "thinking" models, test-time compute (TTC)—the ability of a model to spend more time or energy on a difficult query—is becoming a cornerstone of AI performance. However, most TTC mechanisms like retries or early exits are treated as black boxes. We know they help, but we lack a structural understanding of what that extra compute "buys" us or how it impacts the model's internal stability.
A new paper, "Certified Access: Test-Time Compute on Conservative Physics-Structured AI Memory," presented at the NeurIPS 2026 Workshop on Long-Context Foundation Models, proposes a radical shift: treating AI memory as a physical system governed by the laws of dynamics to provide formal "certificates" for every extra compute step.
TL;DR
The authors introduce a framework for "certified access" in AI memory by structuring it as a Latent Dynamics Model. By using physics-inspired mechanisms like Lorentz squeezes and gated channels, they provide formal guarantees on energy conservation and information transport, enabling compute-efficient inference with mathematical stability bounds.
What Problem Does This Paper Address?
Modern deep learning models often allocate compute adaptively—for example, by taking more steps to "relax" into a solution. However, these mechanisms are typically ad-hoc additions. There is no structural account of how extra forward passes change the model's latent state or whether they might lead to instability (like the state "escaping" to infinity).
The authors address this by formalizing two types of retrieval failures:
- Kinematic Reach Failure: The target memory is simply too far away to reach within the model's "causal box" (a speed limit imposed by the architecture).
- Energetic Escape Failure: The target is nearby but trapped behind a "potential barrier" (an energy hill) that the current state doesn't have enough energy to cross.
Methods
The researchers build upon the Causal Learning Unit (CLU), a memory architecture where the latent state $(q, p)$ evolves like a physical particle under a learned Hamiltonian. To fix the failure modes mentioned above, they introduce two "certified" mechanisms:
- Lorentz Squeeze ($S_\zeta^{(M)}$): Inspired by special relativity, this mechanism injects a bounded amount of energy to help the state "hop" over potential barriers. It acts as a hyperbolic rotation in phase space.
- Gated Canonical Translation: This acts as a "wormhole" or non-local jump, allowing the state to bypass the causal speed limit and reach distant targets instantly.
Crucially, these aren't just heuristics. They come with a "certificate stack":
- Jacobian Determinant ($\det J = 1$): Guarantees that the volume of information in phase space is preserved (no information is "crushed" or "blown up").
- Bounded Energy Change: Quantifies exactly how much "fuel" is injected into the system.
- Latch-Transport Law: Ensures that information stored in specific "protected" directions (Goldstone charges) is moved correctly rather than erased.
Datasets
The authors evaluated their framework using three distinct setups:
- Analytic Testbed: A custom-designed 2D and 4D symmetric double-well potential used to verify the physics certificates to machine precision.
- MQAR (Multi-Query Associative Recall): A standard benchmark for associative memory, used here to test "compute rationing"—how well the model can decide to stop early on easy queries.
- Lattice Routing Task: A task designed to evaluate the efficiency of non-local jumps across a grid-like memory structure.
Key Insights and Ideas
- Physics as a Safety Rail: By using symplectic integrators (like velocity-Verlet), the model's "memory" behaves like a conservative physical system. This makes test-time compute predictable and mathematically verifiable.
- Volume $\neq$ Stability: A major "aha" moment in the paper is that preserving phase-space volume ($\det J=1$) is necessary but not sufficient for stability. As shown in Figure 1, even with volume preservation, a state can escape to infinity if it jumps outside a "coercive" region of the potential. The authors show that a "certificate screen" is required to reject unsafe jumps.
- Transport vs. Erasure: The authors demonstrate that standard "state-replacing" maps (common in many AI architectures) effectively erase stored information by annihilating phase volume. Their gated channels, by contrast, transport the "Goldstone charge" perfectly, as seen in Figure 2(b).
Key Results
- Machine Precision Verification: On the analytic testbed, the certificates for volume and energy held to a relative error of $10^{-12}$ to $10^{-16}$.
- Compute Rationing: In the MQAR task, the self-calibrating gate reduced the number of relaxation steps by up to $9.9\times$ for certain memory capacities while maintaining perfect accuracy.
- Scaling Efficiency: The gated non-local routing maintained a flat FLOP count as distance increased, whereas traditional multi-hop diffusion methods saw costs grow linearly or quadratically.
- Training Dynamics: Figure 3 shows that as the training budget increases, both storage fidelity and gated accuracy converge, though larger memory capacities require significantly more epochs to saturate.
Limitations and Future Work
The authors are candid about the trade-offs. Interestingly, they found that a "physics-free" MLP router actually outperformed their energy-gated version in raw accuracy and FLOP efficiency on the routing task. They argue that their contribution is the formalization and safety of the certificate stack, not necessarily setting new SOTA benchmarks.
Other noted limitations include:
- Noise Sensitivity: The compute-rationing gate's accuracy degrades sharply when the input cues are noisy.
- Local Selection: The Lorentz squeeze helps with "reach," but doesn't necessarily help the model choose between two nearby, equally valid attractors.
- Future Directions: The team plans to explore "learned entrance-steering" for gated channels and testing these physics-structured memories on much larger, real-world latent potentials.
Summary updated