Single MCMC chain parallelisation on decision trees

DOI10.1007/S10472-023-09876-9MaRDI QIDQ6999157zbMATH OpenFDO

Authors Efthyvoulos Drousiotis, P. G. Spirakis

Publication date 9 April 2025

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10472-023-09876-9

zbMATH Keywords

machine learningparallel algorithmsMCMC decision tree

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Bayesian inference (62F15) Monte Carlo methods (65C05) Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• scientific article; zbMATH DE number 3733101 (Why is no real title available?)
• scientific article; zbMATH DE number 814821 (Why is no real title available?)
• scientific article; zbMATH DE number 7306891 (Why is no real title available?)
• A Bayesian CART algorithm
• Accelerating MCMC algorithms
• BART: Bayesian additive regression trees
• Equation of state calculations by fast computing machines
• Monte Carlo sampling methods using Markov chains and their applications
• Numerical integrators for the hybrid Monte Carlo method
• Optimum Monte-Carlo sampling using Markov chains
• Parallelizing MCMC sampling via space partitioning
• Sensitivity analysis and emulation for functional data using Bayesian adaptive splines
• Unbiased Markov Chain Monte Carlo Methods with Couplings

This page was built for publication: Single MCMC chain parallelisation on decision trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6999157)