Efficient and fast estimation of the geometric median in Hilbert spaces with an averaged stochastic gradient algorithm

Abstract

With the progress of measurement apparatus and the development of automatic sensors it is not unusual anymore to get thousands of samples of observations taking values in high dimension spaces such as functional spaces. In such large samples of high dimensional data, outlying curves may not be uncommon and even a few individuals may corrupt simple statistical indicators such as the mean trajectory. We focus here on the estimation of the geometric median which is a direct generalization of the real median and has nice robustness properties. The geometric median being defined as the minimizer of a simple convex functional that is differentiable everywhere when the distribution has no atoms, it is possible to estimate it with online gradient algorithms. Such algorithms are very fast and can deal with large samples. Furthermore they also can be simply updated when the data arrive sequentially. We state the almost sure consistency and the L2 rates of convergence of the stochastic gradient estimator as well as the asymptotic normality of its averaged version. We get that the asymptotic distribution of the averaged version of the algorithm is the same as the classic estimators which are based on the minimization of the empirical loss function. The performances of our averaged sequential estimator, both in terms of computation speed and accuracy of the estimations, are evaluated with a small simulation study. Our approach is also illustrated on a sample of more 5000 individual television audiences measured every second over a period of 24 hours.

Cited by in corpus (11)

• Online estimation of the geometric median in Hilbert spaces : non asymptotic confidence balls
• Optimal non-asymptotic bound of the Ruppert-Polyak averaging without strong convexity
• Outlier Robust Online Learning
• Estimating the geometric median in Hilbert spaces with stochastic gradient algorithms: $L^p$ and almost sure rates of convergence
• A fully data-driven approach to minimizing CVaR for portfolio of assets via SGLD with discontinuous updating
• Convergence in quadratic mean of averaged stochastic gradient algorithms without strong convexity nor bounded gradient
• Large scale in transit computation of quantiles for ensemble runs
• Robust Extrinsic Regression Analysis for Manifold Valued Data
• Non asymptotic analysis of Adaptive stochastic gradient algorithms and applications
• Means in complete manifolds: uniqueness and approximation
• Online estimation of the inverse of the Hessian for stochastic optimization with application to universal stochastic Newton algorithms