Unifying summary statistic selection for approximate Bayesian computation
From MaRDI portal
Cites work
- A comparative review of dimension reduction methods in approximate Bayesian computation
- A generalized solution of the orthogonal Procrustes problem
- Approximately sufficient statistics and Bayesian computation
- Asymptotic Statistics
- Considerate approaches to constructing summary statistics for ABC model selection
- Constructing summary statistics for approximate Bayesian computation: semi-automatic approximate Bayesian computation. With discussion and authors' reply
- Cost-based Feature Selection for Network Model Choice
- Dealing With Label Switching in Mixture Models
- Distances Between Probability Distributions of Different Dimensions
- scientific article; zbMATH DE number 3366295 (Why is no real title available?)
- Latent Space Approaches to Social Network Analysis
- Learning Summary Statistic for Approximate Bayesian Computation via Deep Neural Network
- Model Misspecification in Approximate Bayesian Computation: Consequences and Diagnostics
- Multivariate density estimation. Theory, practice, and visualization
- Networks
- Normalizing flows for probabilistic modeling and inference
- On Distributions Admitting a Sufficient Statistic
- On optimal selection of summary statistics for approximate Bayesian computation
- Properties of a neutral allele model with intragenic recombination
- Semi-automatic selection of summary statistics for ABC model choice
This page was built for publication: Unifying summary statistic selection for approximate Bayesian computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6849226)