Pith. sign in

REVIEW 1 cited by

Lamarckian Evolution and the Baldwin Effect in Evolutionary Neural Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv cs/0603004 v1 pith:7DQTLTET submitted 2006-03-01 cs.NE

classification cs.NE
keywords effectlamarckianbaldwinerrorothersearchalgorithmsdarwinian
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Hybrid neuro-evolutionary algorithms may be inspired on Darwinian or Lamarckian evolu- tion. In the case of Darwinian evolution, the Baldwin effect, that is, the progressive incorporation of learned characteristics to the genotypes, can be observed and leveraged to improve the search. The purpose of this paper is to carry out an exper- imental study into how learning can improve G-Prop genetic search. Two ways of combining learning and genetic search are explored: one exploits the Baldwin effect, while the other uses a Lamarckian strategy. Our experiments show that using a Lamarckian op- erator makes the algorithm find networks with a low error rate, and the smallest size, while using the Bald- win effect obtains MLPs with the smallest error rate, and a larger size, taking longer to reach a solution. Both approaches obtain a lower average error than other BP-based algorithms like RPROP, other evolu- tionary methods and fuzzy logic based methods

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Fresh Look at Lamarckian Evolution and the Baldwin Effect

    cs.NE 2026-05 unverdicted novelty 5.0 of 10

    Baldwinian and Lamarckian evolution outperform Darwinian evolution empirically on Max Independent Set and Max Cut tasks and show better asymptotic runtime on the extended Deceptive Leading Block benchmark.

Pith tools