In this paper, we present two new stochastic approximation algorithms for the problem of quantile estimation. The algorithms uses the characterization of the quantile provided in terms of an optimization problem in [1]. The algorithms take the shape of a stochastic gradient descent which minimizes the optimization problem. Asymptotic convergence of the algorithms to the true quantile is proven using the ODE method. The theoretical results are also supplemented through empirical evidence. The algorithms are shown to provide significant improvement in terms of memory requirement and accuracy.
CITATION STYLE
Joseph, A. G., & Bhatnagar, S. (2015). A stochastic approximation algorithm for quantile estimation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9490, pp. 311–319). Springer Verlag. https://doi.org/10.1007/978-3-319-26535-3_36
Mendeley helps you to discover research relevant for your work.