1 #ifndef PARALLELAMPROPOSAL_H_
2 #define PARALLELAMPROPOSAL_H_
7 namespace SamplingAlgorithms {
13 std::shared_ptr<AbstractSamplingProblem> problem);
16 std::shared_ptr<AbstractSamplingProblem> problem,
17 std::shared_ptr<parcer::Communicator>
const& newcomm);
27 virtual void Adapt(
unsigned int const t, std::vector<std::shared_ptr<SamplingState>>
const& states)
override;
An implemental of the Adaptive Metropolis algorithm.
unsigned int totSamps
The total number of samples used for the adaption.
ParallelAMProposal(boost::property_tree::ptree pt, std::shared_ptr< AbstractSamplingProblem > problem)
virtual ~ParallelAMProposal()=default
virtual void Adapt(unsigned int const t, std::vector< std::shared_ptr< SamplingState >> const &states) override
Adapt the proposal after each step.
ParallelAMProposal(boost::property_tree::ptree pt, std::shared_ptr< AbstractSamplingProblem > problem, std::shared_ptr< parcer::Communicator > const &newcomm)