← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Hedging in games: Faster convergence of external and swap regrets NIPS 2020
A Tight Lower Bound and Efficient Reduction for Swap Regret NIPS 2020
Choice Bandits NIPS 2020
Making Non-Stochastic Control (Almost) as Easy as Stochastic NIPS 2020
Online Non-Convex Optimization with Imperfect Feedback NIPS 2020
Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses NIPS 2020
Online Convex Optimization Over Erdos-Renyi Random Networks NIPS 2020
A Single Recipe for Online Submodular Maximization with Adversarial or Stochastic Constraints NIPS 2020
Planning with General Objective Functions: Going Beyond Total Rewards NIPS 2020
Group-Fair Online Allocation in Continuous Time NIPS 2020
Latent Bandits Revisited NIPS 2020
Dynamic Regret of Convex and Smooth Functions NIPS 2020
Temporal Variability in Implicit Online Learning NIPS 2020
Restless-UCB, an Efficient and Low-complexity Algorithm for Online Restless Bandits NIPS 2020
Stage-wise Conservative Linear Bandits NIPS 2020
Online Sufficient Dimension Reduction Through Sliced Inverse Regression JMLR 2020
Open Problem: Model Selection for Contextual Bandits COLT 2020
Towards Alleviating Traffic Congestion: Optimal Route Planning for Massive-Scale Trips IJCAI 2020
Dynamic Multi-Robot Task Allocation under Uncertainty and Temporal Constraints RSS 2020
Lipschitz and Comparator-Norm Adaptivity in Online Learning COLT 2020
Tight Lower Bounds for Combinatorial Multi-Armed Bandits COLT 2020
Faster Projection-free Online Learning COLT 2020
No-Regret Prediction in Marginally Stable Systems COLT 2020
Coordination without communication: optimal regret in two players multi-armed bandits COLT 2020
Real-Time Dispatching of Large-Scale Ride-Sharing Systems: Integrating Optimization, Machine Learning, and Model Predictive Control IJCAI 2020