Skip to content
conftrace_

minimax regret

93 papers

Papers

A Tight Lower Bound for Non-stochastic Multi-armed Bandits with Expert Advice COLT 2026 Expert Advice with Costly Observations UAI 2026 Information-Theoretic Lower Bounds for Causal Inference under Credal Uncertainty UAI 2026 Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach COLT 2026 Phase Transition of Regret for Logistic Regression with Large Weights ALT 2026 Sparse Nonparametric Contextual Bandits ALT 2026 Adaptive Data Collection for Robust Learning Across Multiple Distributions ICML 2025 On the Minimax Regret of Sequential Probability Assignment via Square-Root Entropy COLT 2025 Robust Offline Policy Learning with Observational Data from Multiple Sources AISTATS 2025 Achieving Tractable Minimax Optimal Regret in Average Reward MDPs NeurIPS 2024 A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of Θ(T^2/3) and its Application to Best-of-Both-Worlds NeurIPS 2024 Causal Bandits: The Pareto Optimal Frontier of Adaptivity, a Reduction to Linear Bandits, and Limitations around Unknown Marginals ICML 2024 Coevolutionary Algorithm for Building Robust Decision Trees under Minimax Regret AAAI 2024 Corruption-Robust Linear Bandits: Minimax Optimality and Gap-Dependent Misspecification NeurIPS 2024 Linear bandits with polylogarithmic minimax regret COLT 2024 Locally Private and Robust Multi-Armed Bandits NeurIPS 2024 Nearly Minimax Optimal Regret for Multinomial Logistic Bandit NeurIPS 2024 On Interpolating Experts and Multi-Armed Bandits ICML 2024 Online Learning with Set-valued Feedback COLT 2024 On the Minimax Regret for Contextual Linear Bandits and Multi-Armed Bandits with Expert Advice NeurIPS 2024 Refining Minimax Regret for Unsupervised Environment Design ICML 2024 Reward-Free Curricula for Training Robust World Models ICLR 2024 Sequential Probability Assignment with Contexts: Minimax Regret, Contextual Shtarkov Sums, and Contextual Normalized Maximum Likelihood NeurIPS 2024 Smoothness-Adaptive Dynamic Pricing with Nonparametric Demand Learning AISTATS 2024 Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity NeurIPS 2024