← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Online Learning in Contextual Bandits using Gated Linear Networks NIPS 2020
A Duality Approach for Regret Minimization in Average-Award Ergodic Markov Decision Processes L4DC 2020
Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent NIPS 2020
Online Evaluation of Audiences for Targeted Advertising via Bandit Experiments AAAI 2020
Multi-Player Bandits: The Adversarial Case JMLR 2020
Bounded Rationality in Las Vegas: Probabilistic Finite Automata Play Multi-Armed Bandits UAI 2020
Generalized Policy Elimination: an efficient algorithm for Nonparametric Contextual Bandits UAI 2020
A Unified Model for the Two-stage Offline-then-Online Resource Allocation IJCAI 2020
Efficient and Robust High-Dimensional Linear Contextual Bandits IJCAI 2020
Themis: Fair and Efficient GPU Cluster Scheduling NSDI 2020
Improved Sleeping Bandits with Stochastic Action Sets and Adversarial Rewards ICML 2020
Budgeted Online Influence Maximization ICML 2020
Streaming k-Submodular Maximization under Noise subject to Size Constraint ICML 2020
Achieving Fairness in the Stochastic Multi-Armed Bandit Problem AAAI 2020
Sol: Fast Distributed Computation Over Slow Networks NSDI 2020
Online Dense Subgraph Discovery via Blurred-Graph Feedback ICML 2020
Preselection Bandits ICML 2020
Logarithmic Regret for Online Gradient Descent Beyond Strong Convexity AISTATS 2019
Online Pandora’s Boxes and Bandits AAAI 2019
An Efficient Algorithm for Skeptical Preferred Acceptance in Dynamic Argumentation Frameworks IJCAI 2019
A*+IDA*: A Simple Hybrid Search Algorithm IJCAI 2019
A Theory of Selective Prediction COLT 2019
Lipschitz Adaptivity with Multiple Learning Rates in Online Learning COLT 2019
Batch-Size Independent Regret Bounds for the Combinatorial Multi-Armed Bandit Problem COLT 2019
AdaLinUCB: Opportunistic Learning for Contextual Bandits IJCAI 2019