Manifold learning: What, how, and why

M Meilă, H Zhang - Annual Review of Statistics and Its …, 2024 - annualreviews.org
Manifold learning (ML), also known as nonlinear dimension reduction, is a set of methods to
find the low-dimensional structure of data. Dimension reduction for large, high-dimensional …

The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains

DI Shuman, SK Narang, P Frossard… - IEEE signal …, 2013 - ieeexplore.ieee.org
In applications such as social, energy, transportation, sensor, and neuronal networks, high-
dimensional data naturally reside on the vertices of weighted graphs. The emerging field of …

Single-cell mapping of gene expression landscapes and lineage in the zebrafish embryo

DE Wagner, C Weinreb, ZM Collins, JA Briggs… - Science, 2018 - science.org
High-throughput mapping of cellular differentiation hierarchies from single-cell data
promises to empower systematic interrogations of vertebrate development and disease …

[图书][B] Handbook of cluster analysis

C Hennig, M Meila, F Murtagh, R Rocci - 2015 - books.google.com
This handbook provides a comprehensive and unified account of the main research
developments in cluster analysis. Written by active, distinguished researchers in this area …

Fundamental limits on dynamic inference from single-cell snapshots

C Weinreb, S Wolock, BK Tusi… - Proceedings of the …, 2018 - National Acad Sciences
Single-cell expression profiling reveals the molecular states of individual cells with
unprecedented detail. Because these methods destroy cells in the process of analysis, they …

Error estimates for spectral convergence of the graph Laplacian on random geometric graphs toward the Laplace–Beltrami operator

N García Trillos, M Gerlach, M Hein… - Foundations of …, 2020 - Springer
We study the convergence of the graph Laplacian of a random geometric graph generated
by an iid sample from am-dimensional submanifold MM in R^ d R d as the sample size n …

Graph Laplacian regularization for image denoising: Analysis in the continuous domain

J Pang, G Cheung - IEEE Transactions on Image Processing, 2017 - ieeexplore.ieee.org
Inverse imaging problems are inherently underdetermined, and hence, it is important to
employ appropriate image priors for regularization. One recent popular prior-the graph …

Sinkformers: Transformers with doubly stochastic attention

ME Sander, P Ablin, M Blondel… - … Conference on Artificial …, 2022 - proceedings.mlr.press
Attention based models such as Transformers involve pairwise interactions between data
points, modeled with a learnable attention matrix. Importantly, this attention matrix is …

Improved spectral convergence rates for graph Laplacians on ε-graphs and k-NN graphs

J Calder, NG Trillos - Applied and Computational Harmonic Analysis, 2022 - Elsevier
In this paper we improve the spectral convergence rates for graph-based approximations of
weighted Laplace-Beltrami operators constructed from random data. We utilize regularity of …

Analysis of -Laplacian Regularization in Semisupervised Learning

D Slepcev, M Thorpe - SIAM Journal on Mathematical Analysis, 2019 - SIAM
We investigate a family of regression problems in a semisupervised setting. The task is to
assign real-valued labels to a set of n sample points provided a small training subset of N …