Shortcomings with tree-structured edge encodings for neural networks

被引:0
|
作者
Hornby, GS [1 ]
机构
[1] NASA, Ames Res Ctr, QSS Grp Inc, Moffett Field, CA 94035 USA
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties in specifying edge weights and these operators are execution-order dependent, an alternative is to use edge operators. Here we identify three problems with edge operators: in the initialization phase most randomly created genotypes produce an incorrect number of inputs and outputs; variation operators can easily change the number of input/output (I/O) units; and units have a connectivity bias based on their order of creation. Instead of creating I/O nodes as part of the construction process we propose using parameterized operators to connect to pre-existing I/O units. Results from experiments show that these parameterized operators greatly improve the probability of creating and maintaining networks with the correct number of I/O units, remove the connectivity bias with I/O units and produce better controllers for a goal-scoring task.
引用
收藏
页码:495 / 506
页数:12
相关论文
共 50 条
  • [31] Tree-Structured Bayesian Networks for Wrapped Cauchy Directional Distributions
    Leguey, Ignacio
    Bielza, Concha
    Larranaga, Pedro
    ADVANCES IN ARTIFICIAL INTELLIGENCE, CAEPIA 2016, 2016, 9868 : 207 - 216
  • [32] OPTIMIZATION OF TREE-STRUCTURED NATURAL-GAS TRANSMISSION NETWORKS
    WONG, PJ
    LARSON, RE
    JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1968, 24 (03) : 613 - &
  • [33] A DIFFERENTIAL CRYPTANALYSIS OF TREE-STRUCTURED SUBSTITUTION-PERMUTATION NETWORKS
    OCONNOR, L
    IEEE TRANSACTIONS ON COMPUTERS, 1995, 44 (09) : 1150 - 1152
  • [34] PARALLEL ALGORITHM FOR ANALYZING ACTIVITY NETWORKS ON A TREE-STRUCTURED COMPUTER
    CHAUDHURI, P
    INTERNATIONAL JOURNAL OF ELECTRONICS, 1990, 68 (06) : 925 - 930
  • [35] A Tree-Structured Algorithm for Reducing Computation in Networks with Separable Basis
    Sanger, Terence D.
    NEURAL COMPUTATION, 1991, 3 (01) : 67 - 78
  • [36] NML Computation Algorithms for Tree-Structured Multinomial Bayesian Networks
    Kontkanen, Petri
    Wettig, Hannes
    Myllymaki, Petri
    EURASIP JOURNAL ON BIOINFORMATICS AND SYSTEMS BIOLOGY, 2007, (01)
  • [37] Improving Uncertainty Quantification of Variance Networks by Tree-Structured Learning
    Ma, Wenxuan
    Yan, Xing
    Zhang, Kun
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2023, : 1 - 15
  • [38] TREE-STRUCTURED SURVIVAL ANALYSIS
    GORDON, L
    OLSHEN, RA
    CANCER TREATMENT REPORTS, 1985, 69 (10): : 1065 - 1069
  • [39] Tree-structured Haar transforms
    Egiazarian, K
    Astola, J
    JOURNAL OF MATHEMATICAL IMAGING AND VISION, 2002, 16 (03) : 269 - 279
  • [40] Clustering of Tree-structured Data
    Lu, Na
    Wu, Yidan
    2015 IEEE INTERNATIONAL CONFERENCE ON INFORMATION AND AUTOMATION, 2015, : 1210 - 1215