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

UniRank: Unimodal Bandit Algorithms for Online Ranking ICML 2022
Kernelized Multiplicative Weights for 0/1-Polyhedral Games: Bridging the Gap Between Learning in Extensive-Form and Normal-Form Games ICML 2022
Shuffle Private Linear Contextual Bandits ICML 2022
Online Competitive Influence Maximization AISTATS 2022
Saving Stochastic Bandits from Poisoning Attacks via Limited Data Verification AAAI 2022
Computationally Efficient Horizon-Free Reinforcement Learning for Linear Mixture MDPs NIPS 2022
Regret Bounds for Information-Directed Reinforcement Learning NIPS 2022
Online Apprenticeship Learning AAAI 2022
Robust Imitation via Mirror Descent Inverse Reinforcement Learning NIPS 2022
Conservative Dual Policy Optimization for Efficient Model-Based Reinforcement Learning NIPS 2022
Distributionally Adaptive Meta Reinforcement Learning NIPS 2022
Learn to Match with No Regret: Reinforcement Learning in Markov Matching Markets NIPS 2022
Near-Optimal Regret Bounds for Multi-batch Reinforcement Learning NIPS 2022
Exponential Family Model-Based Reinforcement Learning via Score Matching NIPS 2022
Near-Optimal Goal-Oriented Reinforcement Learning in Non-Stationary Environments NIPS 2022
Minimax Regret for Partial Monitoring: Infinite Outcomes and Rustichini’s Regret COLT 2022
Provably Efficient Model-Free Constrained RL with Linear Function Approximation NIPS 2022
Society of Agents: Regret Bounds of Concurrent Thompson Sampling NIPS 2022
Optimistic Posterior Sampling for Reinforcement Learning with Few Samples and Tight Guarantees NIPS 2022
Reinforcement Learning in a Birth and Death Process: Breaking the Dependence on the State Space NIPS 2022
An Information-Theoretic Framework for Deep Learning NIPS 2022
Optimal Control with Learning on the Fly: System with Unknown Drift L4DC 2022
Modeling Attrition in Recommender Systems with Departing Bandits AAAI 2022
Near-Optimal Randomized Exploration for Tabular Markov Decision Processes NIPS 2022
Learning Infinite-Horizon Average-Reward Restless Multi-Action Bandits via Index Awareness NIPS 2022