← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Open Problem: Fast and Optimal Online Portfolio Selection COLT 2020
Optimal Algorithms for Stochastic Multi-Armed Bandits with Heavy Tailed Rewards NIPS 2020
Online Agnostic Boosting via Regret Minimization NIPS 2020
Cooperative Multi-player Bandit Optimization NIPS 2020
A/B Testing in Dense Large-Scale Networks: Design and Inference NIPS 2020
Finite Continuum-Armed Bandits NIPS 2020
Online MAP Inference of Determinantal Point Processes NIPS 2020
Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition NIPS 2020
Delay and Cooperation in Nonstochastic Linear Bandits NIPS 2020
Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits NIPS 2020
Small Nash Equilibrium Certificates in Very Large Games NIPS 2020
Geometric Exploration for Online Control NIPS 2020
Online Algorithms for Multi-shop Ski Rental with Machine Learned Advice NIPS 2020
From Finite to Countable-Armed Bandits NIPS 2020
Sliding Window Algorithms for k-Clustering Problems NIPS 2020
Better Full-Matrix Regret via Parameter-Free Online Learning NIPS 2020
On Regret with Multiple Best Arms NIPS 2020
Simple and Fast Algorithm for Binary Integer and Online Linear Programming NIPS 2020
Inference for Batched Bandits NIPS 2020
An Empirical Process Approach to the Union Bound: Practical Algorithms for Combinatorial and Linear Bandits NIPS 2020
Model Selection for Production System via Automated Online Experiments NIPS 2020
A PTAS for the Bayesian Thresholding Bandit Problem AISTATS 2020
Prophets, Secretaries, and Maximizing the Probability of Choosing the Best AISTATS 2020
The Quantile Snapshot Scan: Comparing Quantiles of Spatial Data from Two Snapshots in Time AISTATS 2020
Online Influence Maximization under Linear Threshold Model NIPS 2020