← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

How to Hedge an Option Against an Adversary: Black-Scholes Pricing is Minimax Optimal NIPS 2013
Information-theoretic lower bounds for distributed statistical estimation with communication constraints NIPS 2013
From Bandits to Experts: A Tale of Domination and Independence NIPS 2013
Online Learning with Switching Costs and Other Adaptive Adversaries NIPS 2013
Adaptive Submodular Maximization in Bandit Setting NIPS 2013
Minimax Optimal Algorithms for Unconstrained Linear Optimization NIPS 2013
Near-Optimal Entrywise Sampling for Data Matrices NIPS 2013
Regression-tree Tuning in a Streaming Setting NIPS 2013
Better Rates for Any Adversarial Deterministic MDP ICML 2013
Thompson Sampling in Switching Environments with Bayesian Online Change Detection AISTATS 2013
A Last-Step Regression Algorithm for Non-Stationary Online Learning AISTATS 2013
Localization and Adaptation in Online Learning AISTATS 2013
Optimal Discovery with Probabilistic Expert Advice: Finite Time Analysis and Macroscopic Optimality JMLR 2013
Sequential Transfer in Multi-armed Bandit with Finite Set of Models NIPS 2013
Learning Prices for Repeated Auctions with Strategic Buyers NIPS 2013
Adaptive Market Making via Online Learning NIPS 2013
Dimension-Free Exponentiated Gradient NIPS 2013
The Pareto Regret Frontier NIPS 2013
Online learning in episodic Markovian decision processes by relative entropy policy search NIPS 2013
Online Learning of Dynamic Parameters in Social Networks NIPS 2013
Online Learning in Markov Decision Processes with Adversarially Chosen Transition Probability Distributions NIPS 2013
Online Learning with Costly Features and Labels NIPS 2013
Top-k Selection based on Adaptive Sampling of Noisy Preferences ICML 2013
Beating Bandits in Gradually Evolving Worlds COLT 2013
A near-optimal algorithm for finite partial-monitoring games against adversarial opponents COLT 2013