Research map / Learning theory and algorithms / Sample complexity
Universal Approximation in Dropout Neural Networks
Oxana A. Manita, Mark A. Peletier, Jacobus W. Portegies, Jaron Sanders, Albert Senen-Cerda
Read the paperCheck your idea against 137,217 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.
Closest papers by meaning
- Almost Sure Convergence of Dropout Algorithms for Neural Networks (JMLR 2025 · similarity 0.89)
- Dropout with Expectation-linear Regularization (ICLR 2017 · similarity 0.88)
- A closer look at the approximation capabilities of neural networks (ICLR 2020 · similarity 0.88)
- On the Regularization Properties of Structured Dropout (CVPR 2020 · similarity 0.87)
- Stochastic Modified Equations and Dynamics of Dropout Algorithm (ICLR 2024 · similarity 0.87)
- Approximation to Smooth Functions by Low-Rank Swish Networks (ICML 2025 · similarity 0.86)
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.
