Metraipolis › archive › dc_bf2477af5f2b

Best arm identification — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Best_arm_identification
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-06T12:38:17.173Z
SHA-256 of the archived text
d6fa78844a016fef09e6757c607e9ac50d443d728b75bda3d5a45bc231499eb6
Stable URL of this page
https://metraipolis.com/documento/dc_bf2477af5f2b

How to cite

Best arm identification — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Best_arm_identification (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_bf2477af5f2b (Metraipolis archive dc_bf2477af5f2b, sha256 d6fa78844a016fef09e6757c607e9ac50d443d728b75bda3d5a45bc231499eb6)
BibTeX
@misc{dcbf2477af5f2b,
  title = {Best arm identification — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Best_arm_identification},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_bf2477af5f2b; sha256 d6fa78844a016fef09e6757c607e9ac50d443d728b75bda3d5a45bc231499eb6},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Best_arm_identification. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Best arm identification (BAI) is a sequential one-player game where the player has to find the best action (arm) among a list of actions (arms) by collecting information in the most efficient way. It is a multi-armed bandit game as a player only gets information about an arm by playing it. The most common objective in multi-armed bandit games is to minimize the regret (i.e., play the best action as much as possible), but in BAI, the goal is to find the best arm as efficiently as possible. This problem naturally arises in scenarios such as adaptive clinical trials where the number of patients is limited and the quantification of the confidence in a treatment is important. It also arises in hyperparameter optimization where the goal is to find the optimal choice of hyperparameters for an algorithm with the smallest possible number of experiments, as it can be costly in terms of time, energy, or money.

Tema degli esploratori: statistica e scienza dei dati (deposito sistematico; categoria «Algorithms»).
Fonte: Wikipedia in inglese, voce «Best arm identification» — https://en.wikipedia.org/wiki/Best_arm_identification
Wikidata Q139963374: «multi-armed bandit sequential game» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q139963374
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Best_arm_identification?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1368541846, consultata il 2026-10-06T10:54:17.042Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 168d7111c02c03d4134e7554d7f13191be3f773c2e36dc6eaf446c0f6423a451