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

Fairness and Welfare Quantification for Regret in Multi-Armed Bandits AAAI 2023
A Distribution Optimization Framework for Confidence Bounds of Risk Measures ICML 2023
What can online reinforcement learning with function approximation benefit from general coverage conditions? ICML 2023
Double Doubly Robust Thompson Sampling for Generalized Linear Contextual Bandits AAAI 2023
Learning to Bid in Repeated First-Price Auctions with Budgets ICML 2023
Online Reinforcement Learning with Uncertain Episode Lengths AAAI 2023
Online Clustering of Bandits with Misspecified User Models NIPS 2023
Stochastic Contextual Bandits with Long Horizon Rewards AAAI 2023
Nearly Optimal Algorithms with Sublinear Computational Complexity for Online Kernel Regression ICML 2023
Bandit Task Assignment with Unknown Processing Time NIPS 2023
Near-optimal Conservative Exploration in Reinforcement Learning under Episode-wise Constraints ICML 2023
On Instance-Dependent Bounds for Offline Reinforcement Learning with Linear Function Approximation AAAI 2023
Constrained Efficient Global Optimization of Expensive Black-box Functions ICML 2023
Online Pricing for Multi-User Multi-Item Markets NIPS 2023
Pareto Regret Analyses in Multi-objective Multi-armed Bandit ICML 2023
Optimal Algorithms for Latent Bandits with Cluster Structure AISTATS 2023
Trading-Off Payments and Accuracy in Online Classification with Paid Stochastic Experts ICML 2023
Competing for Shareable Arms in Multi-Player Multi-Armed Bandits ICML 2023
Efficient Rate Optimal Regret for Adversarial Contextual MDPs Using Online Function Approximation ICML 2023
Online Mechanism Design for Information Acquisition ICML 2023
Weighted Tallying Bandits: Overcoming Intractability via Repeated Exposure Optimality ICML 2023
Generalized Implicit Follow-The-Regularized-Leader ICML 2023
On-Demand Communication for Asynchronous Multi-Agent Bandits AISTATS 2023
Understanding the Role of Feedback in Online Learning with Switching Costs ICML 2023
Improved Algorithms for Multi-period Multi-class Packing Problems with Bandit Feedback ICML 2023