bandit setting

AdaO2B: Adaptive Online to Batch Conversion for Out-of-Distribution Generalization AAAI 2025 Non-stochastic Bandits With Evolving Observations ALT 2025 Online Linear Classification with Massart Noise ICML 2025 Pragmatic Feature Preferences: Learning Reward-Relevant Preferences from Human Input ICML 2024 Competing against Adaptive Strategies in Online Learning via Hints AISTATS 2023 Minimax Regret for Cascading Bandits NeurIPS 2022 One Gradient Frank-Wolfe for Decentralized Online Convex and Submodular Optimization ACML 2022 Online Learning for Min Sum Set Cover and Pandora’s Box ICML 2022 Differentially Private Online Submodular Maximization AISTATS 2021 A Tight Lower Bound and Efficient Reduction for Swap Regret NeurIPS 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 NeurIPS 2014 Adaptive Submodular Maximization in Bandit Setting NeurIPS 2013 (Nearly) Optimal Algorithms for Private Online Learning in Full-information and Bandit Settings NeurIPS 2013 Online learning in episodic Markovian decision processes by relative entropy policy search NeurIPS 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 NeurIPS 2009 The Price of Bandit Information for Online Optimization NeurIPS 2007