Skip to content

HOMER: Huber-of-Means for Efficient and Robust Estimation in Hilbert Spaces

Jul 2026 · arXiv.org · Vol abs/2607.27532 · 0 citations · 35 references
Mathematics Computer Science

TL;DR

A Hilbert-space majority theorem and a MOM-order deviation bound under a finite second moment are established and HOMER remains stable when a minority of block summaries is displaced.

Abstract

Heavy tails weaken high-confidence control for the empirical mean. Geometric median-of-means (MOM) also lacks a threshold that moves toward mean efficiency. We propose \emph{HOMER}, or Huber-of-Means for Efficient and Robust Estimation. HOMER aggregates block means through a radial Huber center. Its canonical and pseudo-Huber forms bound each block score and interpolate between median-like robustness and the empirical mean. We establish a Hilbert-space majority theorem and a MOM-order deviation bound under a finite second moment. Canonical HOMER recovers the sample mean inside its quadratic region. Pseudo-HOMER approaches the sample mean as the threshold grows. It also admits asymptotic linearity and consistent sandwich covariance estimation around the population block-Huber target. Under a finite third moment, fixed finite-dimensional projections support mean inference at the usual parametric rate. This result requires growing block sizes and counts, with block sizes increasing faster. Heavy-tailed simulations show that HOMER remains stable when a minority of block summaries is displaced. On clean Gaussian data, both versions closely approach the empirical mean's efficiency. Finite-block sandwich intervals undercovered, especially for skewed functional data. Further studies show failure when contamination affects most blocks or compromises ordinary within-block means.

View source

Similar papers

Open access Aug 2026

Projection-robust zeroth-order optimization on manifolds under heavy-tailed oracle noise

This work proposes PRISM-ZO, a projection-robust framework that samples low-dimensional random tangent subspaces and combines symmetric finite differences with median-of-means or Huber aggregation and establishes the unbiasedness of the correctly rescaled projected direction in expectation over the random subspace.

Yin-Pu Ma, Cunlin Li, Shiyue Zhang · 0 citations
Preprint Sep 2026

Robust dimension-free estimation of simple random tensors: optimal guarantees under heavy tails and adversarial contamination

We study robust estimation of simple random tensors of arbitrary order $q\in\mathbb{N}$ under finite-moment assumptions and adversarial contamination. We propose the first robust estimator achieving near-optimal dimension-free statistical rates in this setting. The estimator attains the near-optimal corruption rate whe...

R. Oliveira, Zoraida F. Rico, Philip Thompson · 0 citations
Preprint Sep 2026

Sieve Estimation of Optimal Transport Maps from Paired Data in Gaussian Spaces

We study the estimation of infinite-dimensional optimal transport maps from noisy paired observations. The population map pushes a Gaussian reference measure forward to a target probability measure on a function space and takes the Cameron--Martin gradient form $T=I+\nabla_{\mathcal H}\phi$. Our estimator uses cylindri...

Xin Jin, Kit Chan, Riddhi Ghosh · 0 citations
#machine learning Preprint Sep 2026

Restricted Eigenvalues Beyond Gaussian Width: Threshold Occupancy under Heavy Tails

Restricted eigenvalue (RE) bounds govern stable recovery by norm-regularized estimators. For isotropic sub-Gaussian measurements, the benchmark sample size is $1+w(A)^2$, where $w(A)$ is the Gaussian width of the normalized descent cone. The COLT 2015 open-problem note (Banerjee et al., 2015) asked whether the same law...

Shi Fu, Hui-Bo Xu, Qi-Xin Zhang et al. · 0 citations
#machine learning Preprint Sep 2026

Locally Private Inference for Riemannian Stochastic Optimization

We develop inference for manifold-valued population minimizers when each observation belongs to a different participant and only locally private messages reach the analyst. The method releases randomized tangent gradients and combines them through Riemannian stochastic approximation and Polyak-Ruppert averaging. Direct...

Xiao-Tian Chang, Yang-Di Jiang, Qi-Rui Hu · 0 citations
Preprint Aug 2026

Inference and Uncertainty Quantification for Streaming $r$-PCA

We address two open questions in streaming PCA via Oja's algorithm: sharp operator-norm convergence for general rank under sub-Gaussian data, and distributional inference for the resulting subspace estimator. Existing convergence analyses, even in the rank-one case, either assume bounded data or leave non-vanishing rem...

Haoshu Xu, Hongzhe Li · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.