Approximate fitness functions

Details Approximate fitness functions Approximate fitness functions

2006-05-09

2006-05-09

Davis, George (Department: 2121)

Data processing: artificial intelligence

Machine learning

Genetic algorithm and genetic programming system

Reexamination Certificate

active

07043462

ABSTRACT:
A framework for managing approximate models in generation-based evolution control is proposed. This framework is well suited for parallel evolutionary optimization that is able to guarantee the correct convergence of the evolutionary algorithm and to reduce the computation costs as much as possible. Control of the evolution and updating of the approximate models are based on the estimated fidelity of the approximate model. The frequency at which the original function is called and the approximate model is updated is determined by the local fidelity of the approximate model. By local fidelity the fidelity of the model for the region where the current population is located is designated. The lower the model fidelity is, the more frequently the original function should be called and the approximate models should be updated.

REFERENCES:
patent: 5148513 (1992-09-01), Koza et al.
patent: 5265830 (1993-11-01), Allen
patent: 5319781 (1994-06-01), Syswerda
patent: 5355528 (1994-10-01), Roska et al.
patent: 5461570 (1995-10-01), Wang et al.
patent: 5541848 (1996-07-01), McCormack et al.
patent: 5819244 (1998-10-01), Smith
patent: 5924048 (1999-07-01), McCormack et al.
patent: 6449603 (2002-09-01), Hunter
patent: 6578018 (2003-06-01), Ulyanov
patent: 6606612 (2003-08-01), Rai et al.
patent: 6662167 (2003-12-01), Xiao
patent: 2002/0138457 (2002-09-01), Jin et al.
patent: 2004/0049472 (2004-03-01), Hayashi et al.
Yu etal,“ Genetic Algorithm Approach to Image Segmentation Using Morphological operations”, IEEE, ICIP, Oct. 1998.
Dasgupta, Dipankar et al., Evolutionary Algorithms in Engineering Applications, 1997, 3-23, Springer-Verlag.
Deb, K., Evolutionary Algorithms for Multi-Criterion Optimization in Engineering Design, In Miettinen et al., Evolutionary Algorithms in Engineering and Computer Science, 1999, pp. 135-161, John Wiley and Sons, Ltd., Chichester, UK.
Van Veldhuizen, David A. et al., Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art, Evolutionary Computation, 2000, 125-147, vol. 8, No. 2, The MIT Press, Cambridge, MA.
Alain Ratle, “Optimal Sampling Strategies for Learning a Fitness Model”,Proc. of 1999 Congress on Evolutionary Computation,vol. 3, Jul. 9, 1999, pp. 2078-2085.
D.E. Grierson and W.H. Pak, “Optimal Sizing, Geometrical and Topological Design Using a Genetic Algorithm”,Structural Optimization,vol. 6, 1993, pp. 151-159..
Yen-ting Chen et al., “Feature Subimage Extraction for Cephalogram Landmarking”,Proc. of the 20thAnnual International Conference of the IEEE Engineering in Medicine and Biology Society,vol. 20, Oct. 29, 1998, pp. 1414-1417.
Alain Ratle, “Accelerating the Convergence of Evolutionary Algorithms by Fitness Landscape Approximation”,Parallel Problem Solving from Nature—PPSN V. 5thInternational Conference Proceedings,Sep. 1998, pp. 87-96.
J. Redmond and G. Parker, “Actuator Placement Based on Reachable Set Optimization for Expected Disturbance”,Journal of Optimization Theory and Applications,vol. 90, No. 2, Aug. 1996, pp. 279-300.
P.K. Dash, et al., Genetic Optimization of a Self organizing Fuzzy-Neural network For Load Forecasting, Department of Electrical engineering, Regional Engineering College, Rourkela, India, 2000 IEEE, pp. 1011-1016.
Agrez; Active power estimation by averaging of the DFT coefficients; Proceedings of the 17thIEEE Instrumentation and Measurement Technology Conference; vol. 2; May 1-4 2000; pp. 630-635.
Clayton et al; Acoustic wavefield propagation using paraxial axtrapolators; Proceedings of the third conference on Hypercube concurrent computers and applications; vol. 2; Jan. 1989.
Crump; Numerical Inversion of Laplace Transforms Using a Fourier Series Approximation; Journal of the ACM (JACM); vol. 23, Is. 1; Jan. 1976.
Gupta et al., Automated test data generation using an iterative relaxation method; Proceedings of the 6thACM SIGSOFT international symposium on Foundations of software engineering; ACM SIGSOFT Software Engineering Notes; vol. 23, Is 6; Nov. 1998.
Jin et al., On generating FC3 fuzzy rule systems from data using evolution strategies; IEEE Transactions on Systems, Man and Cybernetics Part B; vol. 29, Is. 6; Dec. 1999; pp. 829-845.
Li et al; Text enhancement in digital video using multiple frame integration; Proceedings of the seventh ACM international conference on Multimedia (Part 1); Oct. 1999.
Mitlohner; Classifier systems and economic modeling; Proceedings of the conference on Designing the future; ACM SIGAPL APL Quote Quad; vol. 26, Is. 4; Jun. 1996.
Sendhoff; Evolutionary optimised ontogenetic neural networks with incremental problem complexity during development; Proceedings of the 2000 Congress on Evolutionary Computation; vol. 2; Jul. 16-19 2000; pp. 1443-1450.
European Search Report, EP 00124825, May 14, 2001, 3 pages.
Guerin, S., “ObjectGarden Evolving The Behavior Of Agents Via A Natural Selection On Weights And Topologies Of Neural Networks,” May 1999, pp. 1-15.
European Search Report, EP Application No. 00124824.4, Jun. 14, 2001.
Ishibuchi, H. et al., “Local Search Procedures in a Multi-Objective Genetic Local Search Algorithm For Scheduling Problems,” IEEE, 1999. pp. 665-670.
Knowles, J. et al., “The Pareto Archived Evolution Strategy: A New Baseline Algorithm For Pareto Multiobjective Optimisation,” IEEE, 1999, 98-105.
Lohn, J.D. et al., “A Comparison Of Dynamic Fitness Schedules For Evolutionary Design Of Amplifiers,” 6 pages.
Tuson, A. et al., “Adapting Operator Settings in Genetic Algorithms,” Final Draft of The Paper Which Will Appear inEvolutionary Computation, Mar. 25, 1996, pp. 1-17.
Baluja, S. et al., “Combining Multiple Optimization Runs With Optimal Dependency Trees,” Jun. 30, 1997, 12 pages, CMU-CS-97-157, Justsystem Pittsburgh Research Center, Pittsburgh, PA and School Of Computer Science, Carnegie Mellon University, Pittsburgh, PA.
Baluja, S., “Population-Based Incremental Learning: A Method For Integrating Genetic Search Based Function Optimization And Competitive Learning,” Population Based Incremental Learning, Jun. 2, 1994, pp. 1-41, CMU-CS-94-163, School Of Computer Science, Carnegie Mellon University, Pittsburgh, PA.
Bosman, P. et al., “Advancing Continuous IDEAs With Mixture Distributions and Factorization Selection Metrics,” 6 pages, Insitute Of Information And Computing Sciences, Utretch University, Utrecht, The Netherlands.
Bosman, P. et al., “An Algorithmic Framework For Density Estimation Based Evolutionary Algorithms,” Dec. 1999, pp. 1-63, Department of Computer Science, Utrecht University, Utrecht, The Netherlands.
Bosman, P. et al., “Continuous Iterated Density Estimation Evolutionary Algorithms Within The IDEA Framework,” 10 pages, Department of Computer Science, Utrecht University, Utrecht, The Netherlands.
Bosman, P. et al., “IDEAs Based On The Normal Kernels Probability Density Function,” Mar. 2000, pp. 1-16, Department of Computer Science, Utrecht University, Utrecht, The Netherlands.
Bosman, P. et al., “Mixed IDEAs,” Dec. 2000, pp. 1-71, UU-CS-2000-45, Institute of Information and Computing Science, Utrecht University, Utrecht, The Netherlands.
Bosman, P. et al., “Negative Log-Likelihood and Statistical Hypothesis Testing as The Basis of Model Selection in IDEAs,”Aug. 2000, pp. 1-17, Department of Computer Science, Utrecht University, Utrecht, The Netherlands.
Branke, J. et al., “Faster Convergence By Means of Estimation,” Oct. 1, 2002, pp. 1-9, Institute AIFB, University of Karlsruhe, Karlsruhe, Germany.
Costa, M. et al., “MOPED: A Multi-Objective Parzen-Based Estimation of Distribution Algorithm for Continuous Problems,” Polytechnic of Turin, 12 pages, Turin, Italy.
Deb, K. et al., “A Computationally Efficient Evolutionary Algorithm For Real-Parameter Optimization,” KanGAL Report Number 2002003, Apr. 11, 2002, pp. 1-21, Kanpur Genetic Algorit

Affiliated with

Also associated with

Rating

Approximate fitness functions does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Approximate fitness functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximate fitness functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3569432