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.

Download full-text PDF

Source
http://dx.doi.org/10.1109/TPAMI.2022.3147798DOI Listing

Publication Analysis

Top Keywords

pac-bayes meta-learning
8
meta-learning algorithm
8
meta-learning implicit
4
implicit task-specific
4
task-specific posteriors
4
posteriors introduce
4
introduce rigorously-formulated
4
rigorously-formulated pac-bayes
4
algorithm solves
4
solves few-shot
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!