conftrace_

sub-linear regret

15 papers

Explore in graph

Co-occurring keywords

regret bound (1926) online learning (1777) multi-armed bandit (1098) contextual bandit (381) markov decision process (790) streaming principal component analysis (7) adaptive control (47) online allocation (9) asymptotic optimality (32) adversarial attack (1621)

Papers

Multi-Agent Bandit Learning through Heterogeneous Action Erasure Channels AISTATS 2024
Efficient Model-Based Concave Utility Reinforcement Learning through Greedy Mirror Descent AISTATS 2024
Gaussian Process Bandits for Top-k Recommendations NIPS 2024
Federated Linear Contextual Bandits with Heterogeneous Clients AISTATS 2024
Reinforcement Learning Augmented Asymptotically Optimal Index Policy for Finite-Horizon Restless Bandits AAAI 2022
Robust Stochastic Linear Contextual Bandits Under Adversarial Attacks AISTATS 2022
Regularized Online Allocation Problems: Fairness and Beyond ICML 2021
Memory Efficient Online Meta Learning ICML 2021
Regret Minimisation in Multi-Armed Bandits Using Bounded Arm Memory AAAI 2020
Sub-linear Regret Bounds for Bayesian Optimisation in Unknown Search Spaces NIPS 2020
Streaming Principal Component Analysis in Noisy Setting ICML 2018
Near Optimal Exploration-Exploitation in Non-Communicating Markov Decision Processes NIPS 2018
Regret Bounds for Robust Adaptive Control of the Linear Quadratic Regulator NIPS 2018
Adaptive Smoothed Online Multi-Task Learning NIPS 2016
No-Regret Algorithms for Unconstrained Online Convex Optimization NIPS 2012