Research map / Learning theory and algorithms / Submodular and game algorithms
Learning-to-Optimize with PAC-Bayesian Guarantees: Theoretical Considerations and Practical Implementation
Michael Sucker, Jalal Fadili, Peter Ochs
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
- Data-Driven Performance Guarantees for Classical and Learned Optimizers (JMLR 2025 · similarity 0.93)
- A Generalization Result for Convergence in Learning-to-Optimize (ICML 2025 · similarity 0.92)
- A PAC-Bayesian Analysis of Randomized Learning with Application to Stochastic Gradient Descent (NeurIPS 2017 · similarity 0.90)
- PACOH: Bayes-Optimal Meta-Learning with PAC-Guarantees (ICML 2021 · similarity 0.90)
- Learning via Surrogate PAC-Bayes (NeurIPS 2024 · similarity 0.89)
- BONSAI: Bayesian Optimization with Natural Simplicity and Interpretability (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.
