🤖 AI Summary
This work addresses the challenge of instability in empirical spatial distribution functions and plug-in spatial depth estimators in high-dimensional statistics, where consistency typically depends on dimensionality or tuning parameters. By leveraging probabilistic and high-dimensional statistical analysis, the study establishes, for the first time, a uniform $L^1$ consistency theory that is independent of the ambient dimension $d$ and requires no tuning parameters. The derived consistency bound depends solely on the sample size $n$, thereby guaranteeing uniform convergence across arbitrary dimensions. This result overcomes the longstanding reliance of conventional methods on both dimensionality and parameter selection, significantly enhancing the robustness and applicability of spatial depth estimation in high-dimensional settings.
📝 Abstract
We provide a proof that the empirical spatial distribution estimator in $\mathbb R^d$ as well as the corresponding plug-in estimator of the spatial depth are uniformly $L^1$-consistent. The consistency rate only depends on the sample size $n$, not on the dimension $d$ or any tuning or regularization parameters. This is a rare property. The result of this note originates from a conversation with ChatGPT 5.4 Pro as part of some of our own earlier experiments on its mathematical reasoning capabilities.