arXiv:2608.05112stat.MLcs.LG2026-08

提出稳定脊线新定义,解决传统SCMS算法收敛失效问题。

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

论文配图:Stable Density Ridges: Consistency and Convergence of Subspace Constrained Mean Shift
图 1 · 摘自论文原文
  • 用动力系统视角重定义密度脊线,突破静态梯度约束
  • 证明新结构为SCMS真实收敛目标,且可实现线性收敛
  • 改进算法效率,摆脱步长与带宽耦合,适合高维数据

Subspace Constrained Mean Shift (SCMS) 是一种流行的非参数方法,用于提取密度脊线,作为高维数据的低维表示。学术界普遍认为SCMS轨迹会收敛到经典密度脊线(称为“静态脊线”),该定义基于密度梯度及海森矩阵的特征值和特征向量。本文证明这一假设在一般情况下不成立,因为静态定义忽略了算法矢量场连续流动中尾部特征空间的旋转。为此,我们提出范式转变,引入“稳定脊线”——一种通过动力系统和投影密度梯度雅可比矩阵定义的新几何结构。我们证明稳定脊线是SCMS算法的真实理论目标。在此基础上,我们构建了使用固定步长的广义SCMS框架,建立了其一致R-线性收敛性及拓扑满射性,并推导了以豪斯多夫距离衡量的稳定脊线估计收敛速率。最后,我们揭示原SCMS算法存在多项式时间复杂度,源于步长与平滑带宽通过均值漂移算子隐式耦合,并证明我们的广义框架提供了统计一致且更高效的解决方案。

原文摘要 · Abstract (English)

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.

密度脊线非参数统计优化收敛高维数据分析

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。