recursive estimators
Recently Published Documents


TOTAL DOCUMENTS

48
(FIVE YEARS 4)

H-INDEX

9
(FIVE YEARS 1)

2020 ◽  
Vol 157 ◽  
pp. 108609 ◽  
Author(s):  
Abdelkader Mokkadem ◽  
Mariane Pelletier
Keyword(s):  

2019 ◽  
Vol 23 ◽  
pp. 217-244
Author(s):  
Huy N. Chau ◽  
Chaman Kumar ◽  
Miklós Rásonyi ◽  
Sotirios Sabanis

In this paper, we estimate the expected tracking error of a fixed gain stochastic approximation scheme. The underlying process is not assumed Markovian, a mixing condition is required instead. Furthermore, the updating function may be discontinuous in the parameter.


2015 ◽  
Vol 26 (3) ◽  
pp. 609-627 ◽  
Author(s):  
Chun Yip Yau ◽  
Kin Wai Chan

2015 ◽  
Vol 25 (1) ◽  
pp. 1-19 ◽  
Author(s):  
Hector Cancela ◽  
Mohamed El Khadiri ◽  
Gerardo Rubino ◽  
Bruno Tuffin

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Yousri Slaoui

We propose an automatic selection of the bandwidth of the recursive kernel estimators of a probability density function defined by the stochastic approximation algorithm introduced by Mokkadem et al. (2009a). We showed that, using the selected bandwidth and the stepsize which minimize the MISE (mean integrated squared error) of the class of the recursive estimators defined in Mokkadem et al. (2009a), the recursive estimator will be better than the nonrecursive one for small sample setting in terms of estimation error and computational costs. We corroborated these theoretical results through simulation study.


Sign in / Sign up

Export Citation Format

Share Document