conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Online Algorithms

2,192 papers

Papers per year

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

Papers

One Gradient Frank-Wolfe for Decentralized Online Convex and Submodular Optimization ACML 2022
CVaR-Regret Bounds for Multi-armed Bandits ACML 2022
Norm-Agnostic Linear Bandits AISTATS 2022
Approximate Function Evaluation via Multi-Armed Bandits AISTATS 2022
k-experts - Online Policies and Fundamental Limits AISTATS 2022
Exploiting Correlation to Achieve Faster Learning Rates in Low-Rank Preference Bandits AISTATS 2022
Jointly Efficient and Optimal Algorithms for Logistic Bandits AISTATS 2022
Learning to Plan Variable Length Sequences of Actions with a Cascading Bandit Click Model of User Feedback AISTATS 2022
A Last Switch Dependent Analysis of Satiation and Seasonality in Bandits AISTATS 2022
Online Page Migration with ML Advice AISTATS 2022
Nonstochastic Bandits and Experts with Arm-Dependent Delays AISTATS 2022
Non-stationary Online Learning with Memory and Non-stochastic Control AISTATS 2022
Efficient Kernelized UCB for Contextual Bandits AISTATS 2022
Parameter-Free Online Linear Optimization with Side Information via Universal Coin Betting AISTATS 2022
Robust Stochastic Linear Contextual Bandits Under Adversarial Attacks AISTATS 2022
Approximate Top-$m$ Arm Identification with Heterogeneous Reward Variances AISTATS 2022
Thompson Sampling with a Mixture Prior AISTATS 2022
Adversarial Tracking Control via Strongly Adaptive Online Learning with Memory AISTATS 2022
Debiasing Samples from Online Learning Using Bootstrap AISTATS 2022
Best Arm Identification with Safety Constraints AISTATS 2022
A Non-asymptotic Approach to Best-Arm Identification for Gaussian Bandits AISTATS 2022
Solving Multi-Arm Bandit Using a Few Bits of Communication AISTATS 2022
Online Competitive Influence Maximization AISTATS 2022
Scale-Free Adversarial Multi Armed Bandits ALT 2022
Distributed Online Learning for Joint Regret with Communication Constraints ALT 2022