Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2510.00073 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909817880182784 |
|---|---|
| author | Li, Zhekai Ma, Tianyi Hua, Cheng Zhu, Ruihao |
| author_facet | Li, Zhekai Ma, Tianyi Hua, Cheng Zhu, Ruihao |
| contents | Motivated by the need to efficiently identify multiple candidates in high trial-and-error cost tasks such as drug discovery, we propose a near-optimal algorithm to identify all ε-best arms (i.e., those at most ε worse than the optimum). Specifically, we introduce LinFACT, an algorithm designed to optimize the identification of all ε-best arms in linear bandits. We establish a novel information-theoretic lower bound on the sample complexity of this problem and demonstrate that LinFACT achieves instance optimality by matching this lower bound up to a logarithmic factor. A key ingredient of our proof is to integrate the lower bound directly into the scaling process for upper bound derivation, determining the termination round and thus the sample complexity. We also extend our analysis to settings with model misspecification and generalized linear models. Numerical experiments, including synthetic and real drug discovery data, demonstrate that LinFACT identifies more promising candidates with reduced sample complexity, offering significant computational efficiency and accelerating early-stage exploratory experiments. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_00073 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Identifying All ε-Best Arms in (Misspecified) Linear Bandits Li, Zhekai Ma, Tianyi Hua, Cheng Zhu, Ruihao Machine Learning Artificial Intelligence Statistics Theory 68T05 G.3 Motivated by the need to efficiently identify multiple candidates in high trial-and-error cost tasks such as drug discovery, we propose a near-optimal algorithm to identify all ε-best arms (i.e., those at most ε worse than the optimum). Specifically, we introduce LinFACT, an algorithm designed to optimize the identification of all ε-best arms in linear bandits. We establish a novel information-theoretic lower bound on the sample complexity of this problem and demonstrate that LinFACT achieves instance optimality by matching this lower bound up to a logarithmic factor. A key ingredient of our proof is to integrate the lower bound directly into the scaling process for upper bound derivation, determining the termination round and thus the sample complexity. We also extend our analysis to settings with model misspecification and generalized linear models. Numerical experiments, including synthetic and real drug discovery data, demonstrate that LinFACT identifies more promising candidates with reduced sample complexity, offering significant computational efficiency and accelerating early-stage exploratory experiments. |
| title | Identifying All ε-Best Arms in (Misspecified) Linear Bandits |
| topic | Machine Learning Artificial Intelligence Statistics Theory 68T05 G.3 |
| url | https://arxiv.org/abs/2510.00073 |