Figure_1.tif (250.09 kB)

The Separatrix Algorithm addresses two main sub-problems.

Download (0 kB)
figure
posted on 31.07.2014, 03:22 by Daniel J. Klein, Michael Baym, Philip Eckhoff

The first is to use observed binary outcomes (top) to estimate the probability of success (bottom), and the second is to choose new points to sample. This is done so as to identify a particular isocline, called the separatrix, as illustrated by the dashed gray line.

History

Licence

Exports