Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation

arXiv:2607.24358 2026 Memory 1 ideas extracted · analyzed Aug 31, 2026

What the math gives to ML

The paper develops a decoder-side refinement principle: all one-bit queries are fixed before the decoder learns a coarse estimate, yet the same stored bits can later be reinterpreted relative to that estimate. Its periodic-residue construction and shifted random grids produce bounded, correlated measurements whose bias and second moment remain controlled under only a finite k-th central moment, including heavy-tailed regimes with k≤2. A direct neural-network transfer is communication-efficient distributed or federated optimization: workers transmit a non-adaptive one-bit block for gradients, while the server first localizes the average gradient and then selects the appropriate refinement interpretation. The resulting quantizer is especially relevant when gradient coordinates are heavy-tailed and ordinary sign or fixed-range quantization has unstable variance.

Ideas from this paper

Unverified 2026

Decoder-Side Refinement for Heavy-Tailed Gradients

Replace ordinary sign-gradient or fixed-range gradient quantization in distributed training with a non-adaptive one-bit refinement block. Workers generate all localization and multiscale residue bits using public randomness before the server knows the current aggregate gradient; after decoding a coarse center, the server chooses which stored phase and scale interpretation to use. This should reduce clipping and variance for heavy-tailed gradients without requiring a second communication round.

Useful6/10
Difficulty6/10
Novelty7/10
Paper: Universal Refinement without Interaction: Order-Optimal 1-Bit Mean Estimation arXiv:2607.24358