arXiv (Cornell University) · 2020 · 82 citations · 33 references
Open access
ComputingComputer ScienceArtificial IntelligenceFeature EngineeringMachine LearningDeep LearningMutual InformationNeural NetworksRepresentation LearningSelf-supervised LearningUnsupervised LearningDeep Metric LearningEntangled StatesInductive BiasInvertible TransformationsMulti-view Representation LearningMutual Information EstimationRepresentation Learning TheorySelf-supervised Representation Learning
Many recent methods for unsupervised or self-supervised representation learning train feature extractors by maximizing an estimate of the mutual information (MI) between different views of the data. This comes with several immediate problems: For example, MI is notoriously hard to estimate, and using it as an objective for representation learning may lead to highly entangled representations due to its invariance under arbitrary invertible transformations. Nevertheless, these methods have been repeatedly shown to excel in practice. In this paper we argue, and provide empirical evidence, that the success of these methods cannot be attributed to the properties of MI alone, and that they strongly depend on the inductive bias in both the choice of feature extractor architectures and the parametrization of the employed MI estimators. Finally, we establish a connection to deep metric learning and argue that this interpretation may be a plausible explanation for the success of the recently introduced methods.
33
Scikit-learn: Machine Learning in Python
Fabián Pedregosa, Gaël Varoquaux, Alexandre Gramfort et al. · arXiv (Cornell University) · 2012 · 63.7K citations · Full text
Auto-Encoding Variational Bayes
Diederik P. Kingma, Max Welling · UvA-DARE (University of Amsterdam) · 2013 · 15.6K citations · Full text
Alexander Kraskov, Harald Stögbauer, Peter Grassberger · Physical Review E · 2004 · 4.1K citations · Full text