ML: Federated

Machine-learning ideas tagged Federated in the ML taxonomy of the Math2NN corpus.

✗ Mechanism failed 2026

Channel-Noise Differentially Private Federated Optimizer

Replace independently injected federated-learning noise with communication noise whose variance increases with disagreement between a client update and a server or neighboring-client reference. Combine this with a contractive server update so that the sensitivity of later communicated updates decays geometrically, reducing cumulative privacy loss relative to naive composition. The method is suitable for decentralized SGD, FedAvg, or distributed fine-tuning.

Useful8/10
Difficulty6/10
Novelty7/10
Paper: To What Extent Can Inherent Communication Noise Guarantee Privacy in Distributed Cooperative Control? arXiv:2607.25564
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
Unverified 2026

Preference-Ratio Adjacency for Distributed Multi-Objective Training

When clients optimize the same publicly known pair of losses but have private trade-offs, protect only the ratio of objective weights rather than the complete weight vector. Communicate a ratio-conditioned mixed gradient or controller statistic, with sensitivity defined over bounded ratio changes. This can reduce the required privacy noise when common rescaling of all objective weights carries no meaningful private information.

Useful6/10
Difficulty5/10
Novelty8/10
Paper: To What Extent Can Inherent Communication Noise Guarantee Privacy in Distributed Cooperative Control? arXiv:2607.25564
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
✓✓ Beats tuned baseline 2026

Private spectral whitening front-end

Estimate the temporal spectrum of each sequence channel using a locally private procedure, then apply a regularized inverse-square-root spectral filter before the sequence enters attention or an SSM. The filter removes predictable low-frequency or narrow-band redundancy while avoiding unstable amplification at frequencies where the private estimate is small.

Useful6/10
Difficulty5/10
Novelty7/10
Paper: On the privacy cost for dependent Gaussian data: spectral density estimation under local differential privacy arXiv:2608.24847
Unverified 2026

Correlation-Window Training Regime Detector

Monitor short histories from distributed training replicas and detect whether their fluctuations are independent or synchronized using pairwise correlations. Use the detected regime to switch learning rate, gradient accumulation, or communication policy: synchronized high-variance episodes can receive a smaller step, while independent episodes can use more aggressive updates. The detector intentionally uses pairwise correlation features instead of a raw-waveform neural classifier, making it…

Useful5/10
Difficulty4/10
Novelty6/10
Paper: Real-Time Edge-based Detection of Correlated AI Data-Center Load Episodes arXiv:2608.22719
Unverified 2026

Inverse-square count-aware Gaussian release

Replace the constant-noise release used for private group aggregates with noise whose standard deviation grows linearly with the group count. The resulting relative error remains approximately constant, while the zCDP privacy loss decreases as the inverse square of group size; this is especially relevant to federated gradient aggregation or private expert-load statistics.

Useful5/10
Difficulty5/10
Novelty6/10
Paper: Better Privacy Guarantees for Larger Groups arXiv:2607.14406