conftrace_

regret bound

1926 papers

Explore in graph

Also known as

RB

Co-occurring keywords

online learning (1777) multi-armed bandit (1098) contextual bandit (381) stochastic optimization (1060) reinforcement learning (4352) online algorithm (445) upper confidence bound (197) markov decision process (790) thompson sampling (237) online convex optimization (165)

Papers

Functional Graphical Models: Structure Enables Offline Data-Driven Optimization AISTATS 2024
Constant or Logarithmic Regret in Asynchronous Multiplayer Bandits with Limited Communication AISTATS 2024
Near-optimal Per-Action Regret Bounds for Sleeping Bandits AISTATS 2024
Optimal Algorithms for Online Convex Optimization with Adversarial Constraints NIPS 2024
Online Learning with Sublinear Best-Action Queries NIPS 2024
Maximizing utility in multi-agent environments by anticipating the behavior of other learners NIPS 2024
Gradient-Variation Online Learning under Generalized Smoothness NIPS 2024
Fair Online Bilateral Trade NIPS 2024
Universal Online Convex Optimization with $1$ Projection per Round NIPS 2024
Convergence to Nash Equilibrium and No-regret Guarantee in (Markov) Potential Games AISTATS 2024
Towards Efficient and Optimal Covariance-Adaptive Algorithms for Combinatorial Semi-Bandits NIPS 2024
SPEED: Experimental Design for Policy Evaluation in Linear Heteroscedastic Bandits AISTATS 2024
Fully Unconstrained Online Learning NIPS 2024
Differentially Private Reinforcement Learning with Self-Play NIPS 2024
Online Learning of Delayed Choices NIPS 2024
Best-of-Both-Worlds Algorithms for Linear Contextual Bandits AISTATS 2024
Improved Regret for Bandit Convex Optimization with Delayed Feedback NIPS 2024
Regret Bounds for Risk-sensitive Reinforcement Learning with Lipschitz Dynamic Risk Measures AISTATS 2024
On the Model-Misspecification in Reinforcement Learning AISTATS 2024
Risk Seeking Bayesian Optimization under Uncertainty for Obtaining Extremum AISTATS 2024
Faster Recalibration of an Online Predictor via Approachability AISTATS 2024
Improved Regret of Linear Ensemble Sampling NIPS 2024
Towards Achieving Sub-linear Regret and Hard Constraint Violation in Model-free RL AISTATS 2024
Conformal Inference for Online Prediction with Arbitrary Distribution Shifts JMLR 2024
Monte Carlo Tree Search in the Presence of Transition Uncertainty AAAI 2024