← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Improved Regret Bounds for Bandit Combinatorial Optimization NIPS 2019
Online Learning via the Differential Privacy Lens NIPS 2019
Optimistic Regret Minimization for Extensive-Form Games via Dilated Distance-Generating Functions NIPS 2019
Efficient Regret Minimization Algorithm for Extensive-Form Correlated Equilibrium NIPS 2019
Online EXP3 Learning in Adversarial Bandits with Delayed Feedback NIPS 2019
Stochastic Bandits with Context Distributions NIPS 2019
Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online Optimization NIPS 2019
Correlated bandits or: How to minimize mean-squared error online ICML 2019
Connections Between Mirror Descent, Thompson Sampling and the Information Ratio NIPS 2019
Scale-free adaptive planning for deterministic dynamics & discounted rewards ICML 2019
Online Convex Optimization in Adversarial Markov Decision Processes ICML 2019
The Parameterized Complexity of Cascading Portfolio Scheduling NIPS 2019
A Robust Non-Clairvoyant Dynamic Mechanism for Contextual Auctions NIPS 2019
Online High Rank Matrix Completion CVPR 2019
Dynamic Vehicle Traffic Control Using Deep Reinforcement Learning in Automated Material Handling System AAAI 2019
On the Computational Power of Online Gradient Descent COLT 2019
Lifelong Optimization with Low Regret AISTATS 2019
Optimal Testing in the Experiment-rich Regime AISTATS 2019
Reallocating Multiple Facilities on the Line IJCAI 2019
Cascaded Algorithm-Selection and Hyper-Parameter Optimization with Extreme-Region Upper Confidence Bound Bandit IJCAI 2019
Learning to Prune: Speeding up Repeated Computations COLT 2019
An Information-Theoretic Approach to Minimax Regret in Partial Monitoring COLT 2019
Pure entropic regularization for metrical task systems COLT 2019
Profitable Bandits ACML 2018
Contextual Bandits for Adapting Treatment in a Mouse Model of de Novo Carcinogenesis MLHC 2018