paper-with-me

Papers

Group Distributionally Robust Optimization-Driven Reinforcement Learning for LLM Reasoning

2026-01-27 · Kishan Panaganti, Zhenwen Liang, Wenhao Yu, Haitao Mi, Dong Yu arxiv

Recent progress in Large Language Model (LLM) reasoning is increasingly driven by the refinement of post-training loss functions and alignment strategies. However, standard Reinforcement Learning (RL) paradigms like Group Relative Policy Optimization (GRPO) remain constrained by static uniformity: uniform prompt sampling and a fixed number of rollouts per prompt. For heterogeneous, heavy-tailed reasoning data, this creates structural inefficiencies that waste compute on already-solved patterns while under-training the long tail of hard problems. To address this, we propose Multi-Adversary Group Distributionally Robust Optimization (GDRO), an optimization-first framework that moves beyond uniform reasoning models by dynamically adapting the training distribution. We introduce an Online Difficulty Classifier that partitions prompts into dynamic pass@k difficulty groups. We then propose two independent GDRO games for post-training: (1) Prompt-GDRO, which employs an EMA-debiased multiplicative-weights bandit sampler to target the intensive difficulty margin and upweight persistently hard groups without frequency bias; and (2) Rollout-GDRO, which uses a shadow-price controller to reallocate rollouts across groups, maximizing gradient variance reduction on hard tasks under a fixed mean budget (compute-neutral). We provide no-regret guarantees for both controllers and additionally a variance-proxy analysis motivating a square-root optimal rollout allocation for Rollout-GDRO. We validate our framework on the DAPO 14.1k dataset using Qwen3-Base models. Prompt-GDRO and Rollout-GDRO achieve average relative gains of +10.6% and +10.1%, respectively, in pass@8 accuracy across 1.7B, 4B, and 8B scales compared to the GRPO baseline. Qualitative analysis shows an emergent curriculum: the adversaries shift resources to the evolving reasoning frontier, enhancing the reasoning model's performance.

📄 PDF Abstract BibTeX arXiv:2601.19280

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement Learning

Similar Papers 제목 키워드 기반

Distributionally Robust Token Optimization in RLHF

2026-03-27 · Yeping Jin, Jiaming Hu, Ioannis Ch. Paschalidis arxiv

Large Language Models (LLMs) tend to respond correctly to prompts that align well with the data they were trained and fine-tuned on. Yet, small shifts in wording, format, or language can trigger surprisingly large failur…

Reinforcement Learning

Distributionally Robust Multi-Agent Reinforcement Learning for Dynamic Chute Mapping

2025-03-12 · Guangyi Liu, Suzan Iloglu, Michael Caldara, Joseph W. Durham 외

In Amazon robotic warehouses, the destination-to-chute mapping problem is crucial for efficient package sorting. Often, however, this problem is complicated by uncertain and dynamic package induction rates, which can lea…

Multi-agent Reinforcement Learning

Distributionally Robust Learning

2021-08-20 · Ruidi Chen, Ioannis Ch. Paschalidis

This monograph develops a comprehensive statistical learning framework that is robust to (distributional) perturbations in the data using Distributionally Robust Optimization (DRO) under the Wasserstein metric. Beginning…

Decision Makingregression

Near-Optimal Algorithms for Group Distributionally Robust Optimization and Beyond

2022-12-28 · Tasuku Soma, Khashayar Gatmiry, Sharut Gupta, Stefanie Jegelka

Distributionally robust optimization (DRO) can improve the robustness and fairness of learning methods. In this paper, we devise stochastic algorithms for a class of DRO problems including group DRO, subpopulation fairne…

Fairness

Doubly Robust Data-Driven Distributionally Robust Optimization

2017-05-19 · Jose Blanchet, Yang Kang, Fan Zhang, Fei He 외

Data-driven Distributionally Robust Optimization (DD-DRO) via optimal transport has been shown to encompass a wide range of popular machine learning algorithms. The distributional uncertainty size is often shown to corre…