Interaction Is Not Necessary for Order-Optimal 1-Bit Mean Estimation

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

What the math gives to ML

The paper constructs a randomized, fully non-adaptive one-bit measurement scheme that estimates a mean without first localizing it and then adapting later queries. The transferable asset is a multiscale public-randomness protocol: fixed binary measurements at geometrically separated resolutions can cover a large dynamic range, while finite-moment assumptions control clipping and tail bias. This is relevant to federated or distributed neural training, where clients communicate gradient information under severe bit budgets and cannot afford interactive threshold refinement. The most direct experiment is to replace floating-point gradient communication with a fixed multiscale threshold sketch and measure optimization quality at equal communication cost.

Ideas from this paper

Unverified 2026

Nonadaptive multiscale one-bit gradient sketch

Replace communicated floating-point gradients in synchronous federated or data-parallel training with one-bit threshold queries whose thresholds are sampled publicly before gradients are observed. Use several fixed geometric amplitude scales so the same protocol handles unknown gradient means and heavy-tailed client updates without an interactive localization round. Decode each coordinate from the scale whose neighboring estimates are statistically consistent, then apply the decoded aggregate…

Useful6/10
Difficulty6/10
Novelty6/10
Paper: Interaction Is Not Necessary for Order-Optimal 1-Bit Mean Estimation arXiv:2608.02538