Clustered Randomized Smoothing for Stochastic Prediction Functions
arXiv:2608.12037
2026
Sampling
1 ideas extracted · analyzed Sep 1, 2026
What the math gives to ML
The paper's transferable contribution is a mode-preserving alternative to global randomized smoothing for stochastic predictors. Instead of averaging all noisy predictions, it partitions prediction samples into clusters and applies coordinate-wise alpha-trimming within each cluster, producing a mixture of locally robust components. This is directly useful as an inference-time wrapper for trajectory, diffusion, policy, or multimodal regression networks, where global smoothing can average incompatible modes into unsafe outputs. The strongest initial implementation is a black-box clustered smoothing layer that returns cluster weights, trimmed centers, and within-cluster covariance, followed by experiments measuring distributional fidelity and safety under input perturbations.
Ideas from this paper
✗ Mechanism failed
2026
Wrap a stochastic neural predictor with a robust multimodal aggregation procedure: sample the predictor at perturbed inputs, cluster the resulting outputs, trim an alpha-fraction of outliers separately inside every cluster, and return a weighted mixture rather than one global average. This should preserve distinct plausible modes while suppressing adversarial or heavy-tailed samples that would otherwise distort the prediction.
Useful7/10
Difficulty4/10
Novelty7/10