Research map / Learning theory and algorithms / Sample complexity
A Competitive Algorithm for Agnostic Active 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
- Robust Regression of General ReLUs with Queries (NeurIPS 2025 · similarity 0.86)
- On Agnostic PAC Learning in the Small Error Regime (NeurIPS 2025 · similarity 0.86)
- Universal Rates for Active Learning (NeurIPS 2024 · similarity 0.85)
- Regret–Oracle Complexity Tradeoffs in Agnostic Online Learning (NeurIPS 2026 · similarity 0.84)
- Active Classification with Few Queries under Misspecification (NeurIPS 2024 · similarity 0.84)
- Revisiting Agnostic Boosting (NeurIPS 2025 · 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.