Trees | Indices | Help |
|
---|
|
Instance Methods | |||
|
|||
float
|
|
||
bool
|
|
||
|
|||
float
|
|
||
|
|||
Inherited from |
Instance Variables | |
last_probe A pair of position_base instances showing the position and logP at each end of the most recent probe for a discontinuity. |
Properties | |
Inherited from |
Method Details |
x.__init__(...) initializes x; see help(type(x)) for signature
|
|
Accept a step or not?
|
This is a hook for a special case where you are optimizing a random function or one that is deterministic, but very rough, and you don't care about the small-scale structure. In such a case, you might use this to probe the local variability and use that knowledge to change the temperature. |
In the acoustic distances paper, it is called
|
In order to make the overal algorithm asymptotically a Markovian, we need to make sure that (asymptotically) the acceptor function depends only on long-term averages, not on recent history. The problem is the jitter measurement, of course. So, one needs to average the jitter over a time longer than the recurrence time, asymptotically. But that makes it horribly unresponsive in the early stages of the optimization when things are rapidly changing. The solution is to pass along resets, so that it can (temporarily) revert to a short averaging time. |
Instance Variable Details |
last_probeA pair of position_base instances showing the position and logP at each end of the most recent probe for a discontinuity. Or, it could be None. This value is not used in mcmc,py. Rather, it is there for the logging modules. |
Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Thu Sep 22 04:25:06 2011 | http://epydoc.sourceforge.net |