2025 Poster "regret bound analysis" Papers
4 papers found
Efficient and Near-Optimal Algorithm for Contextual Dueling Bandits with Offline Regression Oracles
Aadirupa Saha, Robert Schapire
NeurIPS 2025poster
Lasso Bandit with Compatibility Condition on Optimal Arm
Harin Lee, Taehyun Hwang, Min-hwan Oh
ICLR 2025posterarXiv:2406.00823
4
citations
Learning Personalized Ad Impact via Contextual Reinforcement Learning under Delayed Rewards
Yuwei Cheng, Zifeng Zhao, Haifeng Xu
NeurIPS 2025posterarXiv:2510.20055
Spectral Learning for Infinite-Horizon Average-Reward POMDPs
Alessio Russo, Alberto Maria Metelli, Marcello Restelli
NeurIPS 2025poster