conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2,192 papers

Papers per year

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

Papers

A Real-Time Game Theoretic Planner for Autonomous Two-Player Drone Racing RSS 2018
Real-Time Bidding with Side Information NIPS 2017
Online Learning with a Hint NIPS 2017
Online Learning of Optimal Bidding Strategy in Repeated Multi-Commodity Auctions NIPS 2017
Collecting Telemetry Data Privately NIPS 2017
Scalable Generalized Linear Bandits: Online Computation and Hashing NIPS 2017
Countering Feedback Delays in Multi-Agent Learning NIPS 2017
Affine-Invariant Online Optimization and the Low-rank Experts Problem NIPS 2017
Learning with Bandit Feedback in Potential Games NIPS 2017
Online Prediction with Selfish Experts NIPS 2017
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach NIPS 2017
Regret Analysis for Continuous Dueling Bandit NIPS 2017
Stochastic and Adversarial Online Learning without Hyperparameters NIPS 2017
Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation NIPS 2017
Online Influence Maximization under Independent Cascade Model with Semi-Bandit Feedback NIPS 2017
Online Dynamic Programming NIPS 2017
Training Deep Networks without Learning Rates Through Coin Betting NIPS 2017
Nonparametric Online Regression while Learning the Metric NIPS 2017
Online Learning with Transductive Regret NIPS 2017
Near Minimax Optimal Players for the Finite-Time 3-Expert Prediction Problem NIPS 2017
Revenue Optimization with Approximate Bid Predictions NIPS 2017
Rotting Bandits NIPS 2017
Bandits Dueling on Partially Ordered Sets NIPS 2017
Efficient Online Linear Optimization with Approximation Algorithms NIPS 2017
Improving Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms and Its Applications NIPS 2017