Nikolaus Hansen
Researcher
INRIA research centre
Saclay – Île-de-France
(The French National Institute of Research in Computer Science and Control)
Machine Learning and Optimization group (TAO)
Universitè Paris-Sud,
LRI (UMR8623), Bât. (building) 490 (Google maps), room 121b.
91405 Orsay Cedex, France
| mail | hansen .AT. lri .DOT. fr |
Research objective. I want to understand stochastic search in
continuous, high-dimensional search spaces. When improving known or
developing new algorithms, I strongly care about whether and how they
are useful in practice. Typical research means are: markov
chain analysis, meaningful comparison methodologies,
statistical machine learning techniques, and adaptive parameter
control, eventually bridging the gap to the practitioner.
CMA-ES (Covariance Matrix Adaptation Evolution Strategy)
Benchmarking continuous optimization algorithms
[1]The H-index is the (largest) number, H, of articles that received at least H citations each.
[2]The g-index is the (largest) number, g, of cited articles that received at least g citations on average. By definition g ≥ H. Note that usually g ≈ √ number of received citations, because g is the largest number such that
g ≤ number of cited articles and g2 ≤ number of received citations and the latter is usually the determining factor.
[3]Citation counts include citations to technical reports and white papers. Including these seems to be appropriate for measuring impact, as they are neither particularly easy to track down nor particularly attractive to cite. Excluding citations from such kind of sources has not been done for purely practical reasons.
You are the
th
visitor since June 2007 (web-counter)
last change $Date: 2012-03-29 22:15:15 +0200 (Thu, 29 Mar 2012) $