On properties of the algorithm for pursuing a drifting quantile
2013
The recurrent algorithm for pursuing a time-varying ("drifting") quantile is suggested. The common nonasymptotic upper bound of the algorithm quality is established, which is then used in a few examples of the conditions for the quantile drift function. Estimates of the degree (rate) of convergence of the algorithm for the considered examples are obtained.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
5
References
3
Citations
NaN
KQI