PAC-Bayes meta-learning with implicit task-specific posteriors
Not on the map. Why?
Abstract (arXiv)
We introduce a new and rigorously-formulated PAC-Bayes meta-learning algorithm that solves few-shot learning. Our proposed method extends the PAC-Bayes framework from a single task setting to the meta-learning multiple task setting to upper-bound the error evaluated on any, even unseen, tasks and samples. We also propose a generative-based approach to estimate the posterior of task-specific model parameters more expressively compared to the usual assumption based on a multivariate normal distribution with a diagonal covariance matrix. We show that the models trained with our proposed meta-learning algorithm are well calibrated and accurate, with state-of-the-art calibration and classification results on few-shot classification (mini-ImageNet and tiered-ImageNet) and regression (multi-modal task-distribution regression) benchmarks.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 5 Mar 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 0; 2024: 1; 2025: 1.
4 papers.
- 2024More Flexible PAC-Bayesian Meta-Learning by Learning Learning Algorithmscited by 11
- 2021Learning an Explicit Hyperparameter Prediction Function Conditioned on Taskscited by 9
- 2022Streaming PAC-Bayes Gaussian process regression with a performance guarantee for online decision makingcited by 0
- 2025BATR-FST: Bi-Level Adaptive Token Refinement for Few-Shot Transformerscited by 0
- 2025BATR-FST: Bi-Level Adaptive Token Refinement for Few-Shot Transformers16 Sep 2025
- 2024More Flexible PAC-Bayesian Meta-Learning by Learning Learning Algorithms6 Feb 2024
- 2022Streaming PAC-Bayes Gaussian process regression with a performance guarantee for online decision making16 Oct 2022
- 2021Learning an Explicit Hyperparameter Prediction Function Conditioned on Tasks6 Jul 2021