Pith. sign in

Title resolution pending

Na(Hee) ≤ max ( N 0 a , 113(log 2K δ +log log 96 ∆2 0,a ) ∆2 0,a ) , for ∀a ∈ [K]

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.LG 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Near Optimal Non-asymptotic Sample Complexity of 1-Identification

cs.LG · 2025-06-08 · conditional · novelty 7.0

A new algorithm, Sequential-Explore-Exploit, achieves near-optimal non-asymptotic sample complexity for 1-identification in multi-armed bandits, matching lower bounds up to polylog factors in both positive and negative instances.

citing papers explorer

Showing 1 of 1 citing paper.

  • Near Optimal Non-asymptotic Sample Complexity of 1-Identification cs.LG · 2025-06-08 · conditional · none · ref 10

    A new algorithm, Sequential-Explore-Exploit, achieves near-optimal non-asymptotic sample complexity for 1-identification in multi-armed bandits, matching lower bounds up to polylog factors in both positive and negative instances.