conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2,192 papers

Papers per year

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

Papers

Regional Multi-Armed Bandits AISTATS 2018
Efficient Bandit Combinatorial Optimization Algorithm with Zero-suppressed Binary Decision Diagrams AISTATS 2018
Best arm identification in multi-armed bandits with delayed feedback AISTATS 2018
A fully adaptive algorithm for pure exploration in linear bandits AISTATS 2018
Contextual Bandits with Stochastic Experts AISTATS 2018
Generalized Binary Search For Split-Neighborly Problems AISTATS 2018
Online Regression with Partial Information: Generalization and Linear Projection AISTATS 2018
Multi-objective Contextual Bandit Problem with Similarity Information AISTATS 2018
Competing with Automata-based Expert Sequences AISTATS 2018
Combinatorial Semi-Bandits with Knapsacks AISTATS 2018
Adaptive Sampling for Coarse Ranking AISTATS 2018
Online Continuous Submodular Maximization AISTATS 2018
HONES: A Fast and Tuning-free Homotopy Method For Online Newton Step AISTATS 2018
Online Ensemble Multi-kernel Learning Adaptive to Non-stationary and Adversarial Environments AISTATS 2018
Pure Exploration in Infinitely-Armed Bandit Models with Fixed-Confidence ALT 2018
{Multi-Player Bandits Revisited} ALT 2018
Sparsity, variance and curvature in multi-armed bandits ALT 2018
Bandit Regret Scaling with the Effective Loss Range ALT 2018
A Better Resource Allocation Algorithm with Semi-Bandit Feedback ALT 2018
Sequential prediction with coded side information under logarithmic loss ALT 2018
Minimax Rates and Efficient Algorithms for Noisy Sorting ALT 2018
Online Variance Reduction for Stochastic Optimization COLT 2018
Private Sequential Learning COLT 2018
Nonstochastic Bandits with Composite Anonymous Feedback COLT 2018
Adaptivity to Smoothness in X-armed bandits COLT 2018