arXiv Machine Learning

High Probability Risk Control for Online Policy Learning

The paper introduces a method for controlling risk in online policy learning, ensuring that an agent’s policy risk remains below a specified threshold at every round with high probability. It tackles the challenges posed by feedback covariate shift by proposing a permutation‑based weighted risk evaluator, efficiently approximated via the Sinkhorn algorithm, and a Gaussian bootstrap‑derived upper confidence bound for policy selection. Theoretical results guarantee low‑variance risk estimation and asymptotic high‑probability risk control, while empirical tests on contextual bandits, safe question answering, and medical claim filtering demonstrate maintained risk levels, lower risk than baselines, and reliable policy selection.

arXiv Machine Learning
Oct 2

Robust Risk-Sensitive Reinforcement Learning from Corrupted Human Feedback

The paper introduces WSP-CVaR-RLHF, a risk‑sensitive reinforcement learning algorithm that learns from human feedback while handling corrupted or adversarial preference labels. It uses uncertainty‑weighted reward estimation and optimistic CVaR planning to achieve a regret bound that separates clean statistical cost from corruption penalties. Experiments with four adversarial attacks show that the method consistently reduces cumulative regret compared to an unweighted robust baseline while maintaining confidence‑set coverage.

By Xinyi Ni, Lifeng Lai
arXiv Statistics ML
Nov 9

High-Dimensional Off-Policy Evaluation without Sample Splitting using an Onsager Correction

The paper introduces an Onsager‑corrected, target‑policy‑weighted criterion that estimates the out‑of‑sample risk of a reward model trained on the full dataset using only its training data, thereby eliminating the need for sample splitting. This approach allows early stopping along a full‑data gradient‑descent trajectory and provides uniform consistency guarantees for neural networks under Gaussian contexts and single‑index rewards. The correction also yields a doubly robust policy‑value estimator that remains consistent even when reward‑model prediction error does not vanish, and experiments demonstrate reduced risk‑estimation error and improved reward‑model selection compared to held‑out baselines. whyItMatters":"By removing the need for sample splitting, the method enables more efficient use of data and improves the reliability of off‑policy evaluation and reward‑model selection in high‑dimensional settings."

By Saksham Jain, Guillaume Braun, Masaaki Imaizumi
arXiv AI
Sep 1

BCPPO: Bachelier-Inspired Constrained Proximal Policy Optimization for Tail-Risk-Aware Safe Reinforcement Learning

BCPPO is a new variant of Proximal Policy Optimization that uses Bachelier-inspired cost‑prediction networks to generate a smooth penalty based on disagreement among critics. The method keeps temporal‑difference learning unchanged, applies a saturation‑aware controller to manage cost penalties, and deploys only the policy network. Across extensive experiments, BCPPO outperforms comparators in achieving higher mean returns while maintaining lower or comparable CVaR in all tested tasks.

By Dongsheng Hou, Yanqiao Chen, Yuhan Rui
arXiv AI
Oct 16

Provably Efficient Risk-Sensitive Offline Reinforcement Learning via Optimized Certainty Equivalents

The paper presents the first provably efficient offline reinforcement learning algorithms for risk-sensitive settings using optimized certainty equivalents (OCE). It introduces two formulations—dynamic-OCE, applying OCE at each step, and static-OCE, applying a single OCE to cumulative rewards—and develops pessimistic value-iteration methods with tight sublinear suboptimality bounds in tabular and linear function approximation settings. The authors also establish minimax lower bounds, characterizing the fundamental limits of offline risk-sensitive RL.

By Hanzhen Wang, Boxiang Lyu, Zhongxiang Dai, Siyang Gao, Dake Zhang, Shuang Qiu
arXiv Machine Learning
Jun 2

Bandit Simulation for Average Reward Inference

arXiv:2606. 00913v1 Announce Type: cross Abstract: Multi-arm bandit algorithms are increasingly used in online platforms, clinical trials, and social science experiments, but valid statistical inference on their performance remains an open challenge.

By Samya Praharaj, Chih-Yu Chang, Koulik Khamaru, Kelly W. Zhang