Computation of projection regression depth and its induced median

Abstract

Notions of depth in regression have been introduced and studied in the literature. The most famous example is Regression Depth (RD), which is a direct extension of location depth to regression. The projection regression depth (PRD) is the extension of another prevailing location depth, the projection depth, to regression. The computation issues of the RD have been discussed in the literature. The computation issues of the PRD and its induced median (maximum depth estimator) in a regression setting, never considered before, are addressed. For a given β∈Rp exact algorithms for the PRD with cost O(n2logn) (p=2) and O(N(n,p)(p3+nlogn+np1.5+npNIter)) (p>2) and approximate algorithms for the PRD and its induced median with cost respectively O(Nvnp) and O(RpNβ(p2+nNvNIter)) are proposed. Here N(n,p) is a number defined based on the total number of (p−1) dimensional hyperplanes formed by points induced from sample points and the β; Nv is the total number of unit directions v utilized; Nβ is the total number of candidate regression parameters β employed; NIter is the total number of iterations carried out in an optimization algorithm; R is the total number of replications. Furthermore, as the second major contribution, three PRD induced estimators, which can be computed up to 30 times faster than that of the PRD induced median while maintaining a similar level of accuracy are introduced. Examples and simulation studies reveal that the depth median induced from the PRD is favorable in terms of robustness and efficiency, compared to the maximum depth estimator induced from the RD, which is the current leading regression median.