Online Algorithms

Online Optimization with Gradual Variations COLT 2012 Online Rank Aggregation ACML 2012 Online Submodular Minimization JMLR 2012 Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits AISTATS 2012 On Multilabel Classification and Ranking with Partial Feedback NeurIPS 2012 Optimistic Bayesian Sampling in Contextual-Bandit Problems JMLR 2012 Risk-Aversion in Multi-armed Bandits NeurIPS 2012 Stochastic Bandit Based on Empirical Moments AISTATS 2012 Towards Minimax Policies for Online Linear Optimization with Bandit Feedback COLT 2012 Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints JMLR 2012 Unified Algorithms for Online Learning and Competitive Analysis COLT 2012 Using More Data to Speed-up Training Time AISTATS 2012 A Bayesian Approximation Method for Online Ranking JMLR 2011 Active Diagnosis under Persistent Noise with Unknown Noise Distribution: A Rank-Based Approach AISTATS 2011 Adaptive Bandits: Towards the best history-dependent strategy AISTATS 2011 Adaptive Hedge NeurIPS 2011 A simple multi-armed bandit algorithm with optimal variation-bounded regret COLT 2011 Better Algorithms for Benign Bandits JMLR 2011 Budgeted Optimization with Concurrent Stochastic-Duration Experiments NeurIPS 2011 Committing Bandits NeurIPS 2011 Complexity-Based Approach to Calibration with Checking Rules COLT 2011 Confidence Weighted Mean Reversion Strategy for On-Line Portfolio Selection AISTATS 2011 Contextual Bandit Algorithms with Supervised Learning Guarantees AISTATS 2011 Contextual Bandits with Similarity Information COLT 2011 Double Updating Online Learning JMLR 2011