conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2,192 papers

Papers per year

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

Papers

On the Complexity of Bandit and Derivative-Free Stochastic Convex Optimization COLT 2013
Bounded regret in stochastic multi-armed bandits COLT 2013
Beating Bandits in Gradually Evolving Worlds COLT 2013
Prediction by random-walk perturbation COLT 2013
A near-optimal algorithm for finite partial-monitoring games against adversarial opponents COLT 2013
A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret COLT 2013
Multiple Identifications in Multi-Armed Bandits ICML 2013
Dynamical Models and tracking regret in online convex programming ICML 2013
Generic Exploration and K-armed Voting Bandits ICML 2013
Better Rates for Any Adversarial Deterministic MDP ICML 2013
One-Pass AUC Optimization ICML 2013
Top-k Selection based on Adaptive Sampling of Noisy Preferences ICML 2013
Almost Optimal Exploration in Multi-Armed Bandits ICML 2013
Learning Policies for Contextual Submodular Prediction ICML 2013
Online Learning under Delayed Feedback ICML 2013
Lower Bounds and Selectivity of Weak-Consistent Policies in Stochastic Multi-Armed Bandit Problem JMLR 2013
Ranked Bandits in Metric Spaces: Learning Diverse Rankings over Large Document Collections JMLR 2013
Optimal Discovery with Probabilistic Expert Advice: Finite Time Analysis and Macroscopic Optimality JMLR 2013
Online Coverage by a Tethered Autonomous Mobile Robot in Planar Unknown Environments RSS 2013
Fast Scheduling of Multi-Robot Teams with Temporospatial Constraints RSS 2013
On Multilabel Classification and Ranking with Partial Feedback NIPS 2012
Distributed Non-Stochastic Experts NIPS 2012
No-Regret Algorithms for Unconstrained Online Convex Optimization NIPS 2012
Efficient Monte Carlo Counterfactual Regret Minimization in Games with Many Player Actions NIPS 2012
Risk-Aversion in Multi-armed Bandits NIPS 2012