Research map / Learning theory and algorithms / Combinatorial and search optimization
Probably Approximately Correct Constrained Learning
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
- Near-Optimal Solutions of Constrained Learning Problems (ICLR 2024 · similarity 0.89)
- Learning with Statistical Equality Constraints (NeurIPS 2025 · similarity 0.86)
- Surprises in Proper Positive-Only Learning (NeurIPS 2026 · similarity 0.85)
- Collaborative Learning with Different Labeling Functions (ICML 2024 · similarity 0.85)
- Recursive PAC-Bayes: A Frequentist Approach to Sequential Prior Updates with No Information Loss (NeurIPS 2024 · similarity 0.85)
- Learning via Surrogate PAC-Bayes (NeurIPS 2024 · similarity 0.84)
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.