Learning to Transfer with von Neumann Conditional Divergence
Not on the map. Why?
Abstract (arXiv)
The similarity of feature representations plays a pivotal role in the success of problems related to domain adaptation. Feature similarity includes both the invariance of marginal distributions and the closeness of conditional distributions given the desired response y (e.g., class labels). Unfortunately, traditional methods always learn such features without fully taking into consideration the information in y, which in turn may lead to a mismatch of the conditional distributions or the mix-up of discriminative structures underlying data distributions. In this work, we introduce the recently proposed von Neumann conditional divergence to improve the transferability across multiple domains. We show that this new divergence is differentiable and eligible to easily quantify the functional dependence between features and y. Given multiple source tasks, we integrate this divergence to capture discriminative information in y and design novel learning objectives assuming those source tasks are observed either simultaneously or sequentially. In both scenarios, we obtain favorable performance against state-of-the-art methods in terms of smaller generalization error on new tasks and less catastrophic forgetting on source tasks (in the sequential setup).
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 32 of its 76 references that are in the map. First posted on arXiv 7 Aug 2021.
Builds on
32 of 76 references.
References · 32
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2015Domain-Adversarial Training of Neural Networkscited by 3,023
- 2016Matching Networks for One Shot Learningcited by 2,246
- 2017Gradient Episodic Memory for Continual Learningcited by 1,871
- 2018Continual Lifelong Learning with Neural Networks: A Reviewcited by 1,313
- 2014How transferable are features in deep neural networks?cited by 1,216
- 2018Efficient Lifelong Learning with A-GEMcited by 1,044
- 2016Deep Variational Information Bottleneckcited by 915
- 2016Stacked Hourglass Networks for Human Pose Estimationcited by 913
- 2018Riemannian Walk for Incremental Learning: Understanding Forgetting and Intransigencecited by 734
20 more
- 2018Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interferencecited by 511
- 2013DeCAF: A Deep Convolutional Activation Feature for Generic Visual Recognitioncited by 422
- 2019Semi-supervised Domain Adaptation via Minimax Entropycited by 333
- 2018Multi-Adversarial Domain Adaptationcited by 195
- 2017Central Moment Discrepancy (CMD) for Domain-Invariant Representation Learningcited by 192
- 2020Anatomy of Catastrophic Forgetting: Hidden Representations and Task Semanticscited by 158
- 2016Information Dropout: Learning Optimal Representations Through Noisy Computationcited by 131
- 2018Rotate your Networks: Better Weight Consolidation and Less Catastrophic Forgettingcited by 127
- 2020Efficient Continual Learning with Modular Networks and Task-Driven Priorscited by 87
- 2020A Measure-Theoretic Approach to Kernel Conditional Mean Embeddingscited by 86
- 2017Nonlinear Information Bottleneckcited by 71
- 2018Learning Representations for Neural Network-Based Classification Using the Information Bottleneck Principlecited by 70
- 2020Multi-source Domain Adaptation in the Deep Learning Era: A Systematic Surveycited by 47
- 2019Domain Aggregation Networks for Multi-Source Domain Adaptationcited by 37
- 2019Robust Learning with the Hilbert-Schmidt Independence Criterioncited by 36
- 2016Conditional Generative Moment-Matching Networkscited by 24
- 2017Modular Representation of Layered Neural Networkscited by 12
- 2020Modularizing Deep Learning via Pairwise Learning With Kernelscited by 7
- 2019Constructing the Matrix Multilayer Perceptron and its Application to the VAEcited by 2
- 2018Learning Short-Cut Connections for Object Countingcited by 1
Built on by
Citing papers per year: 2022: 1.
1 paper.
- 2022Multi-Source Survival Domain Adaptationcited by 1
- 2022Multi-Source Survival Domain Adaptation1 Dec 2022