atlas

Research map / Learning theory and algorithms / Sample complexity

Generalization Bounds for Neural Networks via Approximate Description Length

NeurIPS 2019 · Learning theory and algorithms › Sample complexity · approach: Sample complexity of learning distributions · 4 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 approximate description length to bound generalization for networks with bounded weight magnitudesNeural networks with bounded spectral and Frobenius norms · Bounded-weight neural networkssample complexity: \tilde{O}\left( \frac{d^2R^2}{\epsilon^2} \right) -> \tilde{O}\left( \frac{dR^2}{\epsilon^2} \right)Helped
Measure weight magnitude relative to fixed reference matrices instead of relative to zeroNeural networks with bounded weight changes from initialization · Neural networks around reference matricessample complexity: \tilde{O}\left( \frac{dR^2}{\epsilon^2} \right)Helped
Use an approximate-description-length and shattering analysis to obtain an upper bound and a matching lower bound up to logarithmic factorsReLU networks with bounded Frobenius norm · ReLU networks, depth twofat-shattering dimension: \Omega\left(\frac{dR^2}{\log^2(d)}\right)Helped

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