← Optimization & Theory
Machine Learning › Optimization & Theory ›

Online Algorithms

803 directly classified papers

Papers per year

Papers

Efficient Explorative Key-Term Selection Strategies for Conversational Contextual Bandits AAAI 2023
Near-optimal Conservative Exploration in Reinforcement Learning under Episode-wise Constraints ICML 2023
Nonstochastic Contextual Combinatorial Bandits AISTATS 2023
Online Learning for Non-monotone DR-Submodular Maximization: From Full Information to Bandit Feedback AISTATS 2023
Bandits with costly reward observations UAI 2023
Exploration for Free: How Does Reward Heterogeneity Improve Regret in Cooperative Multi-agent Bandits? UAI 2023
No-Regret Learning in Two-Echelon Supply Chain with Unknown Demand Distribution AISTATS 2023
Open Problem: Learning sparse linear concepts by priming the features COLT 2023
Multi-task Representation Learning for Pure Exploration in Bilinear Bandits NIPS 2023
Efficient Batched Algorithm for Contextual Linear Bandits with Large Action Space via Soft Elimination NIPS 2023
Smooth Non-stationary Bandits ICML 2023
Online Learning for Traffic Routing under Unknown Preferences AISTATS 2023
No-Regret Learning with Unbounded Losses: The Case of Logarithmic Pooling NIPS 2023
Communication-Constrained Bandits under Additive Gaussian Noise ICML 2023
An Efficient Algorithm for Fair Multi-Agent Multi-Armed Bandit with Low Regret AAAI 2023
Top K Ranking for Multi-Armed Bandit with Noisy Evaluations AISTATS 2022
Learning Competitive Equilibria in Exchange Economies with Bandit Feedback AISTATS 2022
Non-stationary Online Learning with Memory and Non-stochastic Control AISTATS 2022
Nonstochastic Bandits and Experts with Arm-Dependent Delays AISTATS 2022
Optimal Dynamic Regret in Proper Online Learning with Strongly Convex Losses and Beyond AISTATS 2022
k-experts - Online Policies and Fundamental Limits AISTATS 2022
Follow-the-Perturbed-Leader for Adversarial Markov Decision Processes with Bandit Feedback NIPS 2022
A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits NIPS 2022
(Optimal) Online Bipartite Matching with Degree Information NIPS 2022
On Efficient Online Imitation Learning via Classification NIPS 2022