arXiv Machine Learning

MMLA: Memory-Mediated Learning Architecture for Predictive Dual-State Adaptation

arXiv Machine Learning
Oct 15

MMLA-RSI: Recursive Self-Improvement through RTT and RTMA

The paper introduces MMLA‑RSI, a recursive self‑improvement framework within a Memory‑Mediated Learning Architecture. It presents two concrete implementations: Reasoning‑Time Training (RTT), which updates the policy state, and Reasoning‑Time Memory Adaptation (RTMA), which modifies the authoritative memory. Both routes treat their own adaptation mechanisms as improvable objects, enabling successive generations of agents to refine policy and memory through bounded rule languages and shared interfaces.

By Junyi Zou, Avrova Donz
arXiv AI
Oct 9

What to Admit and How to Present: Governing Persistent Memory in LLM Agents

The paper introduces two inference‑time designs—factor‑compiled admission (FC) and permission‑semantic admission (PS)—to govern persistent memory in large language model agents without retraining. FC evaluates entire memory entries, while PS decomposes entries into typed units, both using deterministic policies to decide what recalled information enters the working context and how it is expressed. Experiments on a development suite and an external benchmark show that FC and PS reduce failure rates and cross‑domain leakage compared to verbatim injection, though they increase personalization failures and do not meet all preregistered criteria.

By Chang Liu, Deliang Ding
arXiv AI
Jun 10

Learning What to Remember: Observability-Safe Memory Retention via Constrained Optimization for Long-Horizon Language Agents

arXiv:2606. 10616v1 Announce Type: new Abstract: Long-horizon language agents accumulate observations, reasoning traces, and retrieved facts that exceed their finite context windows, making memory retention a fundamental resource-allocation problem.

By Qingcan Kang, Liu Mingyang, Shixiong Kai, Kaichao Liang, Tao Zhong, Mingxuan Yuan
arXiv Machine Learning
Oct 3

Sharpen Before You Adapt: Data-Free Entry-State Sharpening for Test-Time Reinforcement Learning

The paper introduces entry-state sharpening, a data‑free pre‑training step that prepares a language model’s checkpoint in a sharper, lower‑entropy state before test‑time reinforcement learning (TTRL). By reducing policy entropy, the model can more efficiently use its limited adaptation budget, leading to higher endpoint conversion efficiency across tasks such as MATH, GPQA, and AMC. Experiments with different data‑free objectives (e.g., R‑Zero vs. SPIRAL) demonstrate that the choice of pre‑training objective strongly influences the checkpoint’s readiness for TTRL, and a label‑free self‑distillation intervention can further sharpen the entry state.

By Zhanming Zhang, Vinoth Selvendran
arXiv Computation and Language
Oct 16

Writability and the Pathway: A Controlled Study of Knowledge Injection into Addressed Memory

The paper investigates how to inject knowledge into addressed memory modules of language models. Using controlled experiments on GPT‑2 and production‑memory tests on Qwen3.8‑Flash‑Next‑FP8 and DeepSeek‑V4.1‑Flash, the authors compare row‑only and row‑plus‑projection updates, with and without fixed module‑residual anchoring. Results show that while anchoring reduces drift, lexical hits do not guarantee entity‑specific retrieval, and first‑token rankings alone do not ensure full answer success, indicating that writable memory is feasible but limited in scope.

By Wei Gao (Shibei Qiyuan AI Technology), Cheng Tian (Shibei Qiyuan AI Technology), Duan Yang (Xi'an Jiaotong University), Jianqing Yin (Shibei Qiyuan AI Technology)