arXiv Machine Learning August 6, 2026 By Wanli Qiao

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

Read the original on arXiv Machine Learning →

arXiv:2608. 05112v1 Announce Type: cross 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.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

arXiv Machine Learning

2d ago

High-dimensional nonparametric changepoint detection via low-rank degree-two density projection

arXiv:2608. 13922v1 Announce Type: new Abstract: Detecting distributional changes in high dimension is difficult when neither the pre-change nor post-change density is parametrically specified.

By Guoqing Zhang, Zhaixin Chen

efficiency benchmarks

arXiv Machine Learning

Jun 30

Robust Tangent Space Estimation via Laplacian Eigenvector Gradient Orthogonalization

arXiv:2510. 02308v2 Announce Type: replace Abstract: Estimating the tangent spaces of a data manifold is a fundamental problem in geometric data analysis.

By Dhruv Kohli, Sawyer J. Robertson, Gal Mishne, Alexander Cloninger

arXiv Machine Learning

Jul 24

Regularized Optimization on Grassmann Manifold: Theory, Algorithm and Applications

arXiv:2607. 21039v1 Announce Type: new Abstract: Spectral methods are among the most widely used techniques for community detection, clustering, and graph learning.

By Zhuan Liang, Zheng Zhai

arXiv Machine Learning

Jul 9

Optimization Geometrodynamics: A Framework for Dynamic Geometric Optimization

arXiv:2607. 06723v1 Announce Type: cross Abstract: Most gradient-based optimization methods move parameters through a fixed background geometry, even when their internal states implicitly define changing notions of length, curvature, and preconditioning.

By Zavier Li

benchmarks

arXiv Machine Learning

Jun 24

Exact Schur-Sylvester Dimensionality Reductions for Non-Smooth Stochastic Complexity and Manifold Sampling

arXiv:2606. 23867v1 Announce Type: new Abstract: The exact computation of the Normalized Maximum Likelihood (NML) codelength for regular non-smooth estimators (e.

By Trenton Lau, Gary P. T. Choi

benchmarks

arXiv Machine Learning

5d ago

Manifold constrained steepest descent for smooth and closed-set optimization

arXiv:2601. 21487v2 Announce Type: replace-cross Abstract: We study minimization of smooth functions over feasible sets that have smooth embedded-manifold structure throughout or only on selected regions, using linear minimization oracles (LMOs) to determine search directions under user-chosen norms.

By Kaiwei Yang, Lexiao Lai

Related stories

High-dimensional nonparametric changepoint detection via low-rank degree-two density projection

Robust Tangent Space Estimation via Laplacian Eigenvector Gradient Orthogonalization

Regularized Optimization on Grassmann Manifold: Theory, Algorithm and Applications

Optimization Geometrodynamics: A Framework for Dynamic Geometric Optimization

Exact Schur-Sylvester Dimensionality Reductions for Non-Smooth Stochastic Complexity and Manifold Sampling

Manifold constrained steepest descent for smooth and closed-set optimization