Memoization Without Keys: Compact, Out-of-Core Tables for Functions of Sorted Arguments

arXiv:2609.20276 · cs.DS, cs.LG · Submitted 2026-07-29 · Read on arXiv

cs.DS, cs.LG

Submitted: 2026-07-29

Updated: 2026-09-21

Code: https://github.com/tamalrkm/tapered-grid

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Core — 9× in this paper · explained in 2 episodes
• Quantization — 4× in this paper · explained in 12 episodes
• Accuracy — 3× in this paper · explained in 1 episode
• Verification — 3× in this paper · explained in 2 episodes
• Redundancy — 2× in this paper · explained in 2 episodes
• alpha — 2× in this paper · explained in 1 episode
• Allocator — 1× in this paper · explained in 1 episode
• Ambient Dimension — 1× in this paper · explained in 1 episode
• Benchmarking — 1× in this paper · explained in 3 episodes
• Decode — 1× in this paper · explained in 2 episodes

Sources

• AdaSplash: Adaptive Sparse Flash Attention
• On the best convergence rates of lightning plus polynomial approximations
• Turning Up the Heat: Min-p Sampling for Creative and Coherent LLM Outputs

Related papers

• Cascaded Learned Bloom Filter for Optimizing Model-Filter Size Balance and Fast Rejection
• Edge-Private Matching Kernels Through Local Decoding
• Local Node Differential Privacy
• Cheaper by the Batch: Shared Traversal for Genotype Graph Editing
• Scalable Algorithms for Approximate DNF Model Counting
• On the Approximation Relationship between Optimizing Ratio of Submodular (RS) and Difference of Submodular (DS) Functions