conftrace_

full information setting

6 papers

Explore in graph

Co-occurring keywords · papers mentioning both

regret bound (5) bandit setting (3) online learning (3) bandit feedback (2) multi-armed bandit (2) online optimization (2) additive regret (1) query learning (1) relative entropy policy search (1) online linear optimization (1)

Papers

Learning from Equivalence Queries, Revisited COLT 2026 Non-stochastic Bandits With Evolving Observations ALT 2025 Online Nonsubmodular Minimization with Delayed Costs: From Full Information to Bandit Feedback ICML 2022 Refined Lower Bounds for Adversarial Bandits NeurIPS 2016 Online learning in episodic Markovian decision processes by relative entropy policy search NeurIPS 2013 The Price of Bandit Information for Online Optimization NeurIPS 2007