Finite stopping in sequential sampling without recall from a Dirichlet process (Q1077853)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3958494
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finite stopping in sequential sampling without recall from a Dirichlet process |
scientific article; zbMATH DE number 3958494 |
Statements
Finite stopping in sequential sampling without recall from a Dirichlet process (English)
0 references
1986
0 references
Let \(X_ 1,X_ 2,...\), be observations from an (unknown) distribution F. The cost of stopping the sequence at n is \(X_ n+(n-1)c\), where c is a constant. The optimal stopping rule is that minimizing the expected cost. The main result states that if F comes from a Dirichlet process than there exists an integer N such that any optimal procedure stops sampling not later than at N with probability 1.
0 references
sequential sampling without recall
0 references
almost sure upper bound
0 references
Bayesian optimal stopping rule
0 references
Dirichlet process
0 references
0.8424285650253296
0 references
0.7712236046791077
0 references
0.7657554149627686
0 references
