Papers
Topics
Authors
Recent
Search
2000 character limit reached

Robust, sub-Gaussian mean estimators in metric spaces

Published 17 Sep 2025 in math.ST, math.PR, and stat.TH | (2509.13606v1)

Abstract: Estimating the mean of a random vector from i.i.d. data has received considerable attention, and the optimal accuracy one may achieve with a given confidence is fairly well understood by now. When the data take values in more general metric spaces, an appropriate extension of the notion of the mean is the Fr\'echet mean. While asymptotic properties of the most natural Fr\'echet mean estimator (the empirical Fr\'echet mean) have been thoroughly researched, non-asymptotic performance bounds have only been studied recently. The aim of this paper is to study the performance of estimators of the Fr\'echet mean in general metric spaces under possibly heavy-tailed and contaminated data. In such cases, the empirical Fr\'echet mean is a poor estimator. We propose a general estimator based on high-dimensional extensions of trimmed means and prove general performance bounds. Unlike all previously established bounds, ours generalize the optimal bounds known for Euclidean data. The main message of the bounds is that, much like in the Euclidean case, the optimal accuracy is governed by two "variance" terms: a "global variance" term that is independent of the prescribed confidence, and a potentially much smaller, confidence-dependent "local variance" term. We apply our results for metric spaces with curvature bounded from below, such as Wasserstein spaces, and for uniformly convex Banach spaces.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.