arXiv Machine Learning By Ahanaf Hasan Ariq, Abrar Shahid

Certified Behavioral Retention for Continual Adaptation with Held-Out Anchors

Read the original on arXiv Machine Learning →

Certified Anchor-Based Adaptation (CABA) is a post‑update gate for continual adaptation that reserves historical observations, compares old and candidate policies on frozen representations, and selects the largest interpolation coefficient whose worst‑anchor forward KL divergence stays within a declared budget. The method does not require action labels or complete trajectories and is supported by a theory‑led certification framework that provides uniform behavioral‑divergence bounds under representation‑coverage and Lipschitz assumptions. In a UCI Human Activity Recognition study, CABA reduced mean forgetting from 1.01 % to 0.00 % at a budget ε = 0.05, while slightly lowering final average accuracy.

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 Machine Learning.

arXiv Machine Learning
Oct 15

Efficient Test-Time Adaptation For Robot Policies

arXiv:2610.20318v1 Announce Type: cross Abstract: Reinforcement-learning policies for robot locomotion can fail at deployment when operating conditions shift (e.g., rough or slippery terrain, payload...

By Motasem Alfarra, Pietro Mazzaglia, Markus Peschl, Daniel Dijkman, Christos Louizos
arXiv Machine Learning
Sep 17

A Convergence Framework for Deep $V$-Learning: Error Propagation and Sharp Action-Gap Bounds

The paper presents a convergence framework for deep $V$‑learning over a finite horizon $H$, deriving explicit bounds on policy loss by decomposing the Bellman update error into six residuals. It shows how $L^s$ concentrability controls expected $L^1$ loss, quantifies the impact of shared sampling across horizon levels, and provides optimal and near‑optimal sample allocations for statistical error rates. The work also establishes sharp action‑gap bounds under a margin condition, transfers optimal‑gap results to frozen‑iterate gaps, and offers consistency guarantees for generative‑reset approximate‑ERM procedures with exact action scores.

By Yury Kolomeytsev