Fetching the paper…
Reading the bibliography…
Unsupervised learning aims to capture the underlying structure of potentially large and high-dimensional datasets.
The approximation of one matrix by another of lower rank
C. Eckart and G. Young · 1936
Earlier work this paper cites.
Tres observaciones sobre el algebra lineal
G. Birkhoff · 1946
Earlier work this paper cites.
Concerning nonnegative matrices and doubly stochastic matrices
R. Sinkhorn and P. Knopp · 1967
Earlier work this paper cites.
A cutting plane algorithm for solving bilinear programs
H. Konno · 1976
Earlier work this paper cites.
Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
P. J. Rousseeuw · 1987
Earlier work this paper cites.
Columbia object image library (coil-20)
S. A. Nene, S. K. Nayar, H. Murase, et al · 1996
Earlier work this paper cites.
Kernel principal component analysis
B. Schölkopf, A. Smola, and K.-R. Müller · 1997
Earlier work this paper cites.
On the convergence of the block nonlinear gauss–seidel method under convex constraints
L. Grippo and M. Sciandrone · 2000
Earlier work this paper cites.
Nonlinear dimensionality reduction by locally linear embedding
S. T. Roweis and L. K. Saul · 2000
Earlier work this paper cites.
A global geometric framework for nonlinear dimensionality reduction
J. B. Tenenbaum, V. d. Silva, and J. C. Langford · 2000
Earlier work this paper cites.
Convergence of a block coordinate descent method for nondifferentiable minimization
P. Tseng · 2001
Earlier work this paper cites.
Stochastic neighbor embedding
G. E. Hinton and S. Roweis · 2002
Earlier work this paper cites.
Laplacian eigenmaps for dimensionality reduction and data representation
M. Belkin and P. Niyogi · 2003
Earlier work this paper cites.
An optimization algorithm for clustering using weighted dissimilarity measures
E. Y. Chan, W. K. Ching, M. K. Ng, and J. Z. Huang · 2004
Earlier work this paper cites.
Kernel k-means: spectral clustering and normalized cuts
I. S. Dhillon, Y. Guan, and B. Kulis · 2004
Earlier work this paper cites.
A kernel view of the dimensionality reduction of manifolds
J. Ham, D. D. Lee, S. Mika, and B. Schölkopf · 2004
Earlier work this paper cites.
Modern multidimensional scaling: Theory and applications
I. Borg and P. J. Groenen · 2005
Earlier work this paper cites.
Infinitely divisible matrices
R. Bhatia · 2006
Earlier work this paper cites.
Pattern recognition and machine learning
C. M. Bishop · 2006
Earlier work this paper cites.
Diffusion maps
R. R. Coifman and S. Lafon · 2006
Earlier work this paper cites.
Weighted graph cuts without eigenvectors a multilevel approach
I. S. Dhillon, Y. Guan, and B. Kulis · 2007
Earlier work this paper cites.
Nonlinear dimensionality reduction , volume 1
J. A. Lee, M. Verleysen, et al · 2007
Earlier work this paper cites.
V-measure: A conditional entropy-based external cluster evaluation measure
A. Rosenberg and J. Hirschberg · 2007
Earlier work this paper cites.
Graph clustering
S. E. Schaeffer · 2007
Earlier work this paper cites.
A tutorial on spectral clustering
U. Von Luxburg · 2007
Earlier work this paper cites.
Visualizing data using t-sne
L. Van der Maaten and G. Hinton · 2008
Earlier work this paper cites.
Unsupervised Learning
T. Hastie, R. Tibshirani, and J. Friedman · 2009
Earlier work this paper cites.
Dimensionality reduction: a comparative
L. Van Der Maaten, E. Postma, J. Van den Herik, et al · 2009
Earlier work this paper cites.
Optimal transport: old and new , volume 338
C. Villani et al · 2009
Earlier work this paper cites.
Torchvision the machine-vision package of torch
S. Marcel and Y. Rodriguez · 2010
Earlier work this paper cites.
Gromov–wasserstein distances and the metric approach to object matching
F. Mémoli · 2011
Earlier work this paper cites.
Scikit-learn: Machine learning in python
F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, et al · 2011
Cited alongside, same era.
Learning probability measures with respect to optimal transport metrics
G. Canas and L. Rosasco · 2012
Cited alongside, same era.
The space of spaces: curvature bounds and gradient flows on the space of metric measure spaces
K.-T. Sturm · 2012
Cited alongside, same era.
The quadratic assignment problem: theory and algorithms , volume 1
E. Cela · 2013
Cited alongside, same era.
Sidus—the solution for extreme deduplication of an operating system
E. Quemener and M. Corvellec · 2013
Cited alongside, same era.
Entropic affinities: Properties and efficient numerical computation
A comparison of single-cell trajectory inference methods
W. Saelens, R. Cannoodt, H. Todorov, and Y. Saeys · 2019
Later among the works it cites.
Scalable gromov-wasserstein learning for graph partitioning and matching
H. Xu, D. Luo, and L. Carin · 2019
Later among the works it cites.
Gromov-wasserstein optimal transport to align single-cell multi-omics data
P. Demetci, R. Santorella, B. Sandstede, W. S. Noble, and R. Singh · 2020
Later among the works it cites.
Geoopt: Riemannian optimization in pytorch, 2020
M. Kochurov, R. Karimov, and S. Kozlukov · 2020
Later among the works it cites.
Co-optimal transport
I. Redko, T. Vayer, R. Flamary, and N. Courty · 2020
Later among the works it cites.
Gromov-wasserstein factorization models for graph clustering
H. Xu · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
M. Vladymyrov and M. Carreira-Perpinan · 2013
Cited alongside, same era.
Adam: A method for stochastic optimization
D. P. Kingma and J. Ba · 2014
Cited alongside, same era.
Cell types in the mouse cortex and hippocampus revealed by single-cell rna-seq
A. Zeisel, A. B. Muñoz-Manchado, S. Codeluppi, P. Lönnerberg, G. La Manno, A. Juréus, S. Marques, H. Munguba, L. He, C. Betsholtz, et al · 2015
Cited alongside, same era.
Convergence rate of frank-wolfe for non-convex objectives
S. Lacoste-Julien · 2016
Cited alongside, same era.
Gromov-wasserstein averaging of kernel and distance matrices
G. Peyré, M. Cuturi, and J. Solomon · 2016
Cited alongside, same era.
Entropic metric alignment for correspondence problems
J. Solomon, G. Peyré, V. G. Kim, and S. Sra · 2016
Cited alongside, same era.
Gwcnn: A metric alignment layer for deep shape analysis
D. Ezuz, J. Solomon, V. G. Kim, and M. Ben-Chen · 2017
Cited alongside, same era.
Geometric deep learning: Grids, groups, graphs, geodesics, and gauges
M. M. Bronstein, J. Bruna, T. Cohen, and P. Veličković · 2021
Later among the works it cites.
Horopca: Hyperbolic dimensionality reduction via horospherical projections
I. Chami, A. Gu, D. Nguyen, and C. Ré · 2021
Later among the works it cites.
Generalized spectral clustering via gromov-wasserstein learning
S. Chowdhury and T. Needham · 2021
Later among the works it cites.
Pot: Python optimal transport
R. Flamary, N. Courty, A. Gramfort, M. Z. Alaya, A. Boisbunon, S. Chambon, L. Chapel, A. Corenflos, K. Fatras, N. Fournier, et al · 2021
Later among the works it cites.
B. Ghojogh, A. Ghodsi, F. Karray, and M. Crowley · 2021
Later among the works it cites.
Exploring tissue architecture using spatial transcriptomics
A. Rao, D. Barkley, G. S. França, and I. Yanai · 2021
Later among the works it cites.
Online graph dictionary learning
C. Vincent-Cuaz, T. Vayer, R. Flamary, M. Corneli, and N. Courty · 2021
Later among the works it cites.
Centrosymmetric stochastic matrices
L. Cao, D. McLaren, and S. Plosker · 2022
Later among the works it cites.
Torchmetrics-measuring reproducibility in pytorch
N. S. Detlefsen, J. Borovec, J. Schock, A. H. Jha, T. Koker, L. Di Liello, D. Stancl, C. Quan, M. Grechkin, and W. Falcon · 2022
Later among the works it cites.
Nested hyperbolic spaces for dimensionality reduction and hyperbolic nn design
X. Fan, C.-H. Yang, and B. C. Vemuri · 2022
Later among the works it cites.
CO-SNE: Dimensionality reduction and visualization for hyperbolic data
Y. Guo, H. Guo, and S. X. Yu · 2022
Later among the works it cites.
Towards a comprehensive evaluation of dimension reduction methods for transcriptomic data visualization
H. Huang, Y. Wang, C. Rudin, and E. P. Browne · 2022
Later among the works it cites.
Comparison results for gromov-wasserstein and gromov-monge distances
F. Mémoli and T. Needham · 2022
Later among the works it cites.
Linear-time gromov wasserstein distances using low rank couplings and costs
M. Scetbon, G. Peyré, and M. Cuturi · 2022
Later among the works it cites.
Aligning individual brains with fused unbalanced gromov wasserstein
A. Thual, Q. H. TRAN, T. Zemskova, N. Courty, R. Flamary, S. Dehaene, and B. Thirion · 2022
Later among the works it cites.
A probabilistic graph coupling view of dimension reduction
H. Van Assel, T. Espinasse, J. Chiquet, and F. Picard · 2022
Later among the works it cites.
A gromov–wasserstein geometric view of spectrum-preserving graph coarsening
Y. Chen, R. Yao, Y. Yang, and J. Chen · 2023
Later among the works it cites.
Hyperbolic diffusion embedding and distance for hierarchical representation learning
Y.-W. E. Lin, R. R. Coifman, G. Mishne, and R. Talmon · 2023
Later among the works it cites.
Block majorization-minimization with diminishing radius for constrained nonconvex optimization
H. Lyu and Y. Li · 2023
Later among the works it cites.
SNEkhorn: Dimension reduction with symmetric entropic affinities
H. Van Assel, T. Vayer, R. Flamary, and N. Courty · 2023
Later among the works it cites.
Optimal transport for graph representation learning
C. Vincent-Cuaz · 2023
Later among the works it cites.
Generative graph dictionary learning
Z. Zeng, R. Zhu, Y. Xia, H. Zeng, and H. Tong · 2023
Later among the works it cites.
Generalized dimension reduction using semi-relaxed gromov-wasserstein distance
R. A. Clark, T. Needham, and T. Weighill · 2024
Closest in time.
On probabilistic embeddings in optimal dimension reduction
R. Murray and A. Pickarski · 2024
Closest in time.