← Back to Patent Explorer
US5140530A Expired / Lapsed US ⏱️ 0.0 years remaining

Genetic algorithm synthesis of neural networks

Assignee: Honeywell Inc
•
Filing: 1989-03-28
•
Granted: 1992-08-18
•
Expires: 2009-03-28
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The disclosure relates to the use of genetic learning techniques to evolve neural network architectures for specific applications in which a general representation of neural network architecture is linked with a genetic learning strategy to create a very flexible environment for the construction of custom neural networks.

Inventors

  • 👤 Aloke Guha
  • 👤 Steven A. Harp
  • 👤 Tariq Samad

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-04 13:56
CPC Classifications
G; G06; G06N; G06N3/00; G06N3/02; G06N3/08; G06N3/086; G06N3/12; G06N3/126

Claims Analysis

Total Claims: 16
Claim 1
Independent Claim 286 words
A method for synthesizing designs for neural networks which involves the use of a selected learning algorithm and a particular subject to be learned, comprising the steps of: A. devising a bit string parametric representation of a neural network architecture having relevant parameters, B. generating a first generation of network blueprints based on said representation which jointly include a range of values for each of said parameters, C. generating respective neural network architectures based on the current generation of said blueprints, D. training each of said network architectures presently defined in step C via said selected learning algorithm and said subject matter, E. testing each of said network architectures presently defined in step C with test patterns corresponding to said subject matter for testing the receptiveness of each of said architectures presently defined in step C to the effect of said training, F. performing an evaluation for each of said network architectures called network models presently defined in step C after said testing thereof relative to performance and cost factors of interest and assigning a score thereto representing the results of said evaluation, and wherein said network model is deemed a test model and wherein a fitness is a combined measure of its worth which takes into account at least one attribute including learning speed, accuracy and cost factors involving the size and the complexity of said tested model, G. selecting candidates from said network architectures presently identified in step C in accordance with some rationale and applying at least one operator thereto to produce a new generation of network blueprints which shall be identified as the current generation of network blueprints based on said representation, and H. returning to step C and continuing the process.
Claim 2
Independent Claim 286 words
A method for synthesizing designs for neural networks which involves the use of a selected learning algorithm and a particular subject to be learned, comprising the steps of: A. devising a bit string parametric representation of a neural network architecture having relevant parameters, B. generating a first generation of network blueprints based on said representation which jointly include a range of values for each of said parameters, C. generating respective neural network architectures based on the current generation of said blueprints, D. training each of said network architectures presently defined in step C via said selected learning algorithm and said subject matter, E. testing each of said network architectures presently defined in step C with test patterns corresponding to said subject matter for testing the receptiveness of each of said architectures presently defined in step C to the effect of said training, F. performing an evaluation for each of said network architectures called network models presently defined in step C after said testing thereof relative to performance and cost factors of interest and assigning a score thereto representing the results of said evaluation, and wherein said network model is deemed a test model and wherein a fitness is a combined measure of its worth which takes into account at least one attribute including learning speed, accuracy and cost factors involving the size and the complexity of said tested model, G. selecting candidates from said network architectures presently identified in step C in accordance with some rationale and applying at least one operator thereto to produce a new generation of network blueprints which shall be identified as the current generation of network blueprints based on said representation, and H. returning to step C and continuing the process.
Claim 3
Dependent Claim 13 words
A method according to claim 1 wherein said operator is a genetic operator.
Claim 4
Dependent Claim 22 words
A method according to claim 2 further including the step of representing said architecture as a genetic blueprint via said bit string.
Claim 5
Dependent Claim 29 words
A method according to claim 3, including the further step of subjecting said blueprint to recombination relative to said range of values resulting in different but related network architectures.
Claim 6
Dependent Claim 22 words
A method according to claim 4 including the further step of subjecting said blueprint to mutation relative to said range of values.
Claim 7
Dependent Claim 22 words
A method according to claim 4, including the further step of subjecting said blueprint to mutation relative to said range of values.
Claim 8
Dependent Claim 15 words
A method according to claim 2 wherein said learning algorithm is of the backpropagation type.
Claim 9
Dependent Claim 31 words
A method according to claim 1 wherein said parameters of step A include the size of said neural network architecture in terms of computational units and the configuration of said units.
Claim 10
Dependent Claim 61 words
A method according to claim 1 wherein said neural network architecture includes computational units forming at least two layer areas, and said parameters of step A including at least one group of connections deemed a projection extending from ones of said computational units in one of said layer areas to other of said computational units in another of said layer areas.
Claim 11
Independent Claim 520 words
A method for synthesizing, using a selected learning algorithm and a particular subject to be learned, designs for neural networks each of which comprise, a plurality of computational units, a plurality of hierarchically arranged layer areas including input and output layer areas and zero or more hidden layer areas therebetween, each of said layer areas being defined by a number of said units, connecting means connecting source groups of said units in said layer areas other than said output layer area with object groups of said units in said layer areas other than said input layer area, said connecting means being grouped in sets deemed projections with each of said projections extending from one of said layer areas to another of said layer areas, said method comprising the steps of: A. providing a substring format for specifying each of said layer areas with said format having one first type part deemed a layer area parameter specifier and at least one second type part for each of said projections deemed a projection specifier, said first type part comprising a layer area identifying address section, a total size section denoting the corresponding number of said units thereof, and a dimension section denoting the configuration formed by said units, each said second type part being dedicated to one of said projections deemed a subject projection, said second part type comprising a target address section for identifying one of said layer areas deemed a target layer area to which said subject projection is directed, a mode of address section for said subject projection, a dimension section for denoting the configuration of an object field for said subject projection in said target layer area, a connection density section for denoting the connectivity of said subject projection to said object field, and at least one learning rule parameter section, B. devising a bit string parametric representation of a neural network architecture based on said substring format and having relevant parameters, C. generating a first generation of network blueprints based on said representation which jointly include a range of values for each of said parameters, D. generating respective neural network architectures based on the current generation of said blueprints, E. training each of said network architectures presently defined in step D via said selected learning algorithm and said subject matter, F. testing each of said network architectures presently defined in step D with test patterns corresponding to said subject matter for testing the receptiveness of each of said network architectures presently defined in step D to the affect of said training, G. performing an evaluation for each of said network architectures presently defined in step D after said testing thereof relative to performance and cost factors of interest and assigning a score thereto representing the results of said evaluation, H. selecting candidates from said network architectures presently identified in step D in accordance with selected rationale and applying at least one genetic operator thereto to produce a new generation of network blueprints which shall be identified as the current generation of network blueprints based on said representation, and I. returning to step D and continuing the process.
Claim 12
Independent Claim 520 words
A method for synthesizing, using a selected learning algorithm and a particular subject to be learned, designs for neural networks each of which comprise, a plurality of computational units, a plurality of hierarchically arranged layer areas including input and output layer areas and zero or more hidden layer areas therebetween, each of said layer areas being defined by a number of said units, connecting means connecting source groups of said units in said layer areas other than said output layer area with object groups of said units in said layer areas other than said input layer area, said connecting means being grouped in sets deemed projections with each of said projections extending from one of said layer areas to another of said layer areas, said method comprising the steps of: A. providing a substring format for specifying each of said layer areas with said format having one first type part deemed a layer area parameter specifier and at least one second type part for each of said projections deemed a projection specifier, said first type part comprising a layer area identifying address section, a total size section denoting the corresponding number of said units thereof, and a dimension section denoting the configuration formed by said units, each said second type part being dedicated to one of said projections deemed a subject projection, said second part type comprising a target address section for identifying one of said layer areas deemed a target layer area to which said subject projection is directed, a mode of address section for said subject projection, a dimension section for denoting the configuration of an object field for said subject projection in said target layer area, a connection density section for denoting the connectivity of said subject projection to said object field, and at least one learning rule parameter section, B. devising a bit string parametric representation of a neural network architecture based on said substring format and having relevant parameters, C. generating a first generation of network blueprints based on said representation which jointly include a range of values for each of said parameters, D. generating respective neural network architectures based on the current generation of said blueprints, E. training each of said network architectures presently defined in step D via said selected learning algorithm and said subject matter, F. testing each of said network architectures presently defined in step D with test patterns corresponding to said subject matter for testing the receptiveness of each of said network architectures presently defined in step D to the affect of said training, G. performing an evaluation for each of said network architectures presently defined in step D after said testing thereof relative to performance and cost factors of interest and assigning a score thereto representing the results of said evaluation, H. selecting candidates from said network architectures presently identified in step D in accordance with selected rationale and applying at least one genetic operator thereto to produce a new generation of network blueprints which shall be identified as the current generation of network blueprints based on said representation, and I. returning to step D and continuing the process.
Claim 13
Independent Claim 329 words
A method for synthesizing designs for neural networks which involves the use of a selected learning algorithm and a particular subject to be learned, comprising the steps of: A. devising a bit string parametric representation of a neural network architecture having relevant parameters, B. generating a first generation of network blueprints based on said representation which jointly include a range of values for each of said parameters, C. generating respective neural network architectures based on the current generation of said blueprints, D. training each of said network architectures presently defined in step C via said selected learning algorithm and said subject matter, E. testing each of said network architectures presently defined in step C with test patterns corresponding to said subject matter for testing the receptiveness of each of said architectures presently defined in step C to the effect of said training, F. performing an evaluation for each of said network architectures called network models presently defined in step C after said testing thereof relative to performance and cost factors of interest and assigning a score thereto representing the results of said evaluation, G. selecting candidates from said network architectures presently identified in step C in accordance with some rationale and applying at least one operator thereto to produce a new generation of network blueprints which shall be identified as the current generation of network blueprints based on said representation, and H. returning to step C and continuing the process, and wherein said neural network architecture includes computational units forming at least two layer areas, and said parameters of step A including at least one group of connections deemed a projection extending from ones of said computational units in one of said layer areas to other of said computational units in another of said layer areas, and wherein there are at least three of said layer areas and at least two of said projections extend from one of said layer areas to two different ones of said layer areas.
Claim 14
Independent Claim 329 words
A method for synthesizing designs for neural networks which involves the use of a selected learning algorithm and a particular subject to be learned, comprising the steps of: A. devising a bit string parametric representation of a neural network architecture having relevant parameters, B. generating a first generation of network blueprints based on said representation which jointly include a range of values for each of said parameters, C. generating respective neural network architectures based on the current generation of said blueprints, D. training each of said network architectures presently defined in step C via said selected learning algorithm and said subject matter, E. testing each of said network architectures presently defined in step C with test patterns corresponding to said subject matter for testing the receptiveness of each of said architectures presently defined in step C to the effect of said training, F. performing an evaluation for each of said network architectures called network models presently defined in step C after said testing thereof relative to performance and cost factors of interest and assigning a score thereto representing the results of said evaluation, G. selecting candidates from said network architectures presently identified in step C in accordance with some rationale and applying at least one operator thereto to produce a new generation of network blueprints which shall be identified as the current generation of network blueprints based on said representation, and H. returning to step C and continuing the process, and wherein said neural network architecture includes computational units forming at least two layer areas, and said parameters of step A including at least one group of connections deemed a projection extending from ones of said computational units in one of said layer areas to other of said computational units in another of said layer areas, and wherein there are at least three of said layer areas and at least two of said projections extend from one of said layer areas to two different ones of said layer areas.
Claim 15
Dependent Claim 19 words
A method according to claim 11 wherein said parameters include a learning rule parameter for adjusting the learning rule.
Claim 16
Dependent Claim 37 words
A method according to claim 11 wherein said parametric representation of step A is a bit string which includes the size of said neural network architecture in terms of computational units and the configuration of said units.

References Cited (Backward Citations)

US3097349A Cited
US4593367A Cited
US4591980A Cited
US4697242A Cited
US4935877A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1995-08-18 1996-02-17 1996-08-18 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1999-08-18 2000-02-17 2000-08-18 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2003-08-18 2004-02-17 2004-08-18 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag