The Statistical Complexity of Interactive Decision Making

The Statistical Complexity of Interactive Decision Making

27 December 2021

Dylan J. Foster

Alexander Rakhlin

Papers citing "The Statistical Complexity of Interactive Decision Making"

11 / 11 papers shown

Title
Greedy Algorithm for Structured Bandits: A Sharp Characterization of Asymptotic Success / Failure Aleksandrs Slivkins Yunzong Xu Shiliang Zuo 255 1 0 06 Mar 2025
Can RLHF be More Efficient with Imperfect Reward Models? A Policy Coverage Perspective Jiawei Huang Bingcong Li Christoph Dann Niao He OffRL 158 1 0 26 Feb 2025
Decision Making in Hybrid Environments: A Model Aggregation Approach Haolin Liu Chen-Yu Wei Julian Zimmert 144 0 0 09 Feb 2025
A Complete Characterization of Learnability for Stochastic Noisy Bandits Steve Hanneke Kun Wang 87 0 0 20 Jan 2025
Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation Long-Fei Li Yu Zhang Peng Zhao Zhi Zhou 149 5 0 17 Jan 2025
Sharp Analysis for KL-Regularized Contextual Bandits and RLHF Heyang Zhao Chenlu Ye Quanquan Gu Tong Zhang OffRL 130 6 0 07 Nov 2024
Second Order Bounds for Contextual Bandits with Function Approximation Aldo Pacchiano 152 4 0 24 Sep 2024
The Central Role of the Loss Function in Reinforcement Learning Kaiwen Wang Nathan Kallus Wen Sun OffRL 165 10 0 19 Sep 2024
Random Latent Exploration for Deep Reinforcement Learning Srinath Mahankali Zhang-Wei Hong Ayush Sekhari Alexander Rakhlin Pulkit Agrawal 111 3 0 18 Jul 2024
Combinatorial Multivariant Multi-Armed Bandits with Applications to Episodic Reinforcement Learning and Beyond Xutong Liu Siwei Wang Jinhang Zuo Han Zhong Xuchuang Wang Zhiyong Wang Shuai Li Mohammad Hajiesmaili J. C. Lui Wei Chen 129 3 0 03 Jun 2024
On Bits and Bandits: Quantifying the Regret-Information Trade-off Itai Shufaro Nadav Merlis Nir Weinberger Shie Mannor 101 0 0 26 May 2024