I’m fascinated by the genetic algorithms family. Basic, sturdy genetic algorithms, John Holland style. Genetic Programming, Koza-style. Evolutionary strategies, à la Bienert, Techenberg and Schwefel. The thing thats interesting about these particular learning tools is that they require keeping a population of sub-optimal solutions about. One is less focussed on finding an optimising value than a suite of tools for solving similar problems. They can be made robust against very noisy fitness functions.
Things to learn about - Evolving “robustness”, and “modularity”, whatever those are. Implementations on massively-parallel shared-nothing architecture. Generalising to new inputs. Generalising from an evolutionary to a market metaphor for fitness, or finding some nice combination of those two metaphors.
Next I shall look at:
Thought-provoking already: