Research map / Bandits and online learning / Online convex optimization and games
Improved Algorithms for Neural 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
- Neural Active Learning Beyond Bandits (ICLR 2024 · similarity 0.91)
- Neural Active Learning with Performance Guarantees (NeurIPS 2021 · similarity 0.91)
- Online Active Learning with Surrogate Loss Functions (NeurIPS 2021 · similarity 0.89)
- Provably Neural Active Learning Succeeds via Prioritizing Perplexing Samples (ICML 2024 · similarity 0.88)
- Transductive Active Learning: Theory and Applications (NeurIPS 2024 · similarity 0.87)
- Fast Co-Training under Weak Dependence via Stream-Based Active Learning (ICML 2024 · similarity 0.85)
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.
