atlas

Research map / Learning theory and algorithms / Kernels and regression theory

Fast-Rate PAC-Bayesian Generalization Bounds for Meta-Learning

ICML 2022 · Learning theory and algorithms › Kernels and regression theory · approach: PAC-Bayes bounds

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Minimize Catoni-bound (Gibbs-style meta objective) instead of kl-bound for classificationmeta-learning classification with MLP · Pixel-shuffled MNIST (100/200/300 swaps)test bound and test errorHelped
Minimize kl-bound (fast-rate) meta objective vs. prior PAC-Bayes meta methodsmeta-learning classification with MLP · Pixel-shuffled MNIST 100 swapstest boundMixed
Gibbs optimal hyper-posterior (Catoni-bound closed form) for regressionregression with Bayesian NN · 5 regression environments (RMSE)RMSEMixed
Catoni-bound vs kl-bound in classification convergence (ablation)meta-learning classification · Pixel-shuffled MNIST convergencetest bound and test errorHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy