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

Delayed Feedback in Generalised Linear Bandits Revisited AISTATS 2023
Optimal Contextual Bandits with Knapsacks under Realizability via Regression Oracles AISTATS 2023
Incentivizing Exploration with Linear Contexts and Combinatorial Actions ICML 2023
Instance-Optimality in Interactive Decision Making: Toward a Non-Asymptotic Theory COLT 2023
A Second-Order Method for Stochastic Bandit Convex Optimisation COLT 2023
Multi-task Representation Learning with Stochastic Linear Bandits AISTATS 2023
Piecewise Stationary Bandits under Risk Criteria AISTATS 2023
Online Learning for Non-monotone DR-Submodular Maximization: From Full Information to Bandit Feedback AISTATS 2023
Online Learning for Traffic Routing under Unknown Preferences AISTATS 2023
Bandit Submodular Maximization for Multi-Robot Coordination in Unpredictable and Partially Observable Environments RSS 2023
Tighter PAC-Bayes Bounds Through Coin-Betting COLT 2023
Linear Partial Monitoring for Sequential Decision Making: Algorithms, Regret Bounds and Applications JMLR 2023
Bandit problems with fidelity rewards JMLR 2023
Online Reinforcement Learning in Stochastic Continuous-Time Systems COLT 2023
A New Look at Dynamic Regret for Non-Stationary Stochastic Bandits JMLR 2023
Dimension Reduction in Contextual Online Learning via Nonparametric Variable Selection JMLR 2023
VCG Mechanism Design with Unknown Agent Values under Stochastic Bandit Feedback JMLR 2023
Graph-Aided Online Multi-Kernel Learning JMLR 2023
Tight Guarantees for Interactive Decision Making with the Decision-Estimation Coefficient COLT 2023
Cooperative Multi-Agent Reinforcement Learning: Asynchronous Communication and Linear Function Approximation ICML 2023
Bounding the optimal value function in compositional reinforcement learning UAI 2023
Bandits with costly reward observations UAI 2023
Exploration for Free: How Does Reward Heterogeneity Improve Regret in Cooperative Multi-agent Bandits? UAI 2023
Optimistic Thompson Sampling-based algorithms for episodic reinforcement learning UAI 2023
Sharper Model-free Reinforcement Learning for Average-reward Markov Decision Processes COLT 2023