← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Online Learning of Eigenvectors ICML 2015
The Hedge Algorithm on a Continuum ICML 2015
Efficient Learning in Large-Scale Combinatorial Semi-Bandits ICML 2015
Simple regret for infinitely many armed bandits ICML 2015
Cheap Bandits ICML 2015
Online Time Series Prediction with Missing Data ICML 2015
Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits AISTATS 2015
Online Sketching Hashing CVPR 2015
Improved Regret Bounds for Undiscounted Continuous Reinforcement Learning ICML 2015
On Top-k Selection in Multi-Armed Bandits and Hidden Bipartite Graphs NIPS 2015
Fighting Bandits with a New Kind of Smoothness NIPS 2015
Explore no more: Improved high-probability regret bounds for non-stochastic bandits NIPS 2015
Online Density Estimation of Bradley-Terry Models COLT 2015
First-order regret bounds for combinatorial semi-bandits COLT 2015
Batched Bandit Problems COLT 2015
Hierarchies of Relaxations for Online Prediction Problems with Evolving Constraints COLT 2015
Regret-Based Pruning in Extensive-Form Games NIPS 2015
Regret Lower Bound and Optimal Algorithm in Finite Stochastic Partial Monitoring NIPS 2015
Faster Algorithms for Testing under Conditional Sampling COLT 2015
Plug-and-Play Dual-Tree Algorithm Runtime Analysis JMLR 2015
Fast Rates in Statistical and Online Learning JMLR 2015
On Identifying Good Options under Combinatorially Structured Feedback in Finite Noisy Environments ICML 2015
Linear Multi-Resource Allocation with Semi-Bandit Feedback NIPS 2015
Response-Based Approachability with Applications to Generalized No-Regret Problems JMLR 2015
A Square Root Inverse Filter for Efficient Vision-aided Inertial Navigation on Mobile Devices RSS 2015