atlas

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

Non-vacuous Generalization Bounds at the ImageNet Scale: a PAC-Bayesian Compression Approach

ICLR 2019 · Learning theory and algorithms › Kernels and regression theory · approach: Empirical generalization measures · 88 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
Use compression length and weight-perturbation robustness in the PAC-Bayes boundLeNet-5 · MNISTtest error bound: < 46%Helped
Use compression length and weight-perturbation robustness in the PAC-Bayes boundMobileNet 0.5 · ImageNettop-1 test error bound: < 96.5%Helped
Use compression length and weight-perturbation robustness in the PAC-Bayes boundMobileNet 0.5 · ImageNettop-5 test error bound: < 89%Helped
Apply the simple Occam bound to the compressed SqueezeNet modelSqueezeNet · ImageNettest error bound: 98.6%Helped
Add Gaussian noise to the non-zero weights (ablation)MobileNet 0.5 · ImageNet trainingtop-1 accuracy: 67% -> 65%Hurt
Prune ResNet-56 to 50% sparsity (ablation)ResNet-56 · CIFAR-10 with randomized labelstraining accuracyNo clear effect
Increase label randomization while compressing beyond 50% sparsity (ablation)ResNet-56 · CIFAR-10 with randomized labelstraining accuracyMixed

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