Uniform convergence rates for the approximated halfspace and projection depth

10/14/2019
by   Stanislav Nagy, et al.
0

The computational complexity of some depths that satisfy the projection property, such as the halfspace depth or the projection depth, is known to be high, especially for data of higher dimensionality. In such scenarios, the exact depth is frequently approximated using a randomized approach: The data are projected into a finite number of directions uniformly distributed on the unit sphere, and the minimal depth of these univariate projections is used to approximate the true depth. We provide a theoretical background for this approximation procedure. Several uniform consistency results are established, and the corresponding uniform convergence rates are provided. For elliptically symmetric distributions and the halfspace depth it is shown that the obtained uniform convergence rates are sharp. In particular, guidelines for the choice of the number of random projections in order to achieve a given precision of the depths are stated.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/02/2020

On optimal convergence rates of spectral orthogonal projection approximation for functions of algbraic and logarithmatic regularities

Based on the Hilb type formula between Jacobi polynomials and Bessel fun...
research
07/15/2020

Approximate computation of projection depths

Data depth is a concept in multivariate statistics that measures the cen...
research
12/25/2017

Uniform Rates of Convergence of Some Representations of Extremes : a first approach

Uniform convergence rates are provided for asymptotic representations of...
research
11/07/2019

Optimal Projections in the Distance-Based Statistical Methods

This paper introduces a new way to calculate distance-based statistics, ...
research
06/02/2020

Convergence rates of spectral orthogonal projection approximation for functions of algebraic and logarithmatic regularities

Based on the Hilb type formula between Jacobi polynomials and Bessel fun...
research
04/04/2017

Finite Sample Analyses for TD(0) with Function Approximation

TD(0) is one of the most commonly used algorithms in reinforcement learn...
research
10/06/2017

Lattice Recurrent Unit: Improving Convergence and Statistical Efficiency for Sequence Modeling

Recurrent neural networks have shown remarkable success in modeling sequ...

Please sign up or login with your details

Forgot password? Click here to reset