conftrace_

regret lower bound

10 papers

Explore in graph

Co-occurring keywords · papers mentioning both

regret bound (3) multi-armed bandit (3) stochastic bandit (2) bandits (2) oracle feedback (1) semi-bandit algorithm (1) contextual vector (1) local regret (1) online nonconvex optimization (1) double-loop algorithm (1)

Papers

Combinatorial Reinforcement Learning with Preference Feedback ICML 2025 Fusing Reward and Dueling Feedback in Stochastic Bandits ICML 2025 On Mitigating Affinity Bias through Bandits with Evolving Biased Feedback ICML 2025 Borda Regret Minimization for Generalized Linear Dueling Bandits ICML 2024 Factored-Reward Bandits with Intermediate Observations ICML 2024 Second Order Methods for Bandit Optimization and Control COLT 2024 Online Nonconvex Optimization with Limited Instantaneous Oracle Feedback COLT 2023 Multiple-Play Bandits in the Position-Based Model NeurIPS 2016 Lipschitz Bandits: Regret Lower Bound and Optimal Algorithms COLT 2014 Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms ICML 2014