Meta-Learning with Network Pruning
Not on the map. Why?
Abstract (arXiv)
Meta-learning is a powerful paradigm for few-shot learning. Although with remarkable success witnessed in many applications, the existing optimization based meta-learning models with over-parameterized neural networks have been evidenced to ovetfit on training tasks. To remedy this deficiency, we propose a network pruning based meta-learning approach for overfitting reduction via explicitly controlling the capacity of network. A uniform concentration analysis reveals the benefit of network capacity constraint for reducing generalization gap of the proposed meta-learner. We have implemented our approach on top of Reptile assembled with two network pruning routines: Dense-Sparse-Dense (DSD) and Iterative Hard Thresholding (IHT). Extensive experimental results on benchmark datasets with different over-parameterized deep networks demonstrate that our method not only effectively alleviates meta-overfitting but also in many cases improves the overall generalization performance when applied to few-shot classification tasks.
Key facts. Cited by 14 papers in the map (data through 14 Oct 2026). First posted on arXiv 7 Jul 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 4; 2023: 4; 2024: 2; 2025: 1.
14 papers.
Sort:
- 2021Meta-Learning Sparse Implicit Neural Representationscited by 48
- 2022Meta-Learning Sparse Compression Networkscited by 22
- 2021Sparse Progressive Distillation: Resolving Overfitting under Pretrain-and-Finetune Paradigmcited by 21
- 2022Stability and Risk Bounds of Iterative Hard Thresholdingcited by 7
- 2022Meta-ticket: Finding optimal subnetworks for few-shot learning within randomly initialized neural networkscited by 4
- 2022Dynamic Kernel Selection for Improved Generalization and Memory Efficiency in Meta-learningcited by 2
- 2023One-Shot Pruning for Fast-adapting Pre-trained Models on Devicescited by 1
- 2021B-SMALL: A Bayesian Neural Network approach to Sparse Model-Agnostic Meta-Learningcited by 0
- 2023Voting from Nearest Tasks: Meta-Vote Pruning of Pre-trained Models for Downstream Taskscited by 0
- 2023Learning to Learn with Indispensable Connectionscited by 0
- 2023Improving Generalization in Meta-Learning via Meta-Gradient Augmentationcited by 0
- 2024Perturbing the Gradient for Alleviating Meta Overfittingcited by 0
2 more
- 2025Learnable Loss Geometries with Mirror Descent for Scalable and Convergent Meta-Learning2 Sep 2025
- 2024Neuromodulated Meta-Learning11 Nov 2024
- 2024Perturbing the Gradient for Alleviating Meta Overfitting20 May 2024
- 2023One-Shot Pruning for Fast-adapting Pre-trained Models on Devices10 Jul 2023
- 2023Improving Generalization in Meta-Learning via Meta-Gradient Augmentation14 Jun 2023
- 2023Learning to Learn with Indispensable Connections6 Apr 2023
- 2023Voting from Nearest Tasks: Meta-Vote Pruning of Pre-trained Models for Downstream Tasks27 Jan 2023
- 2022Dynamic Kernel Selection for Improved Generalization and Memory Efficiency in Meta-learning3 Jun 2022
- 2022Meta-ticket: Finding optimal subnetworks for few-shot learning within randomly initialized neural networks31 May 2022
- 2022Meta-Learning Sparse Compression Networks18 May 2022
- 2022Stability and Risk Bounds of Iterative Hard Thresholding17 Mar 2022
- 2021Meta-Learning Sparse Implicit Neural Representations27 Oct 2021
- 2021Meta-Learning Sparse Implicit Neural Representationscited by 48
- 2022Meta-Learning Sparse Compression Networkscited by 22
- 2021Sparse Progressive Distillation: Resolving Overfitting under Pretrain-and-Finetune Paradigmcited by 21
- 2022Stability and Risk Bounds of Iterative Hard Thresholdingcited by 7
- 2022Meta-ticket: Finding optimal subnetworks for few-shot learning within randomly initialized neural networkscited by 4
- 2022Dynamic Kernel Selection for Improved Generalization and Memory Efficiency in Meta-learningcited by 2
- 2023One-Shot Pruning for Fast-adapting Pre-trained Models on Devicescited by 1
- 2021B-SMALL: A Bayesian Neural Network approach to Sparse Model-Agnostic Meta-Learningcited by 0
- 2023Voting from Nearest Tasks: Meta-Vote Pruning of Pre-trained Models for Downstream Taskscited by 0
- 2023Learning to Learn with Indispensable Connectionscited by 0
- 2023Improving Generalization in Meta-Learning via Meta-Gradient Augmentationcited by 0
- 2024Perturbing the Gradient for Alleviating Meta Overfittingcited by 0
12 most cited of 14 All 14 (JSON)
- 2025Learnable Loss Geometries with Mirror Descent for Scalable and Convergent Meta-Learning2 Sep 2025
- 2024Neuromodulated Meta-Learning11 Nov 2024
- 2024Perturbing the Gradient for Alleviating Meta Overfitting20 May 2024
- 2023One-Shot Pruning for Fast-adapting Pre-trained Models on Devices10 Jul 2023
- 2023Improving Generalization in Meta-Learning via Meta-Gradient Augmentation14 Jun 2023
- 2023Learning to Learn with Indispensable Connections6 Apr 2023
- 2023Voting from Nearest Tasks: Meta-Vote Pruning of Pre-trained Models for Downstream Tasks27 Jan 2023
- 2022Dynamic Kernel Selection for Improved Generalization and Memory Efficiency in Meta-learning3 Jun 2022
- 2022Meta-ticket: Finding optimal subnetworks for few-shot learning within randomly initialized neural networks31 May 2022
- 2022Meta-Learning Sparse Compression Networks18 May 2022
- 2022Stability and Risk Bounds of Iterative Hard Thresholding17 Mar 2022
- 2021Meta-Learning Sparse Implicit Neural Representations27 Oct 2021
12 newest of 14 All 14 (JSON)