Robust Mean Estimation under Quantization

Pedro Abdalla, Junren Chen
1/11/2026
stat.MLcs.LGmath.ST

No official code found. Best implementation: junrenchen58/one-bit-mean (0 stars, last commit 2025-12-19).

Abstract

We consider the problem of mean estimation under quantization and adversarial corruption. We construct multivariate robust estimators that are optimal up to logarithmic factors in two different settings. The first is a one-bit setting, where each bit depends only on a single sample, and the second is a partial quantization setting, in which the estimator may use a small fraction of unquantized data.

View on arXivView PDF

Code Implementations(1)

junrenchen58/one-bit-meanCommunity61%

Codes for paper "Robust mean estimation under quantization"

00MATLABNov 17, 202510 months ago

Similar Papers

Robust Estimation Under Heterogeneous Corruption Rates

81% match2025

Efficient Multivariate Robust Mean Estimation Under Mean-Shift Contamination

81% match2025

Online Robust Mean Estimation

78% match2023

Optimal Robust Estimation under Local and Global Corruptions: Stronger Adversary and Smaller Error

78% match2024

A Sub-Quadratic Time Algorithm for Robust Sparse Mean Estimation

77% match2024

Statistical Barriers to Affine-equivariant Estimation

76% match2023

Cite this paper

@article{abdalla2026robust,
  title  = {Robust Mean Estimation under Quantization},
  author = {Pedro Abdalla and Junren Chen},
  year   = {2026},
  eprint = {2601.07074},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.07074v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.07074.svg)](https://codeofpaper.com/paper/2601.07074)

Discussion