Linear separation capacity of self-supervised representation learning
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 7306924 (Why is no real title available?)
- A Bernstein-type inequality for \(U\)-statistics and \(U\)-processes
- A graph discretization of the Laplace-Beltrami operator
- A unified algebraic approach to 2-D and 3-D motion segmentation and estimation
- Concentration inequalities. A nonasymptotic theory of independence
- Contrastive learning, multi-view redundancy, and linear models
- Diffusion \(K\)-means clustering on manifolds: provable exact recovery via semidefinite relaxations
- Diffusion maps
- Error estimates for spectral convergence of the graph Laplacian on random geometric graphs toward the Laplace-Beltrami operator
- Improved spectral convergence rates for graph Laplacians on \(\varepsilon \)-graphs and \(k\)-NN graphs
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Learning the geometry of common latent variables using alternating-diffusion
- Nonparametric estimation of a probability density on a Riemannian manifold using Fourier expansions
- Random Geometric Graphs
- Reconstruction and estimation in the planted partition model
- Self-supervised Metric Learning in Multi-View Data: A Downstream Task Perspective
- Spectral clustering based on local PCA
- The Elements of Statistical Learning
- The implicit bias of gradient descent on separable data
This page was built for publication: Linear separation capacity of self-supervised representation learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6887332)
