Research map / Label-efficient and robust learning / Domain adaptation and generalization
Minimax optimal approaches to the label shift problem in non-parametric settings
Subha Maity, Yuekai Sun, Moulinath Banerjee
Read the paperCheck your idea against 137,217 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
- Self-training Avoids Using Spurious Features Under Domain Shift (NeurIPS 2020 · similarity 0.88)
- Domain Adaptation under Open Set Label Shift (NeurIPS 2022 · similarity 0.88)
- Importance Weight Estimation and Generalization in Domain Adaptation Under Label Shift (TPAMI 2021 · similarity 0.87)
- Label Shift Meets Online Learning: Ensuring Consistent Adaptation with Universal Dynamic Regret (CVPR 2025 · similarity 0.86)
- Imprecise Label Learning: A Unified Framework for Learning with Various Imprecise Label Configurations (NeurIPS 2024 · similarity 0.86)
- Label Noise: Ignorance Is Bliss (NeurIPS 2024 · similarity 0.86)
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.
