Online Learning

Open Problem: Online Local Learning COLT 2014 Open Problem: Shifting Experts on Easy Data COLT 2014 Optimal Regret Minimization in Posted-Price Auctions with Strategic Buyers NeurIPS 2014 Prediction with Limited Advice and Multiarmed Bandits with Paid Observations ICML 2014 Reducing Dueling Bandits to Cardinal Bandits ICML 2014 Repeated Contextual Auctions with Strategic Buyers NeurIPS 2014 Robust Online Multi-Object Tracking based on Tracklet Confidence and Online Discriminative Appearance Learning CVPR 2014 Scalable Kernel Methods via Doubly Stochastic Gradients NeurIPS 2014 Sequential crowdsourced labeling as an epsilon-greedy exploration in a Markov Decision Process AISTATS 2014 Shaping Social Activity by Incentivizing Users NeurIPS 2014 Simultaneous Model Selection and Optimization through Parameter-free Stochastic Learning NeurIPS 2014 Stochastic Multi-Armed-Bandit Problem with Non-stationary Rewards NeurIPS 2014 The Blinded Bandit: Learning with Adaptive Feedback NeurIPS 2014 Thompson Sampling for Complex Online Problems ICML 2014 Three Guidelines of Online Learning for Large-Scale Visual Recognition CVPR 2014 Towards Minimax Online Learning with Unknown Time Horizon ICML 2014 Unconstrained Online Linear Learning in Hilbert Spaces: Minimax Algorithms and Normal Approximations COLT 2014 Adaptive Market Making via Online Learning NeurIPS 2013 Adaptive Submodular Maximization in Bandit Setting NeurIPS 2013 Adaptive Task Assignment for Crowdsourced Classification ICML 2013 A Gang of Bandits NeurIPS 2013 A Last-Step Regression Algorithm for Non-Stationary Online Learning AISTATS 2013 Algebraic classifiers: a generic approach to fast cross-validation, online training, and parallel training ICML 2013 Approachability, fast and slow COLT 2013 A simple sketching algorithm for entropy estimation over streaming data AISTATS 2013