conftrace_

regret minimization

315 papers

Explore in graph

Co-occurring keywords

online learning (1777) multi-armed bandit (1098) regret bound (1926) stochastic optimization (1060) game theory (854) online algorithm (445) reinforcement learning (4352) markov decision process (790) nash equilibrium (398) extensive-form game (86)

Papers

Improved Confidence Bounds for the Linear Logistic Model and Applications to Bandits ICML 2021
Pure Exploration and Regret Minimization in Matching Bandits ICML 2021
On Lower Bounds for Standard and Robust Gaussian Process Bandit Optimization ICML 2021
Top-k eXtreme Contextual Bandits with Arm Hierarchy ICML 2021
Implicit Finite-Horizon Approximation and Efficient Optimal Algorithms for Stochastic Shortest Path NIPS 2021
Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization NIPS 2021
Near-Optimal No-Regret Learning in General Games NIPS 2021
Local Differential Privacy for Regret Minimization in Reinforcement Learning NIPS 2021
Oracle-Efficient Regret Minimization in Factored MDPs with Unknown Structure NIPS 2021
Reinforcement Learning in Linear MDPs: Constant Regret and Representation Selection NIPS 2021
Regret Minimization Experience Replay in Off-Policy Reinforcement Learning NIPS 2021
RL for Latent MDPs: Regret Guarantees and a Lower Bound NIPS 2021
Conic Blackwell Algorithm: Parameter-Free Convex-Concave Saddle-Point Solving NIPS 2021
Model-Free Online Learning in Unknown Sequential Decision Making Problems and Games AAAI 2021
Policy Optimization as Online Learning with Mediator Feedback AAAI 2021
Finding and Certifying (Near-)Optimal Strategies in Black-Box Extensive-Form Games AAAI 2021
Online Boosting with Bandit Feedback ALT 2021
Regret Minimization in Heavy-Tailed Bandits COLT 2021
Stochastic Regret Minimization in Extensive-Form Games ICML 2020
Online mirror descent and dual averaging: keeping pace in the dynamic case ICML 2020
Knowing The What But Not The Where in Bayesian Optimization ICML 2020
Near-optimal Regret Bounds for Stochastic Shortest Path ICML 2020
Distance-Based Equilibria in Normal-Form Games AAAI 2020
An Interactive Regret-Based Genetic Algorithm for Solving Multi-Objective Combinatorial Optimization Problems AAAI 2020
Meta-learning with Stochastic Linear Bandits ICML 2020