Research map / Optimization / Nonconvex and smooth optimization
Time-independent Generalization Bounds for SGLD in Non-convex Settings
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.
Closest papers by meaning
- Time-Independent Information-Theoretic Generalization Bounds for SGLD (NeurIPS 2023 · similarity 0.96)
- Generalization of noisy SGD in unbounded non-convex settings (ICML 2025 · similarity 0.95)
- Stability Based Generalization Bounds for Exponential Family Langevin Dynamics (ICML 2022 · similarity 0.93)
- Optimizing Information-theoretical Generalization Bound via Anisotropic Noise of SGLD (NeurIPS 2021 · similarity 0.93)
- Analyzing the Generalization Capability of SGLD Using Properties of Gaussian Channels (NeurIPS 2021 · similarity 0.92)
- Temperature is All You Need for Generalization in Langevin Dynamics and other Markov Processes (NeurIPS 2025 · similarity 0.89)
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.