Math: Dynamic programming

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

2 ideas found

Solves: Speedup Math: Dynamic programming Clear all

△ 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

Unverified 2026

Budgeted Tree Message-Passing Planner

Before or during graph-neural-network inference, use a tree dynamic program to choose a limited set of active computation nodes and upgraded message-passing edges. A node receives an embedding from an active landmark only when the selected path has enough residual communication radius, so the planner directly optimizes weighted coverage under a joint node-and-edge budget. The resulting active subgraph is then used by a sparse GNN or graph transformer.

Useful6/10

Difficulty5/10

Novelty7/10

Architecture Speedup Scalability Graph nn

Paper: Maximum Covering Network Design on Graphs with Low Connectivity: Dynamic Programming and Block-Cut Trees arXiv:2608.20894