atlas

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

Dropout Training, Data-dependent Regularization, and Generalization Bounds

ICML 2018 · Learning theory and algorithms › Kernels and regression theory · approach: Information-theoretic generalization bounds · 17 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 truthful dropout (unbiased variant) instead of no dropoutneural networks · MNIST and CIFAR-10test error: MNIST FC 1.78 to 1.60; shallow conv 1.16 to 0.99; CIFAR-10 deep conv 9.86 to 8.20Helped
truthful dropout instead of traditional dropoutfully-connected and shallow convolutional networks on MNIST · MNISTtest error: 1.53 to 1.60 (FC); 0.81 to 0.99 (shallow conv)Hurt
truthful dropout instead of traditional dropoutdeep convolutional network on CIFAR-10 · CIFAR-10test error: 8.39 to 8.20 (about 0.19 points)Helped
Truthful dropout variance and dropout as data-dependent regularizer; framework bound for one-hidden-layer ReLU netsone-hidden-layer ReLU networks · theoretical generalization boundgeneralization error rateHelped

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