[graph-tool] About speed, epsilon and wait
Tiago de Paula Peixoto
tiago at skewed.de
Thu Jan 16 10:40:10 CET 2020
Am 15.01.20 um 11:29 schrieb Davide Cittaro:
> Hi all,
> I'm trying to figure out a decent set of parameters to achieve a good trade-off between speed and accuracy.
> On my data, default parameters make comuputation times extremely long (especially compared to other community finding approaches), but we have noticed looking at the log that even 100 consecutive iterations without record breaking are quite rare, would it be reasonable to set wait=100, possibly increasing nbreaks, then?
This is difficult to say in general, as it depends on the properties of
the posterior distribution. But often what you say is correct: it's
sufficient to keep one of either nbreaks or wait fixed, and only vary
> Also, are "wait" parameter and "niter" passed to mcmc_args somehow related, in the sense that it could be opportune to increase one and decrease the other or should be they considered independent? Reading the older posts I've found there's an "epsilon" parameter which could be tuned in order to converge faster, and we are definitely trying to increase it (1e-3, to start). I've noticed another epsilon in hierarchy_minimize() parameters, is that expected to influence speed as well?
niter just controls how many iterations are performed for each sweep,
and wait controls how many sweeps are performed.
The difference between the epsilon in mcmc_equilibrate() and in
hiearchy_minimize() is explained in the documentation.
Tiago de Paula Peixoto <tiago at skewed.de>
-------------- next part --------------
A non-text attachment was scrubbed...
Size: 833 bytes
Desc: OpenPGP digital signature
More information about the graph-tool