Large deviations probabilities for recursive m-estimators (Q4364124)
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 1087297
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Large deviations probabilities for recursive m-estimators |
scientific article; zbMATH DE number 1087297 |
Statements
Large deviations probabilities for recursive m-estimators (English)
0 references
29 April 1998
0 references
two-stage decision rule
0 references
large deviations
0 references
Markov chain
0 references
recursive minimu-contrast estimators
0 references
Bahadur risks
0 references
0.7962754368782043
0 references
0.7790523767471313
0 references
0.7780145406723022
0 references
0.7734560966491699
0 references
Suppose that \(X_1, \dots, X_n\) is a random sample from a population with parameter \(\theta\) which is unknown but is known to lie in an interval of the form \([-A,A]\). Let \(\psi: R^2 \to R\) be a measurable function. Given an initial condition \(z_0\), define the recursive minimum-contrast estimators \(\{z_n\}\) by \(z_n= z_{n-1} +\psi (X_n, z_{n-1})/nJ\) for a normalization factor \(J>0\) depending on \(\psi\). This paper presents sets of hypotheses under which \(\lim_{n\to \infty} n^{-1} \log P[|z_n- \theta |\geq c]\), the limit of the Bahadur risks, exists and equals an explicit function of \(\theta\) and \(c>0\). An asymptotically optimal two-stage recurrent procedure is also derived.
0 references