arXiv Machine Learning
Contextual Online Uncertainty-Aware Preference Learning for Human Feedback
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Jul 31
On-Policy and Off-Policy Learning for Large Action Spaces
arXiv:2607. 28408v1 Announce Type: new Abstract: This thesis studies policy learning in interactive systems where an agent observes a context, selects an action from a very large set, and receives partial feedback.
arXiv AI
Jun 9
A Regret Minimization Framework on Preference Learning in Large Language Models
arXiv:2606. 09124v1 Announce Type: new Abstract: Reinforcement learning with verifiable rewards (RLVR) has enabled progress on reasoning-intensive tasks by relying on task-specific verifiers that provide automated correctness signals.
arXiv Machine Learning
Aug 18
Sequential Batch Learning in Finite-Action Linear Contextual Bandits
arXiv:2004. 06321v2 Announce Type: replace Abstract: We study the sequential batch learning problem in linear contextual bandits with finite action sets, where the decision maker is constrained to split incoming individuals into (at most) a fixed number of batches and can only observe outcomes for the individuals within a batch at the batch's end.
Hugging Face Trending Papers
Aug 27
Safety by Design: Realized-Cost Constraints for Contextual Bandits with Continuous Actions
The paper introduces a new approach to safety in contextual bandits with continuous actions by enforcing high‑probability constraints on the realized cost rather than on its expectation. It proposes the High‑Probability Constrained UCB algorithm, which balances optimistic reward exploration with pessimistic safety estimation. The authors provide theoretical regret guarantees for linear models and extend the analysis to general function classes, demonstrating experimentally that realized‑cost constraints significantly reduce safety violations compared to expected‑cost baselines.
arXiv Machine Learning
Aug 19
Policy Optimization and Statistical Inference for Online Contextual Matrix Games
The paper introduces online contextual matrix games, a framework that merges contextual bandits with multi‑player online games to handle dynamic contexts and strategic interactions. It presents OnGameLearn, an algorithm that balances exploration and exploitation across actions and contexts, providing statistical guarantees such as tail bounds, Nash equilibrium convergence, asymptotic normality, and sublinear regret. The authors also define a policy value for matrix games and propose a doubly robust, √T‑consistent estimator, demonstrating effectiveness through simulations and a hotel pricing case study.
arXiv Machine Learning
Jun 2
Off-Policy Learning in Large Action Spaces: Optimization Matters More Than Estimation
arXiv:2509. 03456v2 Announce Type: replace-cross Abstract: Off-policy evaluation (OPE) and off-policy learning (OPL) are foundational for decision-making in offline contextual bandits.