PAC-Bayes Meta-Learning with Implicit Task-Specific Posteriors

9Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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 errors while still being competitive on classification results on few-shot classification (mini-ImageNet and tiered-ImageNet) and regression (multi-modal task-distribution regression) benchmarks.

Cite

CITATION STYLE

APA

Nguyen, C., Do, T. T., & Carneiro, G. (2023). PAC-Bayes Meta-Learning with Implicit Task-Specific Posteriors. IEEE Transactions on Pattern Analysis and Machine Intelligence, 45(1), 841–851. https://doi.org/10.1109/TPAMI.2022.3147798

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free