Vanilla Policy Optimization Is Both Optimal and Differentially Private for Stochastic Contextual Bandits
This work develops a batched version of vanilla policy optimization using only $O(\log T)$ regression calls and policy switches, and shows how private regression oracles yield differentially private contextual bandit algorithms without composition across batches.