mlsanityData to 7 Oct 2026

For Manifold Learning, Deep Neural Networks can be Locality Sensitive Hash Functions

arXiv 2103.06875 ↗First posted 11 Mar 2021cs.LGcited by 6

Not on the map. Why?

Abstract (arXiv)

It is well established that training deep neural networks gives useful representations that capture essential features of the inputs. However, these representations are poorly understood in theory and practice. In the context of supervised learning an important question is whether these representations capture features informative for classification, while filtering out non-informative noisy ones. We explore a formalization of this question by considering a generative process where each class is associated with a high-dimensional manifold and different classes define different manifolds. Under this model, each input is produced using two latent vectors: (i) a "manifold identifier" γ and; (ii)~a "transformation parameter" θ that shifts examples along the surface of a manifold. E.g., γ might represent a canonical image of a dog, and θ might stand for variations in pose, background or lighting. We provide theoretical and empirical evidence that neural representations can be viewed as LSH-like functions that map each input to an embedding that is a function of solely the informative γ and invariant to θ, effectively recovering the manifold identifier γ. An important consequence of this behavior is one-shot learning to unseen classes.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 20 of its 39 references that are in the map. First posted on arXiv 11 Mar 2021.

Builds on

20 of 39 references.

References · 20

  1. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  2. 2019Invariant Risk Minimizationcited by 1,832
  3. 2017Learning to Compare: Relation Network for Few-Shot Learningcited by 1,139
  4. 2014Convex Optimization: Algorithms and Complexitycited by 569
  5. 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 562
  6. 2019A Theoretical Analysis of Contrastive Unsupervised Representation Learningcited by 530
  7. 2018Learning and Generalization in Overparameterized Neural Networks, Going Beyond Two Layerscited by 340
  8. 2017Implicit Regularization in Matrix Factorizationcited by 318
  9. 2014Discriminative Unsupervised Feature Learning with Exemplar Convolutional Neural Networkscited by 299
  10. 2015Escaping From Saddle Points --- Online Stochastic Gradient for Tensor Decompositioncited by 241
  11. 2016Deep Learning without Poor Local Minimacited by 233
  12. 2020Few-Shot Learning via Learning the Representation, Provablycited by 213
8 more
  1. 2015The Benefit of Multitask Representation Learningcited by 194
  2. 2020On the Theory of Transfer Learning: The Importance of Task Diversitycited by 186
  3. 2016Toward Deeper Understanding of Neural Networks: The Power of Initialization and a Dual View on Expressivitycited by 138
  4. 2016Matrix Completion has No Spurious Local Minimumcited by 124
  5. 2016A Survey on Learning to Hashcited by 119
  6. 2017Accelerated Gradient Descent Escapes Saddle Points Faster than Gradient Descentcited by 66
  7. 2014Hashing for Similarity Search: A Surveycited by 34
  8. 2021Neural networks behave as hash encoders: An empirical studycited by 3

Built on by

Cited by year

Citing papers per year: 2022: 2; 2023: 2; 2024: 2.

6 papers.