← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Using More Data to Speed-up Training Time AISTATS 2012
Online Clustering of Processes AISTATS 2012
Stochastic Bandit Based on Empirical Moments AISTATS 2012
Towards Minimax Policies for Online Linear Optimization with Bandit Feedback COLT 2012
Near-Optimal Algorithms for Online Matrix Prediction COLT 2012
Unified Algorithms for Online Learning and Competitive Analysis COLT 2012
Risk-Aversion in Multi-armed Bandits NIPS 2012
Online Rank Aggregation ACML 2012
Online L1-Dictionary Learning with Application to Novel Document Detection NIPS 2012
Online Optimization with Gradual Variations COLT 2012
Online Submodular Minimization JMLR 2012
Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence NIPS 2012
Mirror Descent Meets Fixed Share (and feels no regret) NIPS 2012
Adaptive Learning of Smoothing Functions: Application to Electricity Load Forecasting NIPS 2012
Communication/Computation Tradeoffs in Consensus-Based Distributed Optimization NIPS 2012
Online allocation and homogeneous partitioning for piecewise constant mean-approximation NIPS 2012
Distributed Non-Stochastic Experts NIPS 2012
On Multilabel Classification and Ranking with Partial Feedback NIPS 2012
Optimistic Bayesian Sampling in Contextual-Bandit Problems JMLR 2012
Multi-armed Bandit Problems with History AISTATS 2012
Efficient Reinforcement Learning for High Dimensional Linear Quadratic Systems NIPS 2012
Efficient Monte Carlo Counterfactual Regret Minimization in Games with Many Player Actions NIPS 2012
Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints JMLR 2012
An Introduction to Artificial Prediction Markets for Classification JMLR 2012
Sparsity Regret Bounds for Individual Sequences in Online Linear Regression COLT 2011