conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2,192 papers

Papers per year

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

Papers

Anytime optimal algorithms in stochastic multi-armed bandits ICML 2016
No-Regret Algorithms for Heavy-Tailed Linear Bandits ICML 2016
Pricing a Low-regret Seller ICML 2016
Shifting Regret, Mirror Descent, and Matrices ICML 2016
Horizontally Scalable Submodular Maximization ICML 2016
A Closer Look at Adaptive Regret JMLR 2016
OLPS: A Toolbox for On-Line Portfolio Selection JMLR 2016
Large Scale Online Kernel Learning JMLR 2016
Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms JMLR 2016
An Information-Theoretic Analysis of Thompson Sampling JMLR 2016
Learning Algorithms for Second-Price Auctions with Reserve JMLR 2016
An Online Convex Optimization Approach to Blackwell's Approachability JMLR 2016
Importance Weighting Without Importance Weights: An Efficient Algorithm for Combinatorial Semi-Bandits JMLR 2016
Online PCA with Optimal Regret JMLR 2016
Data-driven Rank Breaking for Efficient Rank Aggregation JMLR 2016
Machine Learning in an Auction Environment JMLR 2016
Gains and Losses are Fundamentally Different in Regret Minimization: The Sparse Case JMLR 2016
EC-Cache: Load-Balanced, Low-Latency Cluster Caching with Online Erasure Coding OSDI 2016
Slicer: Auto-Sharding for Datacenter Applications OSDI 2016
Online Gradient Boosting NIPS 2015
Combinatorial Bandits Revisited NIPS 2015
Adaptive Online Learning NIPS 2015
Bandit Smooth Convex Optimization: Improving the Bias-Variance Tradeoff NIPS 2015
Revenue Optimization against Strategic Buyers NIPS 2015
Fighting Bandits with a New Kind of Smoothness NIPS 2015