conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2,192 papers

Papers per year

1
16
59
225
69
'05
'10
'15
'20
'25

Papers

Pure entropic regularization for metrical task systems COLT 2019
Artificial Constraints and Hints for Unbounded Online Learning COLT 2019
Combining Online Learning Guarantees COLT 2019
Better Algorithms for Stochastic Bandits with Adversarial Corruptions COLT 2019
Sample complexity of partition identification using multi-armed bandits COLT 2019
An Information-Theoretic Approach to Minimax Regret in Partial Monitoring COLT 2019
Batch-Size Independent Regret Bounds for the Combinatorial Multi-Armed Bandit Problem COLT 2019
Lipschitz Adaptivity with Multiple Learning Rates in Online Learning COLT 2019
A Theory of Selective Prediction COLT 2019
Large-Scale, Metric Structure From Motion for Unordered Light Fields CVPR 2019
Online High Rank Matrix Completion CVPR 2019
Query-focused Sentence Compression in Linear Time EMNLP 2019
GSLAM: A General SLAM Framework and Benchmark ICCV 2019
Online Control with Adversarial Disturbances ICML 2019
Scale-free adaptive planning for deterministic dynamics & discounted rewards ICML 2019
Pareto Optimal Streaming Unsupervised Classification ICML 2019
Correlated bandits or: How to minimize mean-squared error online ICML 2019
Target Tracking for Contextual Bandits: Application to Demand Side Management ICML 2019
Dynamic Learning with Frequent New Product Launches: A Sequential Multinomial Logit Bandit Problem ICML 2019
Competing Against Nash Equilibria in Adversarially Changing Zero-Sum Games ICML 2019
Online learning with kernel losses ICML 2019
PAC Identification of Many Good Arms in Stochastic Multi-Armed Bandits ICML 2019
Learning Linear-Quadratic Regulators Efficiently with only $\sqrtT$ Regret ICML 2019
Online Learning with Sleeping Experts and Feedback Graphs ICML 2019
Submodular Cost Submodular Cover with an Approximate Oracle ICML 2019