Provably Efficient Algorithm for Best Scoring Rule Identification in Online Principal-Agent Information Acquisition
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916754538627072 |
|---|---|
| author | Wang, Zichen Li, Chuanhao Wang, Huazheng |
| author_facet | Wang, Zichen Li, Chuanhao Wang, Huazheng |
| contents | We investigate the problem of identifying the optimal scoring rule within the principal-agent framework for online information acquisition problem. We focus on the principal's perspective, seeking to determine the desired scoring rule through interactions with the agent. To address this challenge, we propose two algorithms: OIAFC and OIAFB, tailored for fixed confidence and fixed budget settings, respectively. Our theoretical analysis demonstrates that OIAFC can extract the desired $(ε, δ)$-scoring rule with a efficient instance-dependent sample complexity or an instance-independent sample complexity. Our analysis also shows that OIAFB matches the instance-independent performance bound of OIAFC, while both algorithms share the same complexity across fixed confidence and fixed budget settings. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_17379 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Provably Efficient Algorithm for Best Scoring Rule Identification in Online Principal-Agent Information Acquisition Wang, Zichen Li, Chuanhao Wang, Huazheng Machine Learning Artificial Intelligence We investigate the problem of identifying the optimal scoring rule within the principal-agent framework for online information acquisition problem. We focus on the principal's perspective, seeking to determine the desired scoring rule through interactions with the agent. To address this challenge, we propose two algorithms: OIAFC and OIAFB, tailored for fixed confidence and fixed budget settings, respectively. Our theoretical analysis demonstrates that OIAFC can extract the desired $(ε, δ)$-scoring rule with a efficient instance-dependent sample complexity or an instance-independent sample complexity. Our analysis also shows that OIAFB matches the instance-independent performance bound of OIAFC, while both algorithms share the same complexity across fixed confidence and fixed budget settings. |
| title | Provably Efficient Algorithm for Best Scoring Rule Identification in Online Principal-Agent Information Acquisition |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2505.17379 |