Online Algorithms

Open Problem: Fast and Optimal Online Portfolio Selection COLT 2020 Open Problem: Model Selection for Contextual Bandits COLT 2020 Optimal Algorithms for Multiplayer Multi-Armed Bandits AISTATS 2020 Optimal Algorithms for Stochastic Multi-Armed Bandits with Heavy Tailed Rewards NeurIPS 2020 Optimal Best-arm Identification in Linear Bandits NeurIPS 2020 Optimal Margin Distribution Learning in Dynamic Environments AAAI 2020 Optimal Non-parametric Learning in Repeated Contextual Auctions with Strategic Buyer ICML 2020 Optimal Robustness-Consistency Trade-offs for Learning-Augmented Online Algorithms NeurIPS 2020 Optimal Sequential Maximization: One Interview is Enough! ICML 2020 Optimizing Discrete Spaces via Expensive Evaluations: A Learning to Search Framework AAAI 2020 Path Planning Problems with Side Observations—When Colonels Play Hide-and-Seek AAAI 2020 Pay Your Trip for Traffic Congestion: Dynamic Pricing in Traffic-Aware Road Networks AAAI 2020 Planning with General Objective Functions: Going Beyond Total Rewards NeurIPS 2020 Practical Frank–Wolfe Method with Decision Diagrams for Computing Wardrop Equilibrium of Combinatorial Congestion Games AAAI 2020 Prediction with Corrupted Expert Advice NeurIPS 2020 Preselection Bandits ICML 2020 Projection-free Distributed Online Convex Optimization with O(√T) Communication Complexity ICML 2020 Projective Quadratic Regression for Online Learning AAAI 2020 Prophets, Secretaries, and Maximizing the Probability of Choosing the Best AISTATS 2020 Randomized Exploration in Generalized Linear Bandits AISTATS 2020 Real-Time Dispatching of Large-Scale Ride-Sharing Systems: Integrating Optimization, Machine Learning, and Model Predictive Control IJCAI 2020 Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses NeurIPS 2020 Regret Minimisation in Multi-Armed Bandits Using Bounded Arm Memory AAAI 2020 Reinforcement Learning in Feature Space: Matrix Bandit, Kernels, and Regret Bound ICML 2020 Restless-UCB, an Efficient and Low-complexity Algorithm for Online Restless Bandits NeurIPS 2020