Publication Date
In 2025 | 0 |
Since 2024 | 0 |
Since 2021 (last 5 years) | 1 |
Since 2016 (last 10 years) | 2 |
Since 2006 (last 20 years) | 2 |
Descriptor
Algorithms | 2 |
Bayesian Statistics | 2 |
Computation | 2 |
Statistical Inference | 2 |
Artificial Intelligence | 1 |
Generalization | 1 |
Markov Processes | 1 |
Monte Carlo Methods | 1 |
Regression (Statistics) | 1 |
Statistical Distributions | 1 |
Source
Grantee Submission | 2 |
Author
Gelman, Andrew | 2 |
Vehtari, Aki | 2 |
Blomstedt, Paul | 1 |
Cunningham, John P. | 1 |
Jylänki, Pasi | 1 |
Robert, Christian P. | 1 |
Sahai, Swupnil | 1 |
Schiminovich, David | 1 |
Sivula, Tuomas | 1 |
Tran, Dustin | 1 |
Yao, Yuling | 1 |
More ▼ |
Publication Type
Journal Articles | 2 |
Reports - Descriptive | 1 |
Reports - Research | 1 |
Education Level
Audience
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Vehtari, Aki; Gelman, Andrew; Sivula, Tuomas; Jylänki, Pasi; Tran, Dustin; Sahai, Swupnil; Blomstedt, Paul; Cunningham, John P.; Schiminovich, David; Robert, Christian P. – Grantee Submission, 2020
A common divide-and-conquer approach for Bayesian computation with big data is to partition the data, perform local inference for each piece separately, and combine the results to obtain a global posterior approximation. While being conceptually and computationally appealing, this method involves the problematic need to also split the prior for…
Descriptors: Bayesian Statistics, Algorithms, Computation, Generalization
Yao, Yuling; Vehtari, Aki; Gelman, Andrew – Grantee Submission, 2022
When working with multimodal Bayesian posterior distributions, Markov chain Monte Carlo (MCMC) algorithms have difficulty moving between modes, and default variational or mode-based approximate inferences will understate posterior uncertainty. And, even if the most important modes can be found, it is difficult to evaluate their relative weights in…
Descriptors: Bayesian Statistics, Computation, Markov Processes, Monte Carlo Methods