Natural evolution can
be thought of as a computational process. I'm interested in
identifying the computational principles underlying the remarkable adaptive
power of this process, and in using this form of computation to solve challenging optimization
and machine learning problems.
Publications
Towards a Sound Theory of Adaptation for
the Simple Genetic Algorithm, [pdf]
Keki Burjorjee
Technical Report.
Sufficient Conditions for
Coarse-Graining Evolutionary Dynamics,
[pdf], slides [pdf]
Keki Burjorjee
In Foundations of Genetic Algorithms
Conference IX, 2007
A
General Coarse-Graining Framework for Studying Simultaneous
Inter-Population Constraints Induced by Evolutionary Operations,
[pdf],
extended version with proofs [pdf],
slides [pdf]
Keki Burjorjee, Jordan B. Pollack
In
Proceedings of the 2006 Genetic and Evolutionary Computation
Conference
Theme
Preservation and the Evolution of Representation,
[pdf]
Keki Burjorjee, Jordan B. Pollack
In Proceedings of
the 2nd Indian
International Conference on Artificial Intelligence, 2005
Theme
Preservation and the Evolution of Representation,
[pdf]
Keki Burjorjee, Jordan B. Pollack
Proceedings of
the Theory of
Representation Workshop at the Genetics and Evolutionary Computation
Conference, 2005
(Note: picoGA is optimized for a short code size
and small memory footprint, not
for speed. If you're looking for a fast implementation of a GA in
Matlab, check out VectorGA)
Awarded the Sproull Fellowship for unusually strong
potential for graduate study (University of Rocshester, 2000)
Graduated with departmental honors in mathematics,
and computer science, and general honors overall (Vassar College, 1998)
Awarded the Mary Evelyn Wells and Gertrude Smith
Prize for excellence in the study of undergraduate Mathematics (Vassar
College, 1998)
Part of a team of 3 that placed 2nd in an all-India
high school programming competition (Computer Society of India, 1992)
Natural systems such as brains and evolutionary systems have abilities that far
outstrip those of man-made systems in several important domains. A better
understanding of the unconventional ways in which such systems compute is likely
to permit AI engineers to transcend some of the fundamental limitations they experience when attempting to use conventional computing techniques to
solve hard problems.
My research in the past few years has centered on the genetic algorithm. I have
developed a new mathematical framework for analyzing the short-term dynamics of
these algorithms, and a new technique (in Matlab) for visualizing their
high-dimensional dynamics.
Using these tools I have identified a powerful type of computation that genetic
algorithms can perform efficiently, scaleably and robustly. This
discovery suggests a new explanation for the adaptive ability of
genetic algorithms which is radically different from the dominant hypothesis of
the field (the building block hypothesis). This new explanation undermines the
fundamental assumptions under which genetic algorithms, and indeed
other types of recombinative evolutionary algorithms, are typically
researched and applied; it also suggests new ways to improve the
adaptive ability of genetic algorithms.