Web: http://arxiv.org/abs/2206.11386

June 24, 2022, 1:10 a.m. | Xiuyuan Cheng, Boris Landa

cs.LG updates on arXiv.org arxiv.org

Bi-stochastic normalization of kernelized graph affinity matrix provides an
alternative normalization scheme for graph Laplacian methods in graph-based
data analysis and can be computed efficiently by Sinkhorn-Knopp (SK) iterations
in practice. This paper proves the convergence of the bi-stochastically
normalized graph Laplacian to manifold (weighted-)Laplacian with rates when $n$
data points are i.i.d. sampled from a general $d$-dimensional manifold embedded
in a possibly high-dimensional space. Under certain joint limit of $n \to
\infty$ and kernel bandwidth $\epsilon \to 0$, the …

arxiv bi convergence graph manifold math noise robustness

More from arxiv.org / cs.LG updates on arXiv.org

Machine Learning Researcher - Saalfeld Lab

@ Howard Hughes Medical Institute - Chevy Chase, MD | Ashburn, Virginia

Project Director, Machine Learning in US Health

@ ideas42.org | Remote, US

Data Science Intern

@ NannyML | Remote

Machine Learning Engineer NLP/Speech

@ Play.ht | Remote

Research Scientist, 3D Reconstruction

@ Yembo | Remote, US

Clinical Assistant or Associate Professor of Management Science and Systems

@ University at Buffalo | Buffalo, NY