A space quantization method for numerical integration

Journal of Computational and Applied Mathematics

Volumn 89, Issue 1, 1998, Pages 1-38

  Pagès, Gilles ^a,b  

^a UNIVERSITÉ PARIS EST CRÉTEIL   (France)

^b SORBONNE UNIVERSITÉ   (France)

Author keywords

Distortion; Numerical integration; Vector quantization

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; ERROR ANALYSIS; FUNCTIONS; NUMERICAL METHODS; OPTIMIZATION; RANDOM PROCESSES; SET THEORY; THEOREM PROVING; VECTOR QUANTIZATION;

COMPETITIVE LEARNING VECTOR QUANTIZATION ALGORITHMS; SPACE QUANTIZATION METHODS (SQM); VORONOI TESSELLATION;

INTEGRATION;

EID: 0032498777     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(97)00190-8     Document Type: Article

References (36)

1. [1] E. Abaya, G. Wise, On the existence of optimal quantizer, IEEE Inform. Theory 38 (1992) 937-946.
2. [2] H. Amann, Ordinary Differential Equations, Studies in Mathematics, vol. 13, de Gruyter. Berlin, 1990.
3. [3] M. Benaïm, J.C. Fort, G. Pagès, Convergence of the one-dimensional Kohonen algorithms, Advances in Applied Probability 30(3) (1998).
4. [4] A. Benveniste, M. Métivier, P. Priouret, Algorithmes adaptatifs et approximations stochastiques. Masson, Paris, 1987.
5. [5] J.-P. Borel, G. Pagès, Y.J. Xiao, Suites à discrépance faible et intégration numérique, in: Bouleau, Talay (Eds.), Probabilités Numériques, Collection didactique, IKRIA, 1992, pp. 7-22.
6. [6] C. Bouton, G. Pagès, Self-organization and convergence of the one-dimensional Kohonen algorithm with non uniformly distributed stimuli, Stochastic Process. Appl. 47 (1993) 249-274.
7. [7] C. Bouton, G. Pagès, About the multidimensional competitive learning vector quantization algorithm with constant gain, Ann. Appl. Probab. 7 (1997), 679-710.
8. [8] O. Brandière, M. Duflo, Les algorithmes stochastiques contournent-ils les pièges?, Les Annales de l'I.H.P. 32 (1995) 395-477.
9. [9] J. Bucklew, G. Wise, Multidimensional asymptotic quantization theory with rth power distortion measures, IEEE Inform. Theory, Special issue on Quantization 28 (1982) 239-247.
10. [10] P. Cohort, Unicité d'un quantifieur localement optimal par le théorème du col, Technical Report. Labo. Proba., Univ Paris 6 (France), 1998.
11. [11] M. Cottrell, J.C. Fort, Etude d'un algorithme d'auto-organisation. Ann. Inst. H. Poincaré 23 (1986) 1-20.
12. [12] M. Duflo, Random Iterative Models, Springer, New York, 1997, l'algorithme.
13. [13] J.C. Fort, G. Pagès, About the a.s. convergence of the Kohonen algorithm with a generalized neighborhood function. Ann. Appl. Probab. 5(4) (1995) 1177-1216.
14. [14] J.C. Fort, G. Pagès, Convergence of stochastic algorithms: from the Kushner & Clark theorem to the Lyapounov functional method, Adv. in Appl. Probab. 28 (1996) 1072-1094.
15. [15] A. Gersho, Asymptotically optimal block quantization, IEEE Inform. Theory 25 (1979).
16. [16] A. Gersho, R. Grey, Vector Quantization and Signal Compression, MA Kluwer, Boston, 1992.
17. [17] J. Kiefer, Exponential rate of convergence for the Lloyd's method I, IEEE Inform. Theory, Special issue on Quantization, 28 (1982) 205-210.
18. [18] T. Kohonen, Self-organization and Associative Memory, Springer, Berlin, 1984.
19. [19] T. Kohonen, Self-organizing maps: optimization approaches, in: T. Kohonen et al. (Eds.), Artificial Neural Networks, Elsevier, Amsterdam, 1991, pp. 981-990.
20. [20] L. Kuipers, H. Niederreiter, Uniform Distribution of Sequences, Wiley, New York, 1974.
21. [21] H. Kushner, D. Clark, Stochastic Approximation for Constrained and Unconstrained Systems, Applied Math. Science Series, vol 26, Springer, Berlin, 1978.
22. [22] D. Lamberton, G. Pagès, On the critical points of the 1-dimensional competitive learning vector quantization algorithm, in: Proc. ESANN'96, Bruges, Belgium, 1996.
23. [23] B. Lapeyre, G. Pagès, Familles de suites à discrépance faible obtenues par itérations de transformations de [0, 1]. CRAS 308, Série I, 1989, pp. 507-509.
24. [24] B. Lapeyre, G. Pagès, K. Sab, Sequences with low discrepancy: generalization and application to Robbins-Monro algorithm, Statistics 21 (1990) 251-272.
25. [25] V. Lazarev, Convergence of stochastic-approximation procedures in the case of a regression equation with several roots. Translated from Problemy Pederachi Informatsii, 28, (1992).
26. [26] H. Niederreiter, Random Number Generation and Quasi-Monte Carlo Methods, CBMS-NSF Regional Conf. Series in Appl. Math. SIAM, Philadelphia, 1992.
27. [27] G. Pagès, Van der Corput sequences, Kakutani transform and one-dimensional numerical integration, J. Comput. Appl. Math. 44 (1992) 21-39.
28. [28] G. Pagès, Voronoï tessellation, space quantization algorithms and numerical integration, in: M. Verleysen (Ed.), Proc. ESANN'93, Bruxelles, Editions Quorum, Bruxelles, 1993, pp. 221-228.
29. [29] G. Pagès, Sur la convergence p.s. des algorithmes de quantification et de leur mosaïque. Technical Report du labo. de Proba., no. 205, Univ. Paris 6, December 93.
30. [30] A. Stroud, Approximate Calculation of Multiple Integrals, Prentice-Hall, Englewood Cliffs, NJ, 1971.
31. [31] M. Struwe, Variational Methods (Application to Nonlinear p.d.e & Hamiltonian Systems), Springer, Berlin, 1990.
32. [32] A. Trushkin, Global convergence and empirical consistency of the generalized Lloyd algorithm, IEEE Inform. Theory 32 (1986) 148-155.
33. [33] A. Trushkin, Sufficient conditions for uniqueness of a locally optimal quantizer for a class of convex error weighting functions, IEEE Inform. Theory, Special issue on Quantization 28 (1982) 187-198.
34. [34] A. Trushkin, On the design of an optimal quantizer, IEEE Inform. Theory 39 (1993) 1180-1194.
35. [35] M. Verleysen, Les principaux modèles de réseaux de neurones artificiels, in: E. de Bodt, E.F. Henrion (Eds.), Les Réseaux de Neurones en Finance: Conception et Applications, 1995, D. Facto, Bruxelles.
36. [36] P. Zador, Asymptotic quantization error of continuous signals and the quantization dimension, IEEE Inform. Theory, Special issue on Quantization 28 (1982) pp. 139-148.