Group Distributionally Robust Optimization with Flexible Sample Queries
cs.LG, math.OC
Submitted: 2025-05-21
Updated: 2026-11-02
Terminology
Sources
- Lasso Bandit with Compatibility Condition on Optimal Arm
- Beyond Minimax Rates in Group Distributionally Robust Optimization via a Novel Notion of Sparsity
- Online Learning: A Modern Introduction Using Convex Optimization
- Group Robust Preference Optimization in Reward-free RLHF
- Efficient Online-Bandit Strategies for Minimax Learning Problems
- Near-Optimal Algorithms for Group Distributionally Robust Optimization and Beyond
- Stochastic Approximation Approaches to Group Distributionally Robust Optimization and Beyond
Related papers
- FlexMoE: Learning One-for-All Multi-Budget Expert Pruning for Flexible MoE Deployment
- OptiMind: Improving Small Language Models for Optimization Modeling through Formulation Guidance and Multi-Turn Learning
- Staying in the Sweet Spot: Boost Reasoning Evolution via Responsive Rollout Difficulty Manipulation
- Examining the Impact of Data and Training Methods on Emergent and Subliminal Misalignment
- Rethinking Black-Box On-Policy Distillation: A Rubric-based Analysis
- (Mis)generalization of Helpful-Only Fine-tuning