![]() |
Fleet
0.0.9
Inference in the LOT
|
This takes a grammar and expands to a given depth, and then runs a separate MCMC chain in each partial subtree that is generated. More...
#include <thread>#include <vector>#include "Errors.h"#include "MCMCChain.h"#include "Timing.h"#include "ThreadedInferenceInterface.h"

Go to the source code of this file.
Classes | |
| class | PartitionMCMC< HYP > |
Functions | |
| template<typename HYP > | |
| std::set< HYP > | get_partitions (const HYP &h0, const size_t max_depth, const size_t max_size) |
| Compute "partitions" meaning trees with holes where we can run MCMC on the hole. This takes either a max depth or max number of partitions. NOTE here that anything which is a complete tree that gets evaluated is NOT included. More... | |
This takes a grammar and expands to a given depth, and then runs a separate MCMC chain in each partial subtree that is generated.
| std::set<HYP> get_partitions | ( | const HYP & | h0, |
| const size_t | max_depth, | ||
| const size_t | max_size | ||
| ) |
Compute "partitions" meaning trees with holes where we can run MCMC on the hole. This takes either a max depth or max number of partitions. NOTE here that anything which is a complete tree that gets evaluated is NOT included.
| h0 | |
| max_depth | |
| max_size |
1.8.13