atlas

Research map / Optimization / Optimizers

Information-Theoretic Generalization Bounds for SGLD via Data-Dependent Estimates

NeurIPS 2019 · Optimization › Optimizers · approach: Stochastic gradient MCMC · 36 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 data-dependent priors to forecast minibatch gradients from a subset of the training dataSGLD generalization bounds · MNIST, Fashion-MNIST, CIFAR-10squared gradient incoherence relative to squared gradient norm: between 100 and 10,000 times smallerHelped
Increase the held-out subset size mData-dependent SGLD generalization bound · Empirical bound comparisonsbound tightnessHelped
Use the data-dependent bound instead of the compared prior SGLD boundSGLD · Monte Carlo bound estimatesgeneralization error boundHelped
Use the data-dependent bound at small learning rates and inverse temperaturesSGLD · Monte Carlo bound estimates across learning-rate and inverse-temperature schedulesgeneralization error boundHelped

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