Optimal quantization: Evolutionary algorithms vs stochastic gradient

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We propose a new method based on evolutionary optimization for obtaining an optimal Lp-quantizer of a multidimensional random variable. First, we remind briefly the main results about quantization. Then, we present the classical gradient-based approach (this approach is well detailed in [2] and [7] for p=2) used up to now to find a "local" optimal L p-quantizer. Then, we give an algorithm that permits to deal with the problem in the evolutionary optimization framework and illustrate a numerical comparison between the proposed method and the stochastic gradient method. Finally, a numerical application to option pricing in finance is provided.

Cite

CITATION STYLE

APA

Hamida, S. B., & Mrad, M. (2006). Optimal quantization: Evolutionary algorithms vs stochastic gradient. In Proceedings of the 9th Joint Conference on Information Sciences, JCIS 2006 (Vol. 2006). https://doi.org/10.2991/jcis.2006.161

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free