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
Approximation algorithms are the prevalent solution methods in the field of stochastic programming. ...
We present a sufficient and necessary condition for the convergence of stochastic approximation algo...
We propose the use of sequences of separable, piecewise linear approximations for solving classes of...
In this paper, we present two new stochastic approximation algorithms for the problem of quantile es...
Stochastic approximation algorithms are iterative procedures which are used to approximate a target ...
Part 10: Learning - IntelligenceInternational audienceThe goal of our research is to estimate the qu...
This papers presents an overview of gradient based methods for minimization of noisy functions. It i...
We propose and analyze an algorithm for the sequential estimation of a conditional quantile in the c...
ABSTRACT. This papers presents an overview of gradient based methods for minimization of noisy func-...
Stochastic approximation is a common paradigm for many stochastic recursions arising both as algorit...
We present a novel lightweight incremental quantile estimator which possesses far less complexity th...
We consider the problem of estimating the p-quantile for a given functional evaluated on solutions o...
Stochastic approximation is a common paradigm for many stochastic recursions arising both as algorit...
Vector Quantizers (VQ) can be exploited for classification. In particular the gradient of the error ...
Vector Quantizers (VQ) can be exploited for classification. In particular the gradient of the error ...
Approximation algorithms are the prevalent solution methods in the field of stochastic programming. ...
We present a sufficient and necessary condition for the convergence of stochastic approximation algo...
We propose the use of sequences of separable, piecewise linear approximations for solving classes of...
In this paper, we present two new stochastic approximation algorithms for the problem of quantile es...
Stochastic approximation algorithms are iterative procedures which are used to approximate a target ...
Part 10: Learning - IntelligenceInternational audienceThe goal of our research is to estimate the qu...
This papers presents an overview of gradient based methods for minimization of noisy functions. It i...
We propose and analyze an algorithm for the sequential estimation of a conditional quantile in the c...
ABSTRACT. This papers presents an overview of gradient based methods for minimization of noisy func-...
Stochastic approximation is a common paradigm for many stochastic recursions arising both as algorit...
We present a novel lightweight incremental quantile estimator which possesses far less complexity th...
We consider the problem of estimating the p-quantile for a given functional evaluated on solutions o...
Stochastic approximation is a common paradigm for many stochastic recursions arising both as algorit...
Vector Quantizers (VQ) can be exploited for classification. In particular the gradient of the error ...
Vector Quantizers (VQ) can be exploited for classification. In particular the gradient of the error ...
Approximation algorithms are the prevalent solution methods in the field of stochastic programming. ...
We present a sufficient and necessary condition for the convergence of stochastic approximation algo...
We propose the use of sequences of separable, piecewise linear approximations for solving classes of...