Research map / Optimization / Nonconvex and smooth optimization
Fine-Grained Analysis of Stability and Generalization for Modern Meta Learning Algorithms
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
- Generalization Bounds for Meta-Learning via PAC-Bayes and Uniform Stability (NeurIPS 2021 · similarity 0.94)
- On the Stability and Generalization of Meta-Learning (NeurIPS 2024 · similarity 0.94)
- A Closer Look at the Training Strategy for Modern Meta-Learning (NeurIPS 2020 · similarity 0.93)
- On the Stability and Generalization of Meta-Learning: the Impact of Inner-Levels (NeurIPS 2025 · similarity 0.91)
- Certification-Enhanced Generalization Bounds (NeurIPS 2026 · similarity 0.89)
- Algorithmic Stability Unleashed: Generalization Bounds with Unbounded Losses (ICML 2024 · similarity 0.88)
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.