Achieving {COSMOS}: a metric for determining when to give up and when to reach for the stars

  • Tosch E
  • Spector L
  • 18


    Mendeley users who have this article in their library.
  • 1


    Citations of this article.


The utility of current metrics used in genetic
programming (GP) systems, such as computational effort
and mean-best-fitness, varies depending upon the
problem and the resource that needs to be optimized.
Inferences about the underlying system can only be made
when a sufficient number of runs are performed to
estimate the relevant metric within some confidence
interval. This paper proposes a new algorithm for
determining the minimum number of independent runs
needed to make inferences about a GP system. As such,
we view our algorithm as a meta-metric that should be
satisfied before any inferences about a system are
made. We call this metric COSMOS, as it estimates the
number of independent runs needed to achieve the
Convergence Of Sample Means Of the Order Statistics. It
is agnostic to the underlying GP system and can be used
to evaluate extant performance metrics, as well as
problem difficulty. We suggest ways for which COSMOS
may be used to identify problems for which GP may be
uniquely qualified to solve.

Author-supplied keywords

  • genetic algorithms
  • genetic programming

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Emma Tosch

  • Lee Spector

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free