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

Achieving Tractable Minimax Optimal Regret in Average Reward MDPs NIPS 2024
No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and NP-Hardness of Adversarial Full-Information Setting NIPS 2024
Stochastic Multi-Armed Bandits with Strongly Reward-Dependent Delays AISTATS 2024
PrIsing: Privacy-Preserving Peer Effect Estimation via Ising Model AISTATS 2024
Conformal Inference for Online Prediction with Arbitrary Distribution Shifts JMLR 2024
Stochastic contextual bandits with graph feedback: from independence number to MAS number NIPS 2024
Provably Efficient Interactive-Grounded Learning with Personalized Reward NIPS 2024
No-Regret Bandit Exploration based on Soft Tree Ensemble Model NIPS 2024
Stopping Bayesian Optimization with Probabilistic Regret Bounds NIPS 2024
Almost Free: Self-concordance in Natural Exponential Families and an Application to Bandits NIPS 2024
Learning Dynamic Mechanisms in Unknown Environments: A Reinforcement Learning Approach JMLR 2024
Bridging Distributional and Risk-sensitive Reinforcement Learning with Provable Regret Bounds JMLR 2024
Online Control in Population Dynamics NIPS 2024
Functional Graphical Models: Structure Enables Offline Data-Driven Optimization AISTATS 2024
Online Learning in Contextual Second-Price Pay-Per-Click Auctions AISTATS 2024
Monte Carlo Tree Search in the Presence of Transition Uncertainty AAAI 2024
A Best-of-both-worlds Algorithm for Bandits with Delayed Feedback with Robustness to Excessive Delays NIPS 2024
Warm-up Free Policy Optimization: Improved Regret in Linear Markov Decision Processes NIPS 2024
Sum-max Submodular Bandits AISTATS 2024
Convergence to Nash Equilibrium and No-regret Guarantee in (Markov) Potential Games AISTATS 2024
State-free Reinforcement Learning NIPS 2024
Thompson Sampling For Combinatorial Bandits: Polynomial Regret and Mismatched Sampling Paradox NIPS 2024
Accurate Parameter Estimation for Safety-Critical Systems with Unmodeled Dynamics (Abstract Reprint) AAAI 2024
Multitask Online Learning: Listen to the Neighborhood Buzz AISTATS 2024
Thompson Sampling Itself is Differentially Private AISTATS 2024