Memory ideas

External memories, state compression, retrieval-style read/write policies and calibrated stopping rules.

✗ Mechanism failed 2026

Ranking-Aware Projection Dimension Rule

Replace the usual JL dimension choice with a task-specific dimension budget based on the paper's asymptotic ranking law. For retrieval, nearest-neighbor search, or compressed attention keys, choose m from a target Kendall correlation and automatically expand the projection when measured ranking quality falls below the target.

Useful7/10
Difficulty3/10
Novelty7/10
Paper: Exact Limits of Random Projections for Preserving Geometry: Distance Recovery, Nearest-Neighbor Rankings, and Covariance Shape in Gaussian Models arXiv:2609.02155
✗ Mechanism failed 2026

Regret-Balanced Adaptive Context

Choose the retained context length by balancing the statistical complexity of adding lag j against the squared prediction bias from discarding it. Unlike a fixed context window, the rule uses both the remaining-horizon spectrum and the estimated tail energy, allowing a model to expand or shrink its memory online.

Useful6/10
Difficulty5/10
Novelty7/10
Paper: Sharp Minimax Regret for Infinite-Memory Logistic Prediction arXiv:2608.26515