Online Learning

Fast Convergence of Regularized Learning in Games NeurIPS 2015 Fighting Bandits with a New Kind of Smoothness NeurIPS 2015 Label Consistent Quadratic Surrogate Model for Visual Saliency Prediction CVPR 2015 Label optimal regret bounds for online local learning COLT 2015 Learning Sparse Low-Threshold Linear Classifiers JMLR 2015 Learning Theory and Algorithms for Forecasting Non-stationary Time Series NeurIPS 2015 Linear Multi-Resource Allocation with Semi-Bandit Feedback NeurIPS 2015 Logarithmic Time Online Multiclass prediction NeurIPS 2015 Minimax Time Series Prediction NeurIPS 2015 No-Regret Learning in Bayesian Games NeurIPS 2015 Online F-Measure Optimization NeurIPS 2015 Online Gradient Boosting NeurIPS 2015 On-Line Learning Algorithms for Path Experts with Non-Additive Losses COLT 2015 Online Learning for Adversaries with Memory: Price of Past Mistakes NeurIPS 2015 Online Learning with Adversarial Delays NeurIPS 2015 Online Learning with Feedback Graphs: Beyond Bandits COLT 2015 Online Learning with Gaussian Payoffs and Side Observations NeurIPS 2015 Online Prediction at the Limit of Zero Temperature NeurIPS 2015 Online Sketching Hashing CVPR 2015 Online Time Series Prediction with Missing Data ICML 2015 Optimal and Adaptive Algorithms for Online Boosting ICML 2015 Predtron: A Family of Online Algorithms for General Prediction Problems NeurIPS 2015 Qualitative Multi-Armed Bandits: A Quantile-Based Approach ICML 2015 Regret Lower Bound and Optimal Algorithm in Finite Stochastic Partial Monitoring NeurIPS 2015 Smooth Interactive Submodular Set Cover NeurIPS 2015