conftrace_

exploration scheme

3 papers

Explore in graph

Co-occurring keywords · papers mentioning both

regret bound (2) online learning (2) discounted setting (1) multi-reward (1) pac (1) feedback graph (1) strongly convex loss (1) bandit algorithm (1) strongly convex function (1) bandit convex optimization (1)

Papers

Adaptive Exploration for Multi-Reward Multi-Policy Evaluation ICML 2025 A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs NeurIPS 2022 Bandit Convex Optimization: Towards Tight Bounds NeurIPS 2014