conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2,192 papers

Papers per year

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

Papers

An Efficient Streaming Algorithm for the Submodular Cover Problem NIPS 2016
Provable Efficient Online Matrix Completion via Non-convex Stochastic Gradient Descent NIPS 2016
Designing smoothing functions for improved worst-case competitive ratio in online optimization NIPS 2016
Tracking the Best Expert in Non-stationary Stochastic Environments NIPS 2016
Regret of Queueing Bandits NIPS 2016
Dual Space Gradient Descent for Online Learning NIPS 2016
Online Pricing with Strategic and Patient Buyers NIPS 2016
Optimistic Gittins Indices NIPS 2016
Multi-armed Bandits: Competing with Optimal Sequences NIPS 2016
Multiple-Play Bandits in the Position-Based Model NIPS 2016
Online Convex Optimization with Unconstrained Domains and Losses NIPS 2016
Following the Leader and Fast Rates in Linear Prediction: Curved Constraint Sets and Other Regularities NIPS 2016
Double Thompson Sampling for Dueling Bandits NIPS 2016
Combinatorial Multi-Armed Bandit with General Reward Functions NIPS 2016
Optimistic Bandit Convex Optimization NIPS 2016
Phased Exploration with Greedy Exploitation in Stochastic Combinatorial Partial Monitoring Games NIPS 2016
A Bandit Framework for Strategic Regression NIPS 2016
Improved Regret Bounds for Oracle-Based Adversarial Contextual Bandits NIPS 2016
Contextual semibandits via supervised learning oracles NIPS 2016
Combinatorial semi-bandit with known covariance NIPS 2016
On Explore-Then-Commit strategies NIPS 2016
Linear Contextual Bandits with Knapsacks NIPS 2016
Dueling Bandits: Beyond Condorcet Winners to General Tournament Solutions NIPS 2016
Revealing Graph Bandits for Maximizing Local Influence AISTATS 2016
Random Forest for the Contextual Bandit Problem AISTATS 2016