atlas

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

Information-theoretic generalization bounds for black-box learning algorithms

NeurIPS 2021 · Learning theory and algorithms › Kernels and regression theory · approach: Information-theoretic generalization bounds · 14 citations (OpenAlex)

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
Measure information in predictions rather than model weightsGeneralization bounds for neural networks · CIFAR-10, ResNet-50 fine-tuninggeneralization bound: 5% generalization gap; 16% f-CMI boundMixed
Measure information in predictions rather than weightsResNet-50 fine-tuned with SGLD · CIFAR-10 subset (n=20000), after one epochgeneralization bound: approximately 0.45 -> approximately 0.1Helped
Use the SGLD bound instead of the f-CMI boundResNet-50 fine-tuned with SGLD · CIFAR-10, through epoch 12generalization boundMixed
Use the f-CMI bound rather than the SGLD boundResNet-50 fine-tuned with SGLD · CIFAR-10, after epoch 16tracking of generalization gapHelped
Estimate the bound in early training epochsf-CMI bound · CIFAR-10 SGLD and MNIST 4 vs 9 deterministic CNNtightness to generalization gapHurt
Apply prediction-based f-CMI to deterministic trainingCNN on MNIST 4 vs 9 · MNIST 4 vs 9informativeness of generalization bound: 75 training examplesHelped

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