Online Algorithms

Repeated Contextual Auctions with Strategic Buyers NeurIPS 2014 Robust Online Gesture Recognition with Crowdsourced Annotations JMLR 2014 Sample Complexity Bounds on Differentially Private Learning via Communication Complexity COLT 2014 Simultaneous Model Selection and Optimization through Parameter-free Stochastic Learning NeurIPS 2014 Spectral Bandits for Smooth Graph Functions ICML 2014 Streaming, Memory Limited Algorithms for Community Detection NeurIPS 2014 The Blinded Bandit: Learning with Adaptive Feedback NeurIPS 2014 Thompson Sampling for Complex Online Problems ICML 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 Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms ICML 2014 Achievability of Asymptotic Minimax Regret in Online and Batch Prediction ACML 2013 Adaptive Market Making via Online Learning NeurIPS 2013 Adaptive Submodular Maximization in Bandit Setting NeurIPS 2013 A Last-Step Regression Algorithm for Non-Stationary Online Learning AISTATS 2013 Almost Optimal Exploration in Multi-Armed Bandits ICML 2013 A near-optimal algorithm for finite partial-monitoring games against adversarial opponents COLT 2013 A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret COLT 2013 Beating Bandits in Gradually Evolving Worlds COLT 2013 Better Rates for Any Adversarial Deterministic MDP ICML 2013 Bounded regret in stochastic multi-armed bandits COLT 2013 Computing the Stationary Distribution Locally NeurIPS 2013 Dimension-Free Exponentiated Gradient NeurIPS 2013 Distributed Exploration in Multi-Armed Bandits NeurIPS 2013 Dynamical Models and tracking regret in online convex programming ICML 2013