conftrace_

linear contextual bandit

24 papers

Explore in graph

Also known as

LCB

Co-occurring keywords

regret bound (1926) contextual bandit (381) online learning (1777) linear bandit (124) federated learning (1333) multi-armed bandit (1098) regret minimization (315) representation learning (6206) knapsack problem (39) federated bandit (3)

Papers

Local Anti-Concentration Class: Logarithmic Regret for Greedy Linear Contextual Bandit NIPS 2024
Federated Linear Contextual Bandits with Heterogeneous Clients AISTATS 2024
Best-of-Both-Worlds Algorithms for Linear Contextual Bandits AISTATS 2024
Strategic Linear Contextual Bandits NIPS 2024
Improved Algorithms for Multi-period Multi-class Packing Problems with Bandit Feedback ICML 2023
On the Interplay Between Misspecification and Sub-optimality Gap in Linear Contextual Bandits ICML 2023
Multi-task Representation Learning with Stochastic Linear Bandits AISTATS 2023
Squeeze All: Novel Estimator and Self-Normalized Bound for Linear Contextual Bandits AISTATS 2023
Federated Linear Contextual Bandits with User-level Differential Privacy ICML 2023
Pessimism for Offline Linear Contextual Bandits using $\ell_p$ Confidence Sets NIPS 2022
Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions NIPS 2022
Asynchronous Upper Confidence Bound Algorithms for Federated Linear Bandits AISTATS 2022
Encrypted Linear Contextual Bandit AISTATS 2022
Shuffle Private Linear Contextual Bandits ICML 2022
A Reduction from Linear Contextual Bandits Lower Bounds to Estimations Lower Bounds ICML 2022
Smoothed Adversarial Linear Contextual Bandits with Knapsacks ICML 2022
Leveraging Good Representations in Linear Contextual Bandits ICML 2021
Confidence-Budget Matching for Sequential Budgeted Learning ICML 2021
Online Limited Memory Neural-Linear Bandits with Likelihood Matching ICML 2021
Federated Linear Contextual Bandits NIPS 2021
OSOM: A simultaneously optimal algorithm for multi-armed and linear contextual bandits AISTATS 2020
Stochastic Linear Contextual Bandits with Diverse Contexts AISTATS 2020
Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits COLT 2019
A Smoothed Analysis of the Greedy Algorithm for the Linear Contextual Bandit Problem NIPS 2018