conftrace_
← Optimization & Theory
Machine Learning › Optimization & Theory ›

Online Algorithms

806 papers

Papers per year

6
24
87
21
'10
'15
'20
'25

Papers

Open Problem: Parameter-Free and Scale-Free Online Algorithms COLT 2016
An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits COLT 2016
Online Learning and Blackwell Approachability in Quitting Games COLT 2016
Online Sparse Linear Regression COLT 2016
Optimal Best Arm Identification with Fixed Confidence COLT 2016
Maximin Action Identification: A New Bandit Framework for Games COLT 2016
Online Learning with Low Rank Experts COLT 2016
On the capacity of information processing systems COLT 2016
Simple Bayesian Algorithms for Best Arm Identification COLT 2016
Online Collaborative Learning for Open-Vocabulary Visual Classifiers CVPR 2016
Multi-Player Bandits – a Musical Chairs Approach ICML 2016
Tracking Slowly Moving Clairvoyant: Optimal Dynamic Regret of Online Learning with True and Noisy Gradient ICML 2016
Online Learning with Feedback Graphs Without the Graphs ICML 2016
Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm ICML 2016
Contextual Combinatorial Cascading Bandits ICML 2016
Conservative Bandits ICML 2016
No-Regret Algorithms for Heavy-Tailed Linear Bandits ICML 2016
An optimal algorithm for the Thresholding Bandit Problem ICML 2016
BISTRO: An Efficient Relaxation-Based Method for Contextual Bandits ICML 2016
Efficient Algorithms for Adversarial Contextual Learning ICML 2016
On the Complexity of Best-Arm Identification in Multi-Armed Bandit Models JMLR 2016
Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms JMLR 2016
Gains and Losses are Fundamentally Different in Regret Minimization: The Sparse Case JMLR 2016
REX: A Development Platform and Online Learning Approach for Runtime Emergent Software Systems OSDI 2016
Online Learning for Adversaries with Memory: Price of Past Mistakes NIPS 2015