Abstract:
Recursive estimation of a vector parameter is investigated when the performance of a procedure is measured by the probability of its closeness to the parameter, i.e., when the loss is defined by a zero-one function. The large deviations of recurrent procedures are studied and asymptotic efficiency of these procedures is explored. The results are extended to the case of a search algorithm in a half-space.
Keywords:Bahadur risk, large deviations, Markov processes, recursive estimation, stochastic approximation.