DAC-MR: Data Augmentation Consistency Based Meta-Regularization for Meta-Learning
Not on the map. Why?
Abstract (arXiv)
Meta learning recently has been heavily researched and helped advance the contemporary machine learning. However, achieving well-performing meta-learning model requires a large amount of training tasks with high-quality meta-data representing the underlying task generalization goal, which is sometimes difficult and expensive to obtain for real applications. Current meta-data-driven meta-learning approaches, however, are fairly hard to train satisfactory meta-models with imperfect training tasks. To address this issue, we suggest a meta-knowledge informed meta-learning (MKIML) framework to improve meta-learning by additionally integrating compensated meta-knowledge into meta-learning process. We preliminarily integrate meta-knowledge into meta-objective via using an appropriate meta-regularization (MR) objective to regularize capacity complexity of the meta-model function class to facilitate better generalization on unseen tasks. As a practical implementation, we introduce data augmentation consistency to encode invariance as meta-knowledge for instantiating MR objective, denoted by DAC-MR. The proposed DAC-MR is hopeful to learn well-performing meta-models from training tasks with noisy, sparse or unavailable meta-data. We theoretically demonstrate that DAC-MR can be treated as a proxy meta-objective used to evaluate meta-model without high-quality meta-data. Besides, meta-data-driven meta-loss objective combined with DAC-MR is capable of achieving better meta-level generalization. 10 meta-learning tasks with different network architectures and benchmarks substantiate the capability of our DAC-MR on aiding meta-model learning. Fine performance of DAC-MR are obtained across all settings, and are well-aligned with our theoretical insights. This implies that our DAC-MR is problem-agnostic, and hopeful to be readily applied to extensive meta-learning problems and tasks.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 146 of its 199 references that are in the map. First posted on arXiv 13 May 2023.
Builds on
146 of 199 references.
References · 146
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2015Rethinking the Inception Architecture for Computer Visioncited by 5,451
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
- 2015Domain-Adversarial Training of Neural Networkscited by 3,023
38 more
- 2017Prototypical Networks for Few-shot Learningcited by 3,001
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
- 2021Learning to Prompt for Vision-Language Modelscited by 2,269
- 2016Matching Networks for One Shot Learningcited by 2,246
- 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,080
- 2017Gradient Episodic Memory for Continual Learningcited by 1,871
- 2019Invariant Risk Minimizationcited by 1,832
- 2018DARTS: Differentiable Architecture Searchcited by 1,782
- 2013Fine-Grained Visual Classification of Aircraftcited by 1,701
- 2022Conditional Prompt Learning for Vision-Language Modelscited by 1,427
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
- 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,366
- 2014How transferable are features in deep neural networks?cited by 1,216
- 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,181
- 2016Group Equivariant Convolutional Networkscited by 1,154
- 2017Learning to Compare: Relation Network for Few-Shot Learningcited by 1,139
- 2019Unsupervised Data Augmentation for Consistency Trainingcited by 1,057
- 2016Temporal Ensembling for Semi-Supervised Learningcited by 1,054
- 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,053
- 2018Efficient Lifelong Learning with A-GEMcited by 1,044
- 2018Generalized Cross Entropy Loss for Training Deep Neural Networks with Noisy Labelscited by 994
- 2020Meta-Learning in Neural Networks: A Surveycited by 944
- 2017Virtual Adversarial Training: A Regularization Method for Supervised and Semi-Supervised Learningcited by 918
- 2017Learning to Generalize: Meta-Learning for Domain Generalizationcited by 762
- 2018AutoAugment: Learning Augmentation Policies from Datacited by 728
- 2020DivideMix: Learning with Noisy Labels as Semi-supervised Learningcited by 691
- 2019A Closer Look at Few-shot Classificationcited by 679
- 2018Learning to Reweight Examples for Robust Deep Learningcited by 670
- 2016Making Deep Neural Networks Robust to Label Noise: a Loss Correction Approachcited by 663
- 2017MentorNet: Learning Data-Driven Curriculum for Very Deep Neural Networks on Corrupted Labelscited by 652
- 2016Learning to learn by gradient descent by gradient descentcited by 616
- 2018Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interferencecited by 511
- 2016RL2: Fast Reinforcement Learning via Slow Reinforcement Learningcited by 490
- 2019Meta-Learning with Differentiable Convex Optimizationcited by 461
- 2018Meta-Learning for Semi-Supervised Few-Shot Classificationcited by 456
- 2017VisDA: The Visual Domain Adaptation Challengecited by 432
- 2020Improving robustness against common corruptions by covariate shift adaptationcited by 427
- 2019Unlabeled Data Improves Adversarial Robustnesscited by 415
50 most cited of 146 All 146 (JSON)
Built on by
Citing papers per year: 2024: 3; 2025: 0; 2026: 1.
4 papers.
- 2024Are Dense Labels Always Necessary for 3D Object Detection from Point Cloud?cited by 2
- 2024Data augmentation with automated machine learning: approaches and performance comparison with classical data augmentation methodscited by 1
- 2024Meta-Task: A Method-Agnostic Framework for Learning to Regularize in Few-Shot Learningcited by 0
- 2026Metadata-Free Meta-Reweighted Direct Preference Optimization under Noisy Preference Labelscited by 0
- 2026Metadata-Free Meta-Reweighted Direct Preference Optimization under Noisy Preference Labels9 Jul 2026
- 2024Data augmentation with automated machine learning: approaches and performance comparison with classical data augmentation methods13 Mar 2024
- 2024Are Dense Labels Always Necessary for 3D Object Detection from Point Cloud?5 Mar 2024
- 2024Meta-Task: A Method-Agnostic Framework for Learning to Regularize in Few-Shot Learning27 Feb 2024