Abstract
This paper addresses the resolution, by Genetic Programming (GP) methods, of ambiguous inverse problems, where for a single input, many outputs can be expected. We propose two approaches to tackle this kind of many-to-one inversion problems, each of them based on the estimation, by a team of predictors, of a probability density of the expected outputs. In the first one, Stochastic Realisation GP, the predictors outputs are considered as the realisations of an unknown random variable which distribution should approach the expected one. The second one, Mixture Density GP, directly models the expected distribution by the mean of a Gaussian mixture model, for which genetic programming has to find the parameters. Encouraging results are obtained on four test problems of different difficulty, exhibiting the interests of such methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bishop, C.M.: Mixture density networks. Technical report, Aston University (1994)
Brameier, M., Banzhaf, W.: Evolving teams of predictors with linear genetic programming. Genetic Programming and Evolvable Machines 2(4), 381–407 (2001)
Chami, M., Robilliard, D.: Inversion of oceanic constituents in case i and case ii waters with genetic programming algorithms. Applied Optics 40(30), 6260–6275 (2002)
Collet, P., Lutton, E., Raynal, F., Schoenauer, M.: Polar IFS+parisian genetic programming=efficient IFS inverse problem solving. Genetic Programming and Evolvable Machines 1(4), 339–361 (2000)
Platel, M.D., Chami, M., Clergue, M., Collard, P.: Teams of genetic predictors for inverse problem solving. In: Keijzer, M., Tettamanzi, A.G.B., Collet, P., van Hemert, J.I., Tomassini, M. (eds.) EuroGP 2005. LNCS, vol. 3447, pp. 341–350. Springer, Heidelberg (2005)
Jordan, M.I., Rumelhart, D.E.: Forward models: Supervised learning with a distal teacher. Cognitive Science 16, 307–354 (1992)
Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)
Morishita, R., Imade, H., Ono, I., Ono, N., Okamoto, M.: Finding multiple solutions based on an evolutionary algorithm for inference of genetic networks by s-system. In: Congress on Evolutionary Computation, CEC ’03, pp. 615–622 (2003)
Paris, G., Robilliard, D., Fonlupt, C.: Genetic programming with boosting for ambiguities in regression problems. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E.P.K., Poli, R., Costa, E. (eds.) EuroGP 2003. LNCS, vol. 2610, pp. 183–193. Springer, Heidelberg (2003)
Spector, L.: Autoconstructive evolution: Push, pushGP, and pushpop. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2001, 7-11 July 2001, pp. 137–146. Morgan Kaufmann, San Francisco (2001)
Streichert, F., Planatscher, H., Spieth, C., Ulmer, H., Zell, A.: Comparing genetic programming and evolution strategies on inferring gene regulatory networks. In: Genetic and Evolutionary Computation – GECCO-2004, Part I, pp. 471–480, Seattle, WA, USA (2004)
Tarantola, A.: Inverse Problem Theory: Methods for Data Fitting and Model Parameter Estimation. Elsevier, Amsterdam (1987)
Yao, X.: Universal approximation by genetic programming. In: Foundations of Genetic Programming, Orlando, Florida, USA, 13 (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Defoin Platel, M., Vérel, S., Clergue, M., Chami, M. (2007). Density Estimation with Genetic Programming for Inverse Problem Solving. In: Ebner, M., O’Neill, M., Ekárt, A., Vanneschi, L., Esparcia-Alcázar, A.I. (eds) Genetic Programming. EuroGP 2007. Lecture Notes in Computer Science, vol 4445. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71605-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-71605-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71602-0
Online ISBN: 978-3-540-71605-1
eBook Packages: Computer ScienceComputer Science (R0)