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

Fair Online Bilateral Trade NIPS 2024
Exploration, Exploitation, and Engagement in Multi-Armed Bandits with Abandonment JMLR 2024
SPEED: Experimental Design for Policy Evaluation in Linear Heteroscedastic Bandits AISTATS 2024
No-Regret Algorithms for Safe Bayesian Optimization with Monotonicity Constraints AISTATS 2024
Improved Regret of Linear Ensemble Sampling NIPS 2024
Horizon-Free and Instance-Dependent Regret Bounds for Reinforcement Learning with General Function Approximation AISTATS 2024
Putting Gale & Shapley to Work: Guaranteeing Stability Through Learning NIPS 2024
Piecewise-Stationary Bandits with Knapsacks NIPS 2024
Optimal Algorithms for Online Convex Optimization with Adversarial Constraints NIPS 2024
Regret Bounds for Risk-sensitive Reinforcement Learning with Lipschitz Dynamic Risk Measures AISTATS 2024
Improved Analysis for Bandit Learning in Matching Markets NIPS 2024
Contextual Decision-Making with Knapsacks Beyond the Worst Case NIPS 2024
Towards Achieving Sub-linear Regret and Hard Constraint Violation in Model-free RL AISTATS 2024
Safe Reinforcement Learning with Instantaneous Constraints: The Role of Aggressive Exploration AAAI 2024
Stochastic contextual bandits with graph feedback: from independence number to MAS number NIPS 2024
On the Model-Misspecification in Reinforcement Learning AISTATS 2024
Almost Free: Self-concordance in Natural Exponential Families and an Application to Bandits NIPS 2024
Regret Analysis of Policy Gradient Algorithm for Infinite Horizon Average Reward Markov Decision Processes AAAI 2024
Improved Bayes Regret Bounds for Multi-Task Hierarchical Bayesian Bandit Algorithms NIPS 2024
Forced Exploration in Bandit Problems AAAI 2024
How Does Variance Shape the Regret in Contextual Bandits? NIPS 2024
Improved Bandits in Many-to-One Matching Markets with Incentive Compatibility AAAI 2024
On the Necessity of Collaboration for Online Model Selection with Decentralized Data NIPS 2024
Federated X-armed Bandit AAAI 2024
When Is Inductive Inference Possible? NIPS 2024