Computing the Depth of a Flat
Abstract
We give algorithms for computing the regression depth of a k-flat for a set of n points in Rd. The running time is O(n(d-2) + n log n) when 0 < k < d-1, faster than the best time bound for hyperplane regression or for data depth.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.