arXiv AI By Pratik Jawahar, Riccardo Maggioni, Jonas Petersen, Matteo Cozzi, Gian-Alessandro Lombardi, Marek Gajewski, Camilla Mazzoleni, Federico Martelli

Certified Access: Test-Time Compute on Conservative Physics-Structured AI Memory

Read the original on arXiv AI →

The paper introduces a theoretical and empirical framework for test‑time compute on a Latent Dynamics Model used as memory. It shows that mechanisms such as retries, confidence‑based escalation, and non‑local routing can be formally analyzed using a damped symplectic step of a learned Hamiltonian, yielding exact phase‑volume Jacobians, bounded energy changes, and latch‑transport laws. The authors verify a certificate stack on an analytic testbed, demonstrating how escape failures are resolved by a Lorentz squeeze and reach failures by a gated canonical translation, and evaluate scaling limits against a physics‑free baseline.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

Hugging Face Trending Papers
Jul 13

The Equilibrium Is the Initialization: Lazy Identity Collapse in Physics-Structured Deep Equilibrium Reasoning

Deep equilibrium models promise input-adaptive implicit computation: harder problems should demand more solver iterations, and the solved equilibrium should encode the result of genuine iterative inference. We report a cautionary study of a port-Hamiltonian DEQ with a learned initialization on two reasoning tasks -- ProofWriter entailment over frozen DeBERTa embeddings and a BFS-verified graph-reachability benchmark -- in which the implicit computation is a silent no-op.

arXiv AI
Sep 1

Locked at the Entrance, Open Inside: Where RLVR Narrows the Solution Space

The paper investigates why reinforcement learning with verifiable rewards (RLVR) reduces the diversity of solutions in reasoning tasks. By analyzing the Countdown task, the authors show that RLVR contracts the solution space mainly at the entrance—before the first arithmetic operation—causing a 67% drop in solution coverage. They demonstrate that providing an unselected entrance prefix or applying entrance‑targeted interventions can restore or even improve coverage without harming accuracy.

By Qiancheng Zhou, Ruizhe Li
arXiv Machine Learning
Jul 1

Certified Speculative Execution for Untrusted AI Agents

arXiv:2606. 31023v1 Announce Type: cross Abstract: Hard-constrained sequential decision systems have no certified way to spend the test-time compute of modern AI: executing the multi-step drafts of a learned policy or a frozen LLM forfeits the feasibility guarantee a trusted solver provides, while invoking the solver at every step forfeits the speed the AI offers.

By Chenyu Zhou, Qiliang Jiang, Shuning Wu, Xu Zhou