Saved in:
| Main Authors: | Gu, Yuzhou, Han, Yanjun, Qian, Jian |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2503.00273 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability
by: Chen, Fan, et al.
Published: (2024)
by: Chen, Fan, et al.
Published: (2024)
Quantile Multi-Armed Bandits with 1-bit Feedback
by: Lau, Ivan, et al.
Published: (2025)
by: Lau, Ivan, et al.
Published: (2025)
Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention
by: Yang, Junwen, et al.
Published: (2024)
by: Yang, Junwen, et al.
Published: (2024)
Diminishing Exploration: A Minimalist Approach to Piecewise Stationary Multi-Armed Bandits
by: Li, Kuan-Ta, et al.
Published: (2024)
by: Li, Kuan-Ta, et al.
Published: (2024)
Optimal Arm Elimination Algorithms for Combinatorial Bandits
by: Wen, Yuxiao, et al.
Published: (2025)
by: Wen, Yuxiao, et al.
Published: (2025)
On the Benefits of Free Exploration for Regret Minimization in Multi-Armed Bandits
by: Hou, Yunlong, et al.
Published: (2026)
by: Hou, Yunlong, et al.
Published: (2026)
Statistical Complexity and Optimal Algorithms for Non-linear Ridge Bandits
by: Rajaraman, Nived, et al.
Published: (2023)
by: Rajaraman, Nived, et al.
Published: (2023)
Instantiating Bayesian CVaR lower bounds in Interactive Decision Making Problems
by: Bongole, Raghav, et al.
Published: (2026)
by: Bongole, Raghav, et al.
Published: (2026)
Near-Optimal Regret for KL-Regularized Multi-Armed Bandits
by: Ji, Kaixuan, et al.
Published: (2026)
by: Ji, Kaixuan, et al.
Published: (2026)
Online Clustering of Data Sequences with Bandit Information
by: Chandran, G Dhinesh, et al.
Published: (2025)
by: Chandran, G Dhinesh, et al.
Published: (2025)
On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization
by: Ji, Kaixuan, et al.
Published: (2026)
by: Ji, Kaixuan, et al.
Published: (2026)
Causal Feature Selection Method for Contextual Multi-Armed Bandits in Recommender System
by: Zhao, Zhenyu, et al.
Published: (2024)
by: Zhao, Zhenyu, et al.
Published: (2024)
Restless Linear Bandits
by: Khaleghi, Azadeh
Published: (2024)
by: Khaleghi, Azadeh
Published: (2024)
Multi-Armed Bandits With Machine Learning-Generated Surrogate Rewards
by: Ji, Wenlong, et al.
Published: (2025)
by: Ji, Wenlong, et al.
Published: (2025)
Optimal Clustering with Bandit Feedback
by: Yang, Junwen, et al.
Published: (2022)
by: Yang, Junwen, et al.
Published: (2022)
The Conditional Cauchy-Schwarz Divergence with Applications to Time-Series Data and Sequential Decision Making
by: Yu, Shujian, et al.
Published: (2023)
by: Yu, Shujian, et al.
Published: (2023)
Collaborative Multi-Agent Heterogeneous Multi-Armed Bandits
by: Chawla, Ronshee, et al.
Published: (2023)
by: Chawla, Ronshee, et al.
Published: (2023)
Cost-Efficient Online Decision Making: A Combinatorial Multi-Armed Bandit Approach
by: Rahbar, Arman, et al.
Published: (2023)
by: Rahbar, Arman, et al.
Published: (2023)
A Modularized Framework for Piecewise-Stationary Restless Bandits
by: Li, Kuan-Ta, et al.
Published: (2026)
by: Li, Kuan-Ta, et al.
Published: (2026)
Joint Value Estimation and Bidding in Repeated First-Price Auctions
by: Wen, Yuxiao, et al.
Published: (2025)
by: Wen, Yuxiao, et al.
Published: (2025)
Optimal No-regret Learning in Repeated First-price Auctions
by: Han, Yanjun, et al.
Published: (2020)
by: Han, Yanjun, et al.
Published: (2020)
Batched Kernelized Bandits: Refinements and Extensions
by: Ma, Chenkai, et al.
Published: (2026)
by: Ma, Chenkai, et al.
Published: (2026)
Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability
by: Zhao, Qingyue, et al.
Published: (2026)
by: Zhao, Qingyue, et al.
Published: (2026)
Optimizing Sharpe Ratio: Risk-Adjusted Decision-Making in Multi-Armed Bandits
by: Khurshid, Sabrina, et al.
Published: (2024)
by: Khurshid, Sabrina, et al.
Published: (2024)
Bandit Convex Optimization with Gradient Prediction Adaptivity
by: Wang, Shuche, et al.
Published: (2026)
by: Wang, Shuche, et al.
Published: (2026)
Lower Bounds for Time-Varying Kernelized Bandits
by: Cai, Xu, et al.
Published: (2024)
by: Cai, Xu, et al.
Published: (2024)
Conversational Dueling Bandits in Generalized Linear Models
by: Yang, Shuhua, et al.
Published: (2024)
by: Yang, Shuhua, et al.
Published: (2024)
Differentiable Information Bottleneck for Deterministic Multi-view Clustering
by: Yan, Xiaoqiang, et al.
Published: (2024)
by: Yan, Xiaoqiang, et al.
Published: (2024)
Multi-Agent Combinatorial-Multi-Armed-Bandit framework for the Submodular Welfare Problem under Bandit Feedback
by: Pokhriyal, Subham, et al.
Published: (2026)
by: Pokhriyal, Subham, et al.
Published: (2026)
Combinatorial Multi-armed Bandits: Arm Selection via Group Testing
by: Mukherjee, Arpan, et al.
Published: (2024)
by: Mukherjee, Arpan, et al.
Published: (2024)
Competing Bandits in Matching Markets via Super Stability
by: Basu, Soumya
Published: (2025)
by: Basu, Soumya
Published: (2025)
Regret Bounds for Noise-Free Cascaded Kernelized Bandits
by: Li, Zihan, et al.
Published: (2022)
by: Li, Zihan, et al.
Published: (2022)
On Instability of Minimax Optimal Optimism-Based Bandit Algorithms
by: Praharaj, Samya, et al.
Published: (2025)
by: Praharaj, Samya, et al.
Published: (2025)
Decision Making in Changing Environments: Robustness, Query-Based Learning, and Differential Privacy
by: Chen, Fan, et al.
Published: (2025)
by: Chen, Fan, et al.
Published: (2025)
Improved Regret Bounds for Linear Bandits with Heavy-Tailed Rewards
by: Tajdini, Artin, et al.
Published: (2025)
by: Tajdini, Artin, et al.
Published: (2025)
Optimal Best Arm Identification with Fixed Confidence in Restless Bandits
by: Karthik, P. N., et al.
Published: (2023)
by: Karthik, P. N., et al.
Published: (2023)
Regret Tail Characterization of Optimal Bandit Algorithms with Generic Rewards
by: Panda, Subhodip, et al.
Published: (2026)
by: Panda, Subhodip, et al.
Published: (2026)
Indexed Minimum Empirical Divergence-Based Algorithms for Linear Bandits
by: Bian, Jie, et al.
Published: (2024)
by: Bian, Jie, et al.
Published: (2024)
Online Estimation via Offline Estimation: An Information-Theoretic Framework
by: Foster, Dylan J., et al.
Published: (2024)
by: Foster, Dylan J., et al.
Published: (2024)
The (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions
by: Wen, Yuxiao, et al.
Published: (2026)
by: Wen, Yuxiao, et al.
Published: (2026)
Similar Items
-
Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability
by: Chen, Fan, et al.
Published: (2024) -
Quantile Multi-Armed Bandits with 1-bit Feedback
by: Lau, Ivan, et al.
Published: (2025) -
Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention
by: Yang, Junwen, et al.
Published: (2024) -
Diminishing Exploration: A Minimalist Approach to Piecewise Stationary Multi-Armed Bandits
by: Li, Kuan-Ta, et al.
Published: (2024) -
Optimal Arm Elimination Algorithms for Combinatorial Bandits
by: Wen, Yuxiao, et al.
Published: (2025)