conftrace_

bandit setting

16 papers

Explore in graph

Co-occurring keywords

regret bound (1926) online learning (1777) multi-armed bandit (1098) online optimization (108) online algorithm (445) bandit algorithm (108) submodular maximization (143) regret minimization (315) stochastic optimization (1060) differential privacy (1016)

Papers

AdaO2B: Adaptive Online to Batch Conversion for Out-of-Distribution Generalization AAAI 2025
Competing against Adaptive Strategies in Online Learning via Hints AISTATS 2023
Online Learning for Min Sum Set Cover and Pandora’s Box ICML 2022
Minimax Regret for Cascading Bandits NIPS 2022
Differentially Private Online Submodular Maximization AISTATS 2021
A Tight Lower Bound and Efficient Reduction for Swap Regret NIPS 2020
Online Optimization of Smoothed Piecewise Constant Functions AISTATS 2017
Optimization as Estimation with Gaussian Processes in Bandit Settings AISTATS 2016
Online combinatorial optimization with stochastic decision sets and adversarial losses NIPS 2014
Online learning in episodic Markovian decision processes by relative entropy policy search NIPS 2013
Adaptive Submodular Maximization in Bandit Setting NIPS 2013
(Nearly) Optimal Algorithms for Private Online Learning in Full-information and Bandit Settings NIPS 2013
Regret Minimization for Branching Experts COLT 2013
A Potential-based Framework for Online Multi-class Learning with Partial Feedback AISTATS 2010
Beyond Convexity: Online Submodular Minimization NIPS 2009
The Price of Bandit Information for Online Optimization NIPS 2007