Search papers, labs, and topics across Lattice.
Affiliation:
1
0
3
A novel bandit algorithm achieves near-optimal dynamic minimax regret for LLM post-training, improving worst-group robustness without re-evaluating historical data or altering standard training pipelines.
