A PAC algorithm in relative precision for bandit problem with costly sampling (Q2084297): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 2007.15331 / rank | |||
Normal rank | |||
Revision as of 01:48, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A PAC algorithm in relative precision for bandit problem with costly sampling |
scientific article |
Statements
A PAC algorithm in relative precision for bandit problem with costly sampling (English)
0 references
18 October 2022
0 references
bandit algorithm
0 references
probably approximately correct algorithm
0 references
relative precision
0 references
concentration inequalities
0 references
Monte Carlo estimates
0 references
