arXiv:2512. 18390v2 Announce Type: replace Abstract: Organizations often have an incumbent predictive model in production when new data sources become available.
By Vassilis Digalakis Jr, Christophe P\'erignon, S\'ebastien Saurin, Flore Sentenac
arXiv:2609.06873v1 Announce Type: cross
Abstract: We study how a limited labeling budget should be allocated to minimize multiclass zero-one classification risk. We consider parametric classification...
By F. Setoudehtanzangi, Geoffrey J. McLachlan
arXiv:2602. 05459v2 Announce Type: replace Abstract: Offline goal-conditioned reinforcement learning (GCRL) is typically benchmarked by the best tuned success rate of each method.
By Jan Malte T\"opperwien, Aditya Mohan, Marius Lindauer
The paper introduces O-MPAC, an offline planning method for learning source acquisition policies under a limited budget. It transfers finite‑horizon risk‑cost targets from full training data into a shared source‑action scorer that re‑evaluates partial observations and source metadata after each query, applying a hard cost mask. Experiments show that O‑MPAC achieves high accuracy (0.965) in a routing task and outperforms several baselines on six real tasks, achieving the highest mean budget‑integrated accuracy on five of them.
By Ziqi Zhao, Run Xu, Qingjian Ni
arXiv:2606. 05606v1 Announce Type: new Abstract: LLM post-training often relies on reinforcement learning methods that sample multiple rollouts per prompt, yet most existing approaches use a fixed rollout budget for every prompt, despite large differences in the training signal different prompts provide.
By Yiming Zong, Yige Wang, Jiashuo Jiang
arXiv:2609.38860v1 Announce Type: cross
Abstract: Learning from human preferences is central to large language model (LLM) alignment, but human preference annotation is costly. Active preference lear...
By Zhongman Du, Huiming Zhang, Haodong Zhu, Baochang Zhang