SearcharxivSearch

arXiv · 2310.13668

Variance Inequalities for Transformed Fr\'echet Means in Hadamard Spaces

Abstract

The Fr\'echet mean (or barycenter) generalizes the expectation of a random variable to metric spaces by minimizing the expected squared distance to the random variable. Similarly, the median can be generalized by its property of minimizing the expected absolute distance. We consider the class of transformed Fr\'echet means with nondecreasing, convex transformations that have a concave derivative. This class includes the Fr\'echet median, the Fr\'echet mean, the Huber loss-induced Fr\'echet mean, and other statistics related to robust statistics in metric spaces. We study variance inequalities for these transformed Fr\'echet means. These inequalities describe how the expected transformed distance grows when moving away from a minimizer, i.e., from a transformed Fr\'echet mean. Variance inequalities are useful in the theory of estimation and numerical approximation of transformed Fr\'echet means. Our focus is on variance inequalities in Hadamard spaces - metric spaces with globally nonpositive curvature. Notably, some results are new also for Euclidean spaces. Additionally, we are able to characterize uniqueness of transformed Fr\'echet means, in particular of the Fr\'echet median.

Explore related subjects

Keep this discovery

BibTeXRIS

Christof Schötz. 2023-10-20. Variance Inequalities for Transformed Fr\'echet Means in Hadamard Spaces. https://arxiv.org/abs/2310.13668

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR