Dimension-free consistency of empirical spatial depth
Theorem 2.1. For a sample of iid random elements with values in , the empirical spatial distribution estimator and the plug-in spatial-depth estimator satisfy
Thus the expected uniform error is bounded by a rate depending only on , independently of the ambient dimension and without boundedness, moment, smoothness, tuning-parameter, or regularization assumptions, as stated in the source paper.
Progress summary
A 2026 preprint proves the desired consistency bound with a rate that does not worsen as the dimension grows.
The problem asks whether empirical spatial distribution and plug-in spatial-depth estimators converge uniformly in at a dimension-independent rate. A 2026 arXiv preprint gives an affirmative theorem for i.i.d. data in , and extends the argument to separable Hilbert spaces.
Known results
- The spatial distribution function originated with Chaudhuri (1996).
- Koltchinskii (1997, Theorem 2.5) proved that it uniquely characterizes the underlying probability measure.
- Spatial-depth foundations include Vardi and Zhang (2000), Serfling (2002), and Gao (2003).
- González-Sanz and Konen (2026) proved that spatial depth itself uniquely characterizes the underlying probability measure.
2026 dimension-free consistency theorem
The preprint proves , using a dimension-independent Rademacher bound. No boundedness, moment, smoothness, covering-number, packing-number, or compactness assumptions are required.
Current status (as of July 2026): The question is settled affirmatively by the arXiv proof, with rate independent of ; no remaining mathematical gap is reported.
Solutions 0
No solutions have been posted yet.