Research map / Learning theory and algorithms / Sample complexity
A Theory of PAC Learnability under Transformation Invariances
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
- Automatic Data Augmentation via Invariance-Constrained Learning (ICML 2023 · similarity 0.89)
- Deep invariant networks with differentiable augmentation layers (NeurIPS 2022 · similarity 0.87)
- Learning Invariances using the Marginal Likelihood (NeurIPS 2018 · similarity 0.85)
- Marginal-Nonuniform PAC Learnability (NeurIPS 2025 · similarity 0.85)
- PAC Generalization via Invariant Representations (ICML 2023 · similarity 0.85)
- Recursive PAC-Bayes: A Frequentist Approach to Sequential Prior Updates with No Information Loss (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.