Stable Density Ridges: Consistency and Convergence of Subspace Constrained Mean Shift

2026-08-05 · 17:45 UTC ·Wanli Qiao ·1 min read

Brief

The paper studies density-ridge estimation via the Subspace Constrained Mean Shift (SCMS) algorithm and identifies a fundamental mismatch: SCMS follows a flow whose rotating trailing eigenspace makes the classical “static ridge” the wrong target. Qiao defines a dynamical-systems-based “stable ridge” (using the Jacobian of the projected density gradient), proves it is the algorithmic limit, proposes a constant-step-size SCMS with uniform R-linear convergence and surjectivity, derives Hausdorff convergence rates, and documents improved statistical and computational efficiency over the original SCMS.

Why it matters

Wanli Qiao (Aug 5, 2026) shows SCMS trajectories do not generally converge to the classical “static ridge”; instead they converge to a newly defined “stable ridge” (defined via dynamical-systems analysis and the Jacobian of the projected density gradient), and proves the stable ridge is the SCMS algorithm’s true theoretical target.

Key details

The paper introduces a generalized SCMS with a constant step size, proves uniform R-linear convergence and topological surjectivity onto the stable ridge, derives estimation rates in Hausdorff distance, and shows the original SCMS has polynomial-time complexity due to implicit coupling of step size to smoothing bandwidth—while the new framework is statistically consistent and more efficient.

Abstract

The Subspace Constrained Mean Shift (SCMS) algorithm is a popular nonparametric method for extracting density ridges, which serve as a low-dimensional representation of high-dimensional data. It is a widely held belief in the literature that SCMS trajectories converge to the classical density ridge, which we call the "static ridge", defined via the density gradient and the eigenvalues and eigenvectors of the density's Hessian. In this paper, we demonstrate that this assumption does not hold in general, as the static definition fails to account for the rotation of the trailing eigenspace along the continuous flow of the algorithm's underlying vector field. To resolve this, we propose a paradigm shift by introducing the "stable ridge", a novel geometric structure defined through the lens of dynamical systems and the Jacobian of the projected density gradient. We prove that this stable ridge is the true theoretical target of the SCMS algorithm. Building upon this foundation, we develop a generalized SCMS framework utilizing a constant step size, establishing its uniform R-linear convergence and topological surjectivity onto the stable ridge. We further derive the rates of convergence for estimating the stable ridge in terms of the Hausdorff distance. Finally, we expose that the original SCMS algorithm suffers from polynomial-time computational complexity, which is caused by implicitly coupling the step size to the smoothing bandwidth via the Mean Shift operator, and demonstrate how our generalized framework provides a statistically consistent and more efficient solution.

Comment: 40 pages, 5 figures