Memory ideas

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

✗ Failed on benchmark 2026

Equal-Volume KV Vector Quantization

Replace consecutive or randomly assigned transformed KV coefficients with groups whose variance-volume is approximately equal. Train one equal-size vector-quantizer codebook per group, so a fixed-width cache does not waste its low-rate budget by forcing high-variance and low-variance coordinates into badly mismatched groups. This is a drop-in quantization-layout change that can be applied to keys, values, or both.

Useful8/10
Difficulty5/10
Novelty7/10
Paper: Spend Bits Where Queries Look: KV Cache Vector Quantization with Attention-Preserving Transforms arXiv:2608.04074
Unverified 2026

Nonadaptive multiscale one-bit gradient sketch

Replace communicated floating-point gradients in synchronous federated or data-parallel training with one-bit threshold queries whose thresholds are sampled publicly before gradients are observed. Use several fixed geometric amplitude scales so the same protocol handles unknown gradient means and heavy-tailed client updates without an interactive localization round. Decode each coordinate from the scale whose neighboring estimates are statistically consistent, then apply the decoded aggregate…

Useful6/10
Difficulty6/10
Novelty6/10
Paper: Interaction Is Not Necessary for Order-Optimal 1-Bit Mean Estimation arXiv:2608.02538
✗ 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