← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2190 directly classified papers

Papers per year

Papers

Online to Offline Conversions, Universality and Adaptive Minibatch Sizes NIPS 2017
Open Problem: First-Order Regret Bounds for Contextual Bandits COLT 2017
Welfare Guarantees from Data NIPS 2017
Online Convex Optimization with Stochastic Constraints NIPS 2017
Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe NIPS 2017
Logarithmic Time One-Against-Some ICML 2017
Consistent k-Clustering ICML 2017
Identify the Nash Equilibrium in Static Games with Random Payoffs ICML 2017
Thresholding Bandits with Augmented UCB IJCAI 2017
Softpressure: A Schedule-Driven Backpressure Algorithm for Coping with Network Congestion IJCAI 2017
Minimal Exploration in Structured Stochastic Bandits NIPS 2017
Near Minimax Optimal Players for the Finite-Time 3-Expert Prediction Problem NIPS 2017
Conservative Contextual Linear Bandits NIPS 2017
Multi-Armed Bandits with Metric Movement Costs NIPS 2017
Delta-net: Real-time Network Verification Using Atoms NSDI 2017
Tracking the Best Expert in Non-stationary Stochastic Environments NIPS 2016
EC-Cache: Load-Balanced, Low-Latency Cluster Caching with Online Erasure Coding OSDI 2016
Refined Lower Bounds for Adversarial Bandits NIPS 2016
Pareto Front Identification from Stochastic Bandit Feedback AISTATS 2016
Optimization as Estimation with Gaussian Processes in Bandit Settings AISTATS 2016
A Bandit Framework for Strategic Regression NIPS 2016
Online Pricing with Strategic and Patient Buyers NIPS 2016
Regret of Queueing Bandits NIPS 2016
Gains and Losses are Fundamentally Different in Regret Minimization: The Sparse Case JMLR 2016
Importance Weighting Without Importance Weights: An Efficient Algorithm for Combinatorial Semi-Bandits JMLR 2016