Scalability and robustness of spectral embedding: landmark diffusion is all you need
Chao Shen, Hau-Tieng Wu

TL;DR
This paper introduces Roseland, a scalable and robust spectral embedding method using landmark diffusion, with theoretical guarantees and noise robustness, suitable for large and noisy datasets.
Contribution
The paper provides a theoretical analysis of Roseland's asymptotic behavior, convergence rates, and robustness, extending spectral embedding to large-scale, noisy data.
Findings
Roseland is numerically scalable for big data.
It preserves geometric properties via diffusion on manifolds.
Roseland is robust to high-dimensional noise.
Abstract
While spectral embedding is a widely applied dimension reduction technique in various fields, so far it is still challenging to make it scalable to handle ``big data''. On the other hand, the robustness property is less explored and there exists only limited theoretical results. Motivated by the need of handling such data, recently we proposed a novel spectral embedding algorithm, which we coined Robust and Scalable Embedding via Landmark Diffusion (ROSELAND). In short, we measure the affinity between two points via a set of landmarks, which is composed of a small number of points, and ``diffuse'' on the dataset via the landmark set to achieve a spectral embedding. Roseland can be viewed as a generalization of the commonly applied spectral embedding algorithm, the diffusion map (DM), in the sense that it shares various properties of DM. In this paper, we show that Roseland is not only…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Methods and Inference · Gaussian Processes and Bayesian Inference · Sparse and Compressive Sensing Techniques
