online learning

Gains and Losses are Fundamentally Different in Regret Minimization: The Sparse Case JMLR 2016 Hardness of Online Sleeping Combinatorial Optimization Problems NeurIPS 2016 Heteroscedastic Sequences: Beyond Gaussianity ICML 2016 Importance Weighting Without Importance Weights: An Efficient Algorithm for Combinatorial Semi-Bandits JMLR 2016 Incremental Variational Sparse Gaussian Process Regression NeurIPS 2016 Instance-dependent Regret Bounds for Dueling Bandits COLT 2016 Interactive Algorithms: from Pool to Stream COLT 2016 Large Scale Online Kernel Learning JMLR 2016 Learning brain regions via large-scale online structured sparse dictionary learning NeurIPS 2016 Learning from Rational Behavior: Predicting Solutions to Unknown Linear Programs NeurIPS 2016 Learning Online Smooth Predictors for Realtime Camera Planning Using Recurrent Decision Trees CVPR 2016 Local Sparsity Based Online Dictionary Learning for Environment-Adaptive Speech Enhancement with Nonnegative Matrix Factorization Interspeech 2016 Machine Learning in an Auction Environment JMLR 2016 Minimizing Regret on Reflexive Banach Spaces and Nash Equilibria in Continuous Zero-Sum Games NeurIPS 2016 Mistake Bounds for Binary Matrix Completion NeurIPS 2016 Multi-armed Bandits: Competing with Optimal Sequences NeurIPS 2016 Multiple-Play Bandits in the Position-Based Model NeurIPS 2016 Noise-Tolerant Life-Long Matrix Completion via Adaptive Sampling NeurIPS 2016 Object Tracking via Dual Linear Structured SVM and Explicit Feature Map CVPR 2016 OLPS: A Toolbox for On-Line Portfolio Selection JMLR 2016 Online Algorithms for Sum-Product Networks with Continuous Variables PGM 2016 Online (and Offline) Robust PCA: Novel Algorithms and Performance Guarantees AISTATS 2016 Online Bayesian Moment Matching for Topic Modeling with Unknown Number of Topics NeurIPS 2016 Online Collaborative Learning for Open-Vocabulary Visual Classifiers CVPR 2016 Online Isotonic Regression COLT 2016