Tukey Depths and Hamilton-Jacobi Differential Equations
Not on the map. Why?
Abstract (arXiv)
The widespread application of modern machine learning has increased the need for robust statistical algorithms. This work studies one such fundamental statistical measure known as the Tukey depth. We study the problem in the continuum (population) limit. In particular, we derive the associated necessary conditions, which take the form of a first-order partial differential equation. We discuss the classical interpretation of this necessary condition as the viscosity solution of a Hamilton-Jacobi equation, but with a non-classical Hamiltonian with discontinuous dependence on the gradient at zero. We prove that this equation possesses a unique viscosity solution and that this solution always bounds the Tukey depth from below. In certain cases, we prove that the Tukey depth is equal to the viscosity solution, and we give some illustrations of standard numerical methods from the optimal control community which deal directly with the partial differential equation. We conclude by outlining several promising research directions both in terms of new numerical algorithms and theoretical challenges.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 5 of its 48 references that are in the map. First posted on arXiv 4 Apr 2021.
Builds on
5 of 48 references.
References · 5
- 2014Exact computation of the halfspace depthcited by 11
- 2018The limit shape of convex hull peelingcited by 6
- 2018Data depth and floating bodycited by 4
- 2013A Hamilton-Jacobi equation for the continuum limit of non-dominated sortingcited by 3
- 2018Approximate Calculation of Tukey's Depth and Median With High-dimensional Datacited by 1
Built on by
Citing papers per year: 2022: 2; 2023: 0; 2024: 1.
3 papers.
- 2022Hamilton-Jacobi equations on graphs with applications to semi-supervised learning and data depthcited by 7
- 2022Eikonal depth: an optimal control approach to statistical depthscited by 1
- 2024A Learned Generalized Geodesic Distance Function-Based Approach for Node Feature Augmentation on Graphscited by 1
- 2024A Learned Generalized Geodesic Distance Function-Based Approach for Node Feature Augmentation on Graphs1 Jul 2024
- 2022Hamilton-Jacobi equations on graphs with applications to semi-supervised learning and data depth17 Feb 2022
- 2022Eikonal depth: an optimal control approach to statistical depths14 Jan 2022