conftrace_

minimax regret

74 papers

Explore in graph

Co-occurring keywords

online learning (1777) regret bound (1926) multi-armed bandit (1098) contextual bandit (381) partial monitoring (32) logarithmic loss (13) bandit feedback (118) markov decision process (790) online algorithm (445) sequential probability assignment (4)

Papers

Sparse Nonparametric Contextual Bandits ALT 2026
Phase Transition of Regret for Logistic Regression with Large Weights ALT 2026
On the Minimax Regret for Contextual Linear Bandits and Multi-Armed Bandits with Expert Advice NIPS 2024
Nearly Minimax Optimal Regret for Multinomial Logistic Bandit NIPS 2024
Smoothness-Adaptive Dynamic Pricing with Nonparametric Demand Learning AISTATS 2024
Linear bandits with polylogarithmic minimax regret COLT 2024
Locally Private and Robust Multi-Armed Bandits NIPS 2024
Corruption-Robust Linear Bandits: Minimax Optimality and Gap-Dependent Misspecification NIPS 2024
Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity NIPS 2024
A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of $\Theta(T^{2/3})$ and its Application to Best-of-Both-Worlds NIPS 2024
The Real Price of Bandit Information in Multiclass Classification COLT 2024
Achieving Tractable Minimax Optimal Regret in Average Reward MDPs NIPS 2024
Coevolutionary Algorithm for Building Robust Decision Trees under Minimax Regret AAAI 2024
Sequential Probability Assignment with Contexts: Minimax Regret, Contextual Shtarkov Sums, and Contextual Normalized Maximum Likelihood NIPS 2024
Near-Minimax-Optimal Risk-Sensitive Reinforcement Learning with CVaR ICML 2023
Online Learning with Feedback Graphs: The True Shape of Regret ICML 2023
Understanding the Role of Feedback in Online Learning with Switching Costs ICML 2023
Repeated Bilateral Trade Against a Smoothed Adversary COLT 2023
Empirical Bayes via ERM and Rademacher complexities: the Poisson model COLT 2023
Robust Planning over Restless Groups: Engagement Interventions for a Large-Scale Maternal Telehealth Program AAAI 2023
On the Minimax Regret for Online Learning with Feedback Graphs NIPS 2023
CLUTR: Curriculum Learning via Unsupervised Task Representation Learning ICML 2023
Minimax Regret for Cascading Bandits NIPS 2022
Minimax Regret on Patterns Using Kullback-Leibler Divergence Covering COLT 2022
Return of the bias: Almost minimax optimal high probability bounds for adversarial linear bandits COLT 2022