Institution
Hampshire College
Education•Amherst Center, Massachusetts, United States•
About: Hampshire College is a education organization based out in Amherst Center, Massachusetts, United States. It is known for research contribution in the topics: Genetic programming & Population. The organization has 461 authors who have published 998 publications receiving 40827 citations.
Topics: Genetic programming, Population, Politics, Evolutionary computation, Selection (genetic algorithm)
Papers published on a yearly basis
Papers
More filters
••
9 citations
••
03 Nov 2011TL;DR: Analysis of over 1,000 innovative inventions reveals that during the innovative process at least one rarely-noticed or new feature is unearthed and built upon to create the solution (i.e., Obscure Features Hypothesis for innovation: OFH).
Abstract: Analysis of over 1,000 innovative inventions reveals that during the innovative process at least one rarely-noticed or new (i.e., obscure) feature is unearthed and built upon to create the solution (i.e., the Obscure Features Hypothesis for innovation: OFH) [6, 7]. Embedding the insights from this analysis into the structure of semantic networks creates AhaNets, which help optimize the search for the needed key obscure feature. Techniques to overcome cognitive aversions to noticing the obscure (i.e., fixation effects) further enhance innovation by improving the search process. Once implemented in software, AhaNets and counter-fixation techniques create an innovation-enhancing human-machine interaction.
9 citations
••
20 Jul 2016TL;DR: The key components of this approach, including the use of linear genomes for hierarchically structured programs, a diversity-maintaining parent selection algorithm, and the enforcement of diversification constraints on offspring are presented.
Abstract: In autoconstructive evolutionary algorithms, individuals implement not only candidate solutions to specified computational problems, but also their own methods for variation of offspring. This makes it possible for the variation methods to themselves evolve, which could, in principle, produce a system with an enhanced capacity for adaptation and superior problem solving power. Prior work on autoconsruction has explored a range of system designs and their evolutionary dynamics, but it has not solved hard problems. Here we describe a new approach that can indeed solve at least some hard problems. We present the key components of this approach, including the use of linear genomes for hierarchically structured programs, a diversity-maintaining parent selection algorithm, and the enforcement of diversification constraints on offspring. We describe a software synthesis benchmark problem that our new approach can solve, and we present visualizations of data from single successful runs of autoconstructive vs. non-autoconstructive systems on this problem. While anecdotal, the data suggests that variation methods, and therefore significant aspects of the evolutionary process, evolve over the course of the autoconstructive runs.
9 citations
••
TL;DR: Three different ways of providing structures for labs that require students to design their own experiments but guide the choices are described, with a mixture of structure and freedom that works for the level of the students, the resources available, and the particular aims.
Abstract: Many faculty want to involve students more actively in laboratories and in experimental design. However, just "turning them loose in the lab" is time-consuming and can be frustrating for both stude...
9 citations
••
01 Jan 2018TL;DR: Graph database tools are used to store every parent–child relationship in a single genetic programming run, and examine the key ancestries in detail, tracing back from an solution to see how it was evolved over the course of 20 generations.
Abstract: In evolutionary computation we potentially have the ability to save and analyze every detail in an run. This data is often thrown away, however, in favor of focusing on the final outcomes, typically captured and presented in the form of summary statistics and performance plots. Here we use graph database tools to store every parent–child relationship in a single genetic programming run, and examine the key ancestries in detail, tracing back from an solution to see how it was evolved over the course of 20 generations. To visualize this genetic programming run, the ancestry graph is extracted, running from the solution(s) in the final generation up to their ancestors in the initial random population. The key instructions in the solution are also identified, and a genetic ancestry graph is constructed, a subgraph of the ancestry graph containing only those individuals that contributed genetic information (or instructions) to the solution. These visualizations and our ability to trace these key instructions throughout the run allow us to identify general inheritance patterns and key evolutionary moments in this run.
8 citations
Authors
Showing all 467 results
Name | H-index | Papers | Citations |
---|---|---|---|
Anton Zeilinger | 125 | 631 | 71013 |
Peter K. Hepler | 90 | 207 | 21245 |
William H. Warren | 76 | 349 | 22765 |
James Paul Gee | 70 | 210 | 40526 |
Eric J. Steig | 69 | 223 | 17999 |
Raymond W. Gibbs | 62 | 188 | 17136 |
David A. Rosenbaum | 51 | 198 | 10834 |
Lee Jussim | 44 | 115 | 9101 |
Miriam E. Nelson | 44 | 122 | 16581 |
Stacia A. Sower | 43 | 178 | 6555 |
Howard Barnum | 41 | 109 | 6510 |
Lee Spector | 39 | 165 | 4692 |
Eric C. Anderson | 38 | 106 | 5627 |
Alan H. Goodman | 34 | 104 | 5795 |
Babetta L. Marrone | 33 | 95 | 3584 |