← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Bandit Smooth Convex Optimization: Improving the Bias-Variance Tradeoff NIPS 2015
Efficient Visual-Inertial Navigation using a Rolling-Shutter Camera with Inaccurate Timestamps RSS 2014
A Drifting-Games Analysis for Online Learning and Applications to Boosting NIPS 2014
Reducing Dueling Bandits to Cardinal Bandits ICML 2014
Extreme bandits NIPS 2014
Spectral Bandits for Smooth Graph Functions ICML 2014
Online combinatorial optimization with stochastic decision sets and adversarial losses NIPS 2014
Thompson Sampling for Complex Online Problems ICML 2014
Online Linear Optimization via Smoothing COLT 2014
Most Correlated Arms Identification COLT 2014
Improved Bounds for Online Learning Over the Permutahedron and Other Ranking Polytopes AISTATS 2014
Open Problem: Shifting Experts on Easy Data COLT 2014
Lipschitz Bandits: Regret Lower Bound and Optimal Algorithms COLT 2014
Unconstrained Online Linear Learning in Hilbert Spaces: Minimax Algorithms and Normal Approximations COLT 2014
Approachability in unknown games: Online learning meets multi-objective optimization COLT 2014
Sample Complexity Bounds on Differentially Private Learning via Communication Complexity COLT 2014
Discovering, Learning and Exploiting Relevance NIPS 2014
Best-Arm Identification in Linear Bandits NIPS 2014
Simultaneous Model Selection and Optimization through Parameter-free Stochastic Learning NIPS 2014
Follow the Leader If You Can, Hedge If You Must JMLR 2014
Bounded Regret for Finite-Armed Structured Bandits NIPS 2014
Conditional Swap Regret and Conditional Correlated Equilibrium NIPS 2014
Delay-Tolerant Algorithms for Asynchronous Distributed Online Learning NIPS 2014
Streaming, Memory Limited Algorithms for Community Detection NIPS 2014
Combinatorial Pure Exploration of Multi-Armed Bandits NIPS 2014