The augmentation graph Laplacian converges pointwise and spectrally to a weighted Laplace-Beltrami operator, supporting a bounded-complexity neural approximation of optimal spectral contrastive embeddings.
Nonparametric regression on low- dimensional manifolds using deep relu networks: Function approximation and statistical recovery
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
baseline 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
baseline 1polarities
baseline 1representative citing papers
citing papers explorer
-
Consistency of augmentation graph and network approximability in contrastive learning
The augmentation graph Laplacian converges pointwise and spectrally to a weighted Laplace-Beltrami operator, supporting a bounded-complexity neural approximation of optimal spectral contrastive embeddings.