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

Learning to Rank under Multinomial Logit Choice JMLR 2023
Last Switch Dependent Bandits with Monotone Payoff Functions ICML 2023
Provably Efficient Generalized Lagrangian Policy Optimization for Safe Multi-Agent Reinforcement Learning L4DC 2023
On the Complexity of Representation Learning in Contextual Linear Bandits AISTATS 2023
Interpolating Classifiers Make Few Mistakes JMLR 2023
Probably Anytime-Safe Stochastic Combinatorial Semi-Bandits ICML 2023
Trading-Off Payments and Accuracy in Online Classification with Paid Stochastic Experts ICML 2023
Communication-Constrained Bandits under Additive Gaussian Noise ICML 2023
Dynamical Linear Bandits ICML 2023
Bandits with Knapsacks: Advice on Time-Varying Demands ICML 2023
Multiplier Bootstrap-based Exploration ICML 2023
Bandit Online Linear Optimization with Hints and Queries ICML 2023
Competing against Adaptive Strategies in Online Learning via Hints AISTATS 2023
Pricing against a Budget and ROI Constrained Buyer AISTATS 2023
No-Regret Learning in Two-Echelon Supply Chain with Unknown Demand Distribution AISTATS 2023
Nearly Minimax Optimal Reinforcement Learning for Linear Markov Decision Processes ICML 2023
Leveraging Demonstrations to Improve Online Learning: Quality Matters ICML 2023
Exploration in Linear Bandits with Rich Action Sets and its Implications for Inference AISTATS 2023
A Second-Order Method for Stochastic Bandit Convex Optimisation COLT 2023
Semi-Parametric Contextual Pricing Algorithm using Cox Proportional Hazards Model ICML 2023
Bandit Submodular Maximization for Multi-Robot Coordination in Unpredictable and Partially Observable Environments RSS 2023
Incentive-aware Contextual Pricing with Non-parametric Market Noise AISTATS 2023
Constrained Efficient Global Optimization of Expensive Black-box Functions ICML 2023
Double Doubly Robust Thompson Sampling for Generalized Linear Contextual Bandits AAAI 2023
Tighter PAC-Bayes Bounds Through Coin-Betting COLT 2023