Research map / Learning theory and algorithms / Kernels and regression theory
Generalization of Model-Agnostic Meta-Learning Algorithms: Recurring and Unseen Tasks
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: An Information-Theoretic Analysis (NeurIPS 2021 · similarity 0.93)
- Provable Generalization of Overparameterized Meta-learning Trained with SGD (NeurIPS 2022 · similarity 0.92)
- Fine-Grained Analysis of Stability and Generalization for Modern Meta Learning Algorithms (NeurIPS 2022 · similarity 0.91)
- On the Global Optimality of Model-Agnostic Meta-Learning (ICML 2020 · similarity 0.91)
- On the Stability and Generalization of Meta-Learning (NeurIPS 2024 · similarity 0.90)
- Certification-Enhanced Generalization Bounds (NeurIPS 2026 · 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.