atlas

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

Certifying Deep Network Risks and Individual Predictions with PAC-Bayes Loss via Localized Priors

NeurIPS 2025 · Learning theory and algorithms › Kernels and regression theory · approach: PAC-Bayes bounds · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

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

Proposes localized PAC-Bayes priors to produce tighter, practical generalization certificates for deep networks, covering both risk bounds and individual predictions.

Problem

PAC-Bayes generalization certificates for deep networks are rarely practical: simple theoretical priors give vacuous bounds, while data-dependent priors are needed for tight guarantees.

Approach

Uses localized priors within the PAC-Bayes framework to obtain non-vacuous certificates on deep network risk and on individual predictions, rather than simple theoretical priors that yield vacuous bounds.

Experimental setup

Metrics: generalization bound tightness

Builds on: PAC-Bayes

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