online linear optimization

Narrowing the Gap between Adversarial and Stochastic MDPs via Policy Optimization AISTATS 2025 Improving Adaptive Online Learning Using Refined Discretization ALT 2024 Alternation makes the adversary weaker in two-player games NeurIPS 2023 Bandit Online Linear Optimization with Hints and Queries ICML 2023 Competing against Adaptive Strategies in Online Learning via Hints AISTATS 2023 Pseudonorm Approachability and Applications to Regret Minimization ALT 2023 Expected Regret and Pseudo-Regret are Equivalent When the Optimal Arm is Unique JMLR 2022 Parameter-free Mirror Descent COLT 2022 Parameter-Free Online Linear Optimization with Side Information via Universal Coin Betting AISTATS 2022 PDE-Based Optimal Strategy for Unconstrained Online Learning ICML 2022 Computing an Efficient Exploration Basis for Learning with Univariate Polynomial Features AAAI 2021 Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications COLT 2021 Logarithmic Regret from Sublinear Hints NeurIPS 2021 Online Linear Optimization with Many Hints NeurIPS 2020 Exponential Weights on the Hypercube in Polynomial Time AISTATS 2019 Online Linear Optimization with Sparsity Constraints ALT 2019 Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback NeurIPS 2019 Efficient Online Linear Optimization with Approximation Algorithms NeurIPS 2017 Online Learning with a Hint NeurIPS 2017 Playing Repeated Network Interdiction Games with Semi-Bandit Feedback IJCAI 2017 The Price of Differential Privacy for Online Learning ICML 2017 Coin Betting and Parameter-Free Online Learning NeurIPS 2016 Online Stochastic Linear Optimization under One-bit Feedback ICML 2016 Open Problem: Parameter-Free and Scale-Free Online Algorithms COLT 2016 Adaptive Online Learning NeurIPS 2015