Math: Dynamic programming

Machine-learning ideas tagged Dynamic programming in the Math taxonomy of the Math2NN corpus.

2 ideas found

Solves: Memory Math: Dynamic programming Clear all

△ Mechanism confirmed, baseline not beaten 2026

Rate-adaptive KV-cache quantizer

Allocate different entropy budgets to different KV-cache blocks instead of assigning every token and head the same nominal bitwidth. Use the ECASQ Lagrangian so high-variance or attention-sensitive blocks receive more codepoints, while predictable blocks collapse to fewer symbols and become highly compressible. Preserve unbiasedness per scalar or block so reconstructed keys and values have zero mean quantization error conditional on the original tensor.

Useful8/10

Difficulty6/10

Novelty7/10

Memory Memory Accuracy Scalability

Paper: Entropy-Constrained Adaptive Stochastic Quantization arXiv:2608.18147

△ Mechanism confirmed, baseline not beaten 2026

Entropy-constrained unbiased block quantization

Replace fixed-grid stochastic quantization of each tensor block with an adaptive ordered codebook selected under both an entropy budget and a maximum number of codepoints. Within every interval between adjacent codepoints, use unbiased stochastic interpolation, so the quantized block remains unbiased while the emitted symbol distribution becomes easier for arithmetic or Huffman coding to compress. The representation should reduce actual compressed bytes at fixed MSE, or reduce MSE at fixed…

Useful8/10

Difficulty6/10

Novelty6/10

Memory Memory Speedup Accuracy

Paper: Entropy-Constrained Adaptive Stochastic Quantization arXiv:2608.18147