atlas

Research map / Optimization / Implicit bias and generalization

Deterministic PAC-Bayesian generalization bounds for deep networks via generalizing noise-resilience

ICLR 2019 · Optimization › Implicit bias and generalization · approach: Stability-based generalization analysis · 37 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 the proposed noise-resilience framework instead of product-of-spectral-norm-based boundsReLU feedforward networks · MNIST, networks with H=40bound depth-scaling rate: 2.15^D -> 1.57^DHelped
Use the proposed bound rather than existing boundsReLU feedforward networks · D=28generalization-bound valueHelped
Use the proposed bound rather than existing boundsReLU feedforward networks · Networks of varying depthgeneralization-bound valueHurt

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