Online Algorithms

Exploration vs Exploitation vs Safety: Risk-Aware Multi-Armed Bandits ACML 2013 Fast Scheduling of Multi-Robot Teams with Temporospatial Constraints RSS 2013 From Bandits to Experts: A Tale of Domination and Independence NeurIPS 2013 Generic Exploration and K-armed Voting Bandits ICML 2013 How to Hedge an Option Against an Adversary: Black-Scholes Pricing is Minimax Optimal NeurIPS 2013 Information-theoretic lower bounds for distributed statistical estimation with communication constraints NeurIPS 2013 Learning Policies for Contextual Submodular Prediction ICML 2013 Learning Prices for Repeated Auctions with Strategic Buyers NeurIPS 2013 Localization and Adaptation in Online Learning AISTATS 2013 Lower Bounds and Selectivity of Weak-Consistent Policies in Stochastic Multi-Armed Bandit Problem JMLR 2013 Minimax Optimal Algorithms for Unconstrained Linear Optimization NeurIPS 2013 Multiple Identifications in Multi-Armed Bandits ICML 2013 Near-Optimal Entrywise Sampling for Data Matrices NeurIPS 2013 One-Pass AUC Optimization ICML 2013 Online Coverage by a Tethered Autonomous Mobile Robot in Planar Unknown Environments RSS 2013 Online learning in episodic Markovian decision processes by relative entropy policy search NeurIPS 2013 Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions NeurIPS 2013 Online Learning of Dynamic Parameters in Social Networks NeurIPS 2013 Online Learning under Delayed Feedback ICML 2013 Online Learning with Costly Features and Labels NeurIPS 2013 Online Learning with Switching Costs and Other Adaptive Adversaries NeurIPS 2013 On the Complexity of Bandit and Derivative-Free Stochastic Convex Optimization COLT 2013 Optimal Discovery with Probabilistic Expert Advice: Finite Time Analysis and Macroscopic Optimality JMLR 2013 Prediction by random-walk perturbation COLT 2013 Ranked Bandits in Metric Spaces: Learning Diverse Rankings over Large Document Collections JMLR 2013