← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Strongly Adaptive Online Learning ICML 2015
Competing with the Empirical Risk Minimizer in a Single Pass COLT 2015
Revenue Optimization against Strategic Buyers NIPS 2015
Adaptive Strategy for Stratified Monte Carlo Sampling JMLR 2015
Contextual Dueling Bandits COLT 2015
Sparse Dueling Bandits AISTATS 2015
Smooth Interactive Submodular Set Cover NIPS 2015
Anytime Influence Bounds and the Explosive Behavior of Continuous-Time Diffusion Networks NIPS 2015
Communication Complexity of Distributed Convex Learning and Optimization NIPS 2015
On-Line Learning Algorithms for Path Experts with Non-Additive Losses COLT 2015
Adaptive Online Learning NIPS 2015
Budgeted Bandit Problems with Continuous Random Costs ACML 2015
Sequential Information Maximization: When is Greedy Near-optimal? COLT 2015
Bandit Convex Optimization: \sqrtT Regret in One Dimension COLT 2015
Minimax Fixed-Design Linear Regression COLT 2015
Open Problem: Online Sabotaged Shortest Path COLT 2015
The Pareto Regret Frontier for Bandits NIPS 2015
Adaptive Stochastic Optimization: From Sets to Paths NIPS 2015
Predtron: A Family of Online Algorithms for General Prediction Problems NIPS 2015
Fast Convergence of Regularized Learning in Games NIPS 2015
Online Learning with Feedback Graphs: Beyond Bandits COLT 2015
Online Optimization : Competing with Dynamic Comparators AISTATS 2015
Copeland Dueling Bandits NIPS 2015
Streaming Min-max Hypergraph Partitioning NIPS 2015
Online Learning with Gaussian Payoffs and Side Observations NIPS 2015