Search Results for author:
Found 4 papers, 2 papers with code
Parsimony and the rank of a flattening matrix
The standard models of sequence evolution on a tree determine probabilities for every character or site pattern.
Multilevel Delayed Acceptance MCMC with an Adaptive Error Model in PyMC3
Uncertainty Quantification through Markov Chain Monte Carlo (MCMC) can be prohibitively expensive for target probability densities with expensive likelihood functions, for instance when the evaluation it involves solving a Partial Differential Equation (PDE), as is the case in a wide range of engineering applications.
Probabilistic Programming
Computation
Bayesian inference of species trees using diffusion models
We describe a new and computationally efficient Bayesian methodology for inferring species trees and demographics from unlinked binary markers.
Approximation and sampling of multivariate probability distributions in the tensor train decomposition
We find that the importance-weight corrected quasi-Monte Carlo quadrature performs best in all computed examples, and is orders-of-magnitude more efficient than DRAM across a wide range of approximation accuracies and sample sizes.
Numerical Analysis Probability Statistics Theory Statistics Theory 65D15, 65D32, 65C05, 65C40, 65C60, 62F15, 15A69, 15A23
