Skip to content

Risk-Sensitive Non-Parametric and Kernel Bandits

Devdan Dey, Sujoy Bhore, Avishek Ghosh

stat.MLarXiv:2611.06489

Abstract

We study non-parametric bandits in which arms are evaluated using Cumulative Prospect Theory (CPT) rather than expected reward. We consider continuous action spaces with arm-dependent noise and propose Non-Parametric CPT Bandits (NPCB), an optimistic algorithm that decouples mean estimation from CPT-based decision-making. We prove CPT regret of order O(T\,E( F,T-2)\, N( F,T-2,\|·\|∞)), where E is the Eluder dimension of the function class F, T is the time horizon, and N is its covering number in the sup norm. This matches the order-wise regret of classical non-parametric bandits, showing that CPT risk sensitivity incurs no additional order-wise regret cost. We extend NPCB to unknown noise CDFs, retaining the known-CDF mean-learning term and adding a CDF-learning cost governed by a distributional Eluder dimension. We also study Kernel-CPT bandits and obtain information-gain-based regret bounds for a broad range of kernels, matching the corresponding risk-neutral kernel rates up to logarithmic factors.

Create a lesson