conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2,192 papers

Papers per year

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

Papers

Open Problem: First-Order Regret Bounds for Contextual Bandits COLT 2017
Corralling a Band of Bandit Algorithms COLT 2017
Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed Bandits, and Ranking from Pairwise Comparisons COLT 2017
Thompson Sampling for the MNL-Bandit COLT 2017
Algorithmic Chaining and the Role of Partial Feedback in Online Nonparametric Learning COLT 2017
Nearly Optimal Sampling Algorithms for Combinatorial Pure Exploration COLT 2017
Tight Bounds for Bandit Combinatorial Optimization COLT 2017
Online Learning Without Prior Information COLT 2017
ZigZag: A New Approach to Adaptive Online Learning COLT 2017
Bandits with Movement Costs and Adaptive Pricing COLT 2017
Sparse Stochastic Bandits COLT 2017
The Simulator: Understanding Adaptive Sampling in the Moderate-Confidence Regime COLT 2017
Online Summarization via Submodular and Convex Optimization CVPR 2017
Follow the Compressed Leader: Faster Online Learning of Eigenvectors and Faster MMWU ICML 2017
Emulating the Expert: Inverse Optimization through Online Learning ICML 2017
Lazifying Conditional Gradient Algorithms ICML 2017
Multi-objective Bandits: Optimizing the Generalized Gini Index ICML 2017
Logarithmic Time One-Against-Some ICML 2017
Consistent k-Clustering ICML 2017
Online Learning with Local Permutations and Delayed Feedback ICML 2017
Optimal and Adaptive Off-policy Evaluation in Contextual Bandits ICML 2017
Identify the Nash Equilibrium in Static Games with Random Payoffs ICML 2017
Online Roommate Allocation Problem IJCAI 2017
Recognizing Top-Monotonic Preference Profiles in Polynomial Time IJCAI 2017
Don't Bury your Head in Warnings: A Game-Theoretic Approach for Intelligent Allocation of Cyber-security Alerts IJCAI 2017