atlas

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

PAC-Bayesian Bounds on Rate-Efficient Classifiers

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
Increasing Gaussian input noise variance sigma_c^2 from 0.010 to 1.000MinCq majority vote on MNIST binary tasks · MNIST controlled noisenoise invariance bound Bη: 0.149 to 0.470Hurt
Bounding noise invariance with the PAC-Bayes bound (Theorem 3) under JPEG2000 compressionMinCq majority vote on MNIST-JPEG2000 · MNIST-JPEG2000 q=5|ηT_Q − Bη| gapNo clear effect
Lowering JPEG2000 quality from q=90 to q=5 (fewer bytes)MinCq majority vote on MNIST-JPEG2000 · MNIST-JPEG2000 test risktest risk RT(BQ): 0.24 to 0.28Hurt

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