Memory ideas

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

△ Mechanism confirmed, baseline not beaten 2026

Orthogonally mixed 3-bit KV cache

Replace ordinary per-channel or per-token KV quantization with a structured orthogonal transform followed by blockwise 3-bit quantization. Use a normalized Walsh-Hadamard transform and small SO(4) rotations to spread outliers across coordinates, quantize the transformed vectors, and exploit orthogonality to rotate queries and attention outputs so unquantized attention remains mathematically equivalent.

Useful7/10
Difficulty6/10
Novelty6/10
Paper: RotaryQuant: Fitting 120B MoE Models on Consumer Hardware via Fused Compressed-Space Attention arXiv:2608.08081
△ Mechanism confirmed, baseline not beaten 2026

Star-Delta Hub Elimination

Remove a latent relay or hub token from an attention or graph layer and replace its two-hop influence by direct effective edges between retained tokens. The correction is a normalized rank-one update, so it can preserve hub-mediated communication while reducing the number of stored and processed states.

Useful7/10
Difficulty5/10
Novelty7/10
Paper: The Invariant Measure of Multiscale Markov Chains via Fast Arborescence Factorization arXiv:2606.31596
Unverified 2026

Transform-Domain Quantized Edge Attention

Compress a trained graph-attention model's edge-dependent logits or gates in the line-graph Fourier domain. Smooth edge values become concentrated in low-frequency coefficients, allowing low-frequency coefficients to retain more precision while high-frequency residuals use fewer bits or are discarded.

Useful6/10
Difficulty6/10
Novelty8/10
Paper: Lossy compression of weighted graph adjacency matrices by transform coding arXiv:2607.14834