conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2,192 papers

Papers per year

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

Papers

Online Optimization of Video-Ad Allocation IJCAI 2017
Online Bridged Pruning for Real-Time Search with Arbitrary Lookaheads IJCAI 2017
Context Attentive Bandits: Contextual Bandit with Restricted Context IJCAI 2017
Efficiency Through Procrastination: Approximately Optimal Algorithm Configuration with Runtime Guarantees IJCAI 2017
Thresholding Bandits with Augmented UCB IJCAI 2017
Correlational Dueling Bandits with Application to Clinical Treatment in Large Decision Spaces IJCAI 2017
Playing Repeated Network Interdiction Games with Semi-Bandit Feedback IJCAI 2017
No Time to Observe: Adaptive Influence Maximization with Partial Feedback IJCAI 2017
Softpressure: A Schedule-Driven Backpressure Algorithm for Coping with Network Congestion IJCAI 2017
Efficient Mechanism Design for Online Scheduling (Extended Abstract) IJCAI 2017
Online Algorithm Selection IJCAI 2017
Online Bayesian Passive-Aggressive Learning JMLR 2017
An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback JMLR 2017
Perishability of Data: Dynamic Pricing under Varying-Coefficient Models JMLR 2017
Approximation Vector Machines for Large-scale Online Learning JMLR 2017
Following the Leader and Fast Rates in Online Linear Prediction: Curved Constraint Sets and Other Regularities JMLR 2017
Delta-net: Real-time Network Verification Using Atoms NSDI 2017
Threshold Bandits, With and Without Censored Feedback NIPS 2016
MetaGrad: Multiple Learning Rates in Online Learning NIPS 2016
Efficient Second Order Online Learning by Sketching NIPS 2016
Hardness of Online Sleeping Combinatorial Optimization Problems NIPS 2016
The Multi-fidelity Multi-armed Bandit NIPS 2016
Adaptive Concentration Inequalities for Sequential Decision Problems NIPS 2016
Refined Lower Bounds for Adversarial Bandits NIPS 2016
Coin Betting and Parameter-Free Online Learning NIPS 2016