Online Learning

Stochastic Online Anomaly Analysis for Streaming Time Series IJCAI 2017 Streaming Sparse Gaussian Process Approximations NeurIPS 2017 The Price of Differential Privacy for Online Learning ICML 2017 Universal consistency and minimax rates for online Mondrian Forests NeurIPS 2017 Adaptive Algorithms for Online Convex Optimization with Long-term Constraints ICML 2016 An Online Sequence-to-Sequence Model Using Partial Conditioning NeurIPS 2016 BISTRO: An Efficient Relaxation-Based Method for Contextual Bandits ICML 2016 Budgeted stream-based active learning via adaptive submodular maximization NeurIPS 2016 Coin Betting and Parameter-Free Online Learning NeurIPS 2016 Cost Sensitive Online Multiple Kernel Classification ACML 2016 DCM Bandits: Learning to Rank with Multiple Clicks ICML 2016 Designing smoothing functions for improved worst-case competitive ratio in online optimization NeurIPS 2016 Dual Space Gradient Descent for Online Learning NeurIPS 2016 Efficient Second Order Online Learning by Sketching NeurIPS 2016 Following the Leader and Fast Rates in Linear Prediction: Curved Constraint Sets and Other Regularities NeurIPS 2016 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 Large Scale Online Kernel Learning JMLR 2016 Learning Online Smooth Predictors for Realtime Camera Planning Using Recurrent Decision Trees CVPR 2016 MetaGrad: Multiple Learning Rates in Online Learning NeurIPS 2016 Minimizing Regret on Reflexive Banach Spaces and Nash Equilibria in Continuous Zero-Sum Games NeurIPS 2016 Multi-armed Bandits: Competing with Optimal Sequences NeurIPS 2016