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

Quantum Lipschitz Bandits AAAI 2026
Distribution-Dependent Rates for Multi-Distribution Learning ALT 2026
Distributionally Robust Online Markov Game with Linear Function Approximation AAAI 2026
Quantum Non-Linear Bandit Optimization AAAI 2026
Online Convex Optimization with Heavy Tails: Old Algorithms, New Regrets, and Applications ALT 2026
Eventually LIL Regret: Almost Sure $\ln\ln T$ Regret for a sub-Gaussian Mixture on Unbounded Data ALT 2026
Federated Linear Dueling Bandits AAAI 2026
Policy Zooming: Adaptive Discretization-based Infinite-Horizon Average-Reward Reinforcement Learning AAAI 2026
Provably Efficient Multi-Objective Bandit Algorithms Under Preference-Centric Customization AAAI 2026
Decentralized Online Convex Optimization with Unknown Feedback Delays AAAI 2026
Improved Regret in Stochastic Decision-Theoretic Online Learning under Differential Privacy ALT 2026
How to Set $\beta_1, \beta_2$ in Adam: An Online Learning Perspective ALT 2026
Enjoying Non-linearity in Multinomial Logistic Bandits: A Minimax-Optimal Algorithm ALT 2026
Robust Online Learning ALT 2026
ORVIT: Near-Optimal Online Distributionally Robust Reinforcement Learning AAAI 2026
Robust Decentralized Multi-armed Bandits: From Corruption-Resilience to Byzantine-Resilience AAAI 2026
Bootstrapping LLMs via Preference-Based Policy Optimization AAAI 2026
A Multi-Agent Conversational Bandit Approach to Online Evaluation and Selection of User-Aligned LLM Responses AAAI 2026
Extreme Value Monte Carlo Tree Search for Classical Planning AAAI 2026
Constrained Online Convex Optimization with Memory and Predictions AAAI 2026
Riemannian Manifold Learning for Stackelberg Games with Neural Flow Representations AAAI 2026
Online Linear Regression with Paid Stochastic Features AAAI 2026
Multiple-play Stochastic Bandits with Prioritized Arm Capacity Sharing AAAI 2026
ECPv2: Fast, Efficient, and Scalable Global Optimization of Lipschitz Functions AAAI 2026
Recycling History: Efficient Recommendations from Contextual Dueling Bandits ALT 2026