Search arXivSearch

arXiv · 2512.06582

Diagnosing Capability Preservation and Task Sensitivity in Memory Augmented Document Classifiers

Abstract

End task accuracy alone cannot determine whether a memory mechanism preserves an acquired capability, exposes sample-specific stored information, or contributes measurably to downstream performance. This study introduces Protected QL Memory and evaluates capability preservation, diagnostic access, and task performance sensitivity as distinct empirical properties. Protected QL Memory is a dual path document classifier combining a causal local pathway, an associative matrix writer, and a finalized memory reader. A capability-protected schedule acquires a controlled binding capability, adapts the local pathway while constraining writer degradation, trains controlled memory access, and restricts full path task fitting. Pre and post adaptation diagnostics and finalized-memory interventions were evaluated across nine dataset-seed conditions. Writer capability was fully preserved, with 100% post-adaptation accuracy. Cyclic reassignment of finalized matrices produced diagnostic accuracy gaps of 86.3 to 86.9 percentage points, showing strong dependence on example memory correspondence. In contrast, natural text macro F1 changed by less than 0.002 when finalized matrices were reassigned, zeroed, or replaced by batch means. Locked-test macro F1 was 90.94% on AG News, 81.78% on IMDB, and 62.63% on Yelp Review Full, comparable to compact controls. Preserving associative capability and maintaining diagnostic access to sample specific memory did not imply measurable downstream reliance on that memory. Protected memory designs should therefore treat capability preservation, diagnostic access, and task alignment as separate objectives and evaluate downstream memory sensitivity directly.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Isaac Kofi Nti. 2026-08-24. Diagnosing Capability Preservation and Task Sensitivity in Memory Augmented Document Classifiers. https://arxiv.org/abs/2512.06582

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Online Regularized Statistical Learning in Reproducing Kernel Hilbert Space With Non-Stationary Data

We study recursive regularized learning algorithms in the reproducing kernel Hilbert space (RKHS) with non-stationary online data streams. We introduce the concept of a random Tikhonov regularization path and decompose the tracking error of the algorithm's output for the regularization path into random difference equations in RKHS. We show that the tracking error vanishes in mean square and almost surely if the regularization path is slowly time-varying. Then, leveraging the monotonicity of inverse operators and the spectral decomposition of compact operators, and introducing the RKHS persistence of excitation condition, we develop a dominated convergence method to prove the mean square and almost sure consistency between the regularization path and the unknown function to be learned. Especially, for independent and non-identically distributed data streams, the mean square and almost sure consistency between the algorithm's output and the unknown function is achieved if the input data's marginal probability measures are slowly time-varying and the average measure over each fixed-length time period is uniformly above a strictly positive finite Borel measure.

cs.LG

Reflective Policy Optimization

On-policy reinforcement learning methods, like Trust Region Policy Optimization (TRPO) and Proximal Policy Optimization (PPO), often demand extensive data per update, leading to sample inefficiency. This paper introduces Reflective Policy Optimization (RPO), a novel on-policy extension that amalgamates past and future state-action information for policy optimization. This approach empowers the agent for introspection, allowing modifications to its actions within the current state. Theoretical analysis confirms that policy performance is monotonically improved and contracts the solution space, consequently expediting the convergence procedure. Empirical results demonstrate RPO's feasibility and efficacy in two reinforcement learning benchmarks, culminating in superior sample efficiency. The source code of this work is available at https://github.com/Edgargan/RPO.

cs.LG

Transductive Off-policy Proximal Policy Optimization

Proximal Policy Optimization (PPO) is a popular model-free reinforcement learning algorithm, esteemed for its simplicity and efficacy. However, due to its inherent on-policy nature, its proficiency in harnessing data from disparate policies is constrained. This paper introduces a novel off-policy extension to the original PPO method, christened Transductive Off-policy PPO (ToPPO). Herein, we provide theoretical justification for incorporating off-policy data in PPO training and prudent guidelines for its safe application. Our contribution includes a novel formulation of the policy improvement lower bound for prospective policies derived from off-policy data, accompanied by a computationally efficient mechanism to optimize this bound, underpinned by assurances of monotonic improvement. Comprehensive experimental results across six representative tasks underscore ToPPO's promising performance.

cs.LG