Research map / Learning theory and algorithms / Submodular and game algorithms
Minimax Curriculum Learning: Machine Teaching with Desirable Difficulties and Scheduled Diversity
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
- On the Statistical Benefits of Curriculum Learning (ICML 2022 · similarity 0.89)
- Bandit Guided Submodular Curriculum for Adaptive Subset Selection (NeurIPS 2025 · similarity 0.86)
- Dual-Level Curriculum Meta-Learning for Noisy Few-Shot Learning Tasks (AAAI 2024 · similarity 0.85)
- High-Dimensional Bayesian Optimization via Semi-Supervised Learning with Optimized Unlabeled Data Sampling (ICML 2024 · similarity 0.85)
- CurBench: Curriculum Learning Benchmark (ICML 2024 · similarity 0.84)
- CurES: From Gradient Analysis to Efficient Curriculum Learning for Reasoning LLMs (ICLR 2026 · 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.