conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2,192 papers

Papers per year

1
16
59
225
69
'05
'10
'15
'20
'25

Papers

The Pareto Regret Frontier for Bandits NIPS 2015
Predtron: A Family of Online Algorithms for General Prediction Problems NIPS 2015
Online Learning with Adversarial Delays NIPS 2015
Fast Convergence of Regularized Learning in Games NIPS 2015
Communication Complexity of Distributed Convex Learning and Optimization NIPS 2015
Streaming Min-max Hypergraph Partitioning NIPS 2015
Linear Multi-Resource Allocation with Semi-Bandit Feedback NIPS 2015
Online Learning with Gaussian Payoffs and Side Observations NIPS 2015
Copeland Dueling Bandits NIPS 2015
On Top-k Selection in Multi-Armed Bandits and Hidden Bipartite Graphs NIPS 2015
Anytime Influence Bounds and the Explosive Behavior of Continuous-Time Diffusion Networks NIPS 2015
Regret-Based Pruning in Extensive-Form Games NIPS 2015
Regret Lower Bound and Optimal Algorithm in Finite Stochastic Partial Monitoring NIPS 2015
Smooth Interactive Submodular Set Cover NIPS 2015
Adaptive Stochastic Optimization: From Sets to Paths NIPS 2015
Explore no more: Improved high-probability regret bounds for non-stochastic bandits NIPS 2015
Budgeted Bandit Problems with Continuous Random Costs ACML 2015
Online Optimization : Competing with Dynamic Comparators AISTATS 2015
Sparse Dueling Bandits AISTATS 2015
Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits AISTATS 2015
Open Problem: Online Sabotaged Shortest Path COLT 2015
Online Learning with Feedback Graphs: Beyond Bandits COLT 2015
Minimax Fixed-Design Linear Regression COLT 2015
Bandit Convex Optimization: \sqrtT Regret in One Dimension COLT 2015
Sequential Information Maximization: When is Greedy Near-optimal? COLT 2015