{"total":16,"rows":[{"id":"2403.03562","title":"Efficient Algorithms for Empirical Group Distributionally Robust Optimization and Beyond","created":"2024-03-06","cited_by_count":11,"area":null},{"id":"2310.18590","title":"Using Early Readouts to Mediate Featural Bias in Distillation","created":"2023-10-28","cited_by_count":7,"area":null},{"id":"2410.00690","title":"Beyond Minimax Rates in Group Distributionally Robust Optimization via a Novel Notion of Sparsity","created":"2024-10-01","cited_by_count":5,"area":null},{"id":"2302.09267","title":"Stochastic Approximation Approaches to Group Distributionally Robust Optimization and Beyond","created":"2023-02-18","cited_by_count":4,"area":null},{"id":"2306.00026","title":"Efficient Stochastic Approximation of Minimax Excess Risk Optimization","created":"2023-05-31","cited_by_count":4,"area":null},{"id":"2309.02211","title":"Distributionally Robust Learning for Multi-source Unsupervised Domain Adaptation","created":"2023-09-05","cited_by_count":4,"area":null},{"id":"2312.02277","title":"A Near-Optimal Single-Loop Stochastic Algorithm for Convex Finite-Sum Coupled Compositional Optimization","created":"2023-12-04","cited_by_count":3,"area":null},{"id":"2411.05198","title":"Private Algorithms for Stochastic Saddle Points and Variational Inequalities: Beyond Euclidean Geometry","created":"2024-11-07","cited_by_count":2,"area":null},{"id":"2503.09755","title":"Distributionally Robust Multi-Agent Reinforcement Learning for Dynamic Chute Mapping","created":"2025-03-12","cited_by_count":2,"area":null},{"id":"2505.15212","title":"Group Distributionally Robust Optimization with Flexible Sample Queries","created":"2025-05-21","cited_by_count":2,"area":null},{"id":"2509.08942","title":"Group Distributionally Robust Machine Learning under Group Level Distributional Uncertainty","created":"2025-09-10","cited_by_count":2,"area":null},{"id":"2511.08887","title":"FAST-CAD: A Fairness-Aware Framework for Non-Contact Stroke Diagnosis","created":"2025-11-12","cited_by_count":2,"area":null},{"id":"2602.21039","title":"Is Multi-Distribution Learning as Easy as PAC Learning: Sharp Rates with Bounded Label Noise","created":"2026-02-24","cited_by_count":1,"area":null},{"id":"2609.20501","title":"Distributionally Robust Federated Learning with Multi-Source Data","created":"2026-09-17","cited_by_count":0,"area":null},{"id":"2609.36610","title":"Communication-Efficient Agnostic Federated Learning via Faster Convergence and Compression","created":"2026-09-29","cited_by_count":0,"area":null},{"id":"2610.06329","title":"Dynamic Minimax Regret Optimization for Robust LLM Post-Training","created":"2026-10-05","cited_by_count":0,"area":null}],"next_cursor":null}