conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2,192 papers

Papers per year

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

Papers

Dying Experts: Efficient Algorithms with Optimal Regret Bounds NIPS 2019
ADDIS: an adaptive discarding algorithm for online FDR control with conservative nulls NIPS 2019
Batched Multi-armed Bandits Problem NIPS 2019
Weighted Linear Bandits for Non-Stationary Environments NIPS 2019
Learning to Screen NIPS 2019
Optimal Pricing in Repeated Posted-Price Auctions with Different Patience of the Seller and the Buyer NIPS 2019
Fast and Furious Learning in Zero-Sum Games: Vanishing Regret with Non-Vanishing Step Sizes NIPS 2019
Secretary Ranking with Minimal Inversions NIPS 2019
Equipping Experts/Bandits with Long-term Memory NIPS 2019
Censored Semi-Bandits: A Framework for Resource Allocation with Censored Feedback NIPS 2019
Online Markov Decoding: Lower Bounds and Near-Optimal Approximation Algorithms NIPS 2019
Model Selection for Contextual Bandits NIPS 2019
Online Prediction of Switching Graph Labelings with Cluster Specialists NIPS 2019
Learning to Correlate in Multi-Player General-Sum Sequential Games NIPS 2019
Procrastinating with Confidence: Near-Optimal, Anytime, Adaptive Algorithm Configuration NIPS 2019
Combinatorial Bandits with Relative Feedback NIPS 2019
Pure Exploration with Multiple Correct Answers NIPS 2019
Online Forecasting of Total-Variation-bounded Sequences NIPS 2019
Contextual Bandits with Cross-Learning NIPS 2019
Online Optimal Control with Linear Dynamics and Predictions: Algorithms and Regret Analysis NIPS 2019
Private Learning Implies Online Learning: An Efficient Reduction NIPS 2019
Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions NIPS 2019
Categorized Bandits NIPS 2019
Learning Multiple Markov Chains via Adaptive Allocation NIPS 2019
Decentralized Cooperative Stochastic Bandits NIPS 2019