VOOZH about

URL: https://www.coursera.org/learn/computational-bayesian-statistics-for-data-science

⇱ Computational Bayesian Statistics for Data Science | Coursera


Computational Bayesian Statistics for Data Science

Ends soon! Keep adding new skills with 10,000+ programs for $239 (usually $399). Save now.

Computational Bayesian Statistics for Data Science

Included with

β€’

Learn more

Gain insight into a topic and learn the fundamentals.
Intermediate level

Recommended experience

2 weeks to complete
at 10 hours a week
Flexible schedule
Learn at your own pace

Gain insight into a topic and learn the fundamentals.
Intermediate level

Recommended experience

2 weeks to complete
at 10 hours a week
Flexible schedule
Learn at your own pace

What you'll learn

  • Articulate the need for computational approaches, such as Markov chain Monte Carlo (MCMC) algorithms, to Bayesian inference.  

  • Implement algorithms to find posterior distributions, including Gibbs sampling, Metropolis-Hastings, and various advanced MCMC algorithms.

  • Implement Bayesian computation in the Stan computing environment. 

  • Apply computational Bayesian statistical methods to real-world data science problems. 

Details to know

Shareable certificate

Add to your LinkedIn profile

Recently updated!

May 2026

Assessments

5 assignments

Taught in English

There are 5 modules in this course

This course equips learners with the theoretical knowledge and computational skills needed to implement modern Bayesian statistical methods in real-world settings. By completing the course, learners will be able to build and fit Bayesian models, apply computational algorithms for posterior inference, and interpret uncertainty in complex data analysis problems. Topics include maximum a posteriori (MAP) estimation, rejection sampling, and Markov chain Monte Carlo (MCMC) methods such as the Gibbs sampler and Metropolis-Hastings algorithms. Learners will also gain hands-on experience using Stan, one of the leading platforms for Bayesian modeling and probabilistic programming.

The course is designed for learners seeking to strengthen their statistical, machine learning, and data science capabilities in industry or research settings. Bayesian methods are increasingly used in areas such as AI, forecasting, experimentation, risk analysis, and decision-making under uncertainty. Unlike many applied courses that focus primarily on software tools, this course emphasizes both the mathematical foundations and computational intuition underlying modern Bayesian workflows, helping learners develop a deeper understanding of how and why these methods work. This course can be taken for academic credit as part of CU Boulder’s Master of Science in Data Science (MS-DS) degree offered on the Coursera platform. The MS-DS is an interdisciplinary degree that brings together faculty from CU Boulder’s departments of Applied Mathematics, Computer Science, Information Science, and others. With performance-based admissions and no application process, the MS-DS is ideal for individuals with a broad range of undergraduate education and/or professional experience in computer science, information science, mathematics, and statistics. Learn more about the MS-DS program at https://www.coursera.org/degrees/master-of-science-data-science-boulder.

Some Bayesian inference problems are easily solved with basic algebra and calculus. For example, with a beta prior distribution over the probability of success in a binomial process, it is easy to show that the posterior distribution over the probability of success is also a beta distribution. However, many other, more complicated problems are not as easily solved. Instead, they require computational methods for approximating posterior distributions and their summary statistics. In this module, students will learn some computational algorithms for posterior distribution summaries, including the gradient ascent algorithm for calculating the MAP (maximum a posteriori) estimator, and Monte Carlo methods for computing other summary statistics from the posterior distribution.

What's included

8 videos4 readings1 assignment1 programming assignment2 ungraded labs

8 videosβ€’Total 95 minutes
  • Course Introductionβ€’2 minutes
  • MAP Estimation in Contextβ€’4 minutes
  • The Gradient Ascent Algorithmβ€’14 minutes
  • Implementation of the Gradient Ascent Algorithm in R: Part 1β€’5 minutes
  • Implementation of the Gradient Ascent Algorithm in R: Part 2β€’17 minutes
  • Implementation of the Gradient Ascent Algorithm in R: Part 3β€’24 minutes
  • Numeric Integration and Monte Carlo Estimationβ€’20 minutes
  • Computational Tipsβ€’10 minutes
4 readingsβ€’Total 26 minutes
  • Earn Academic Credit for your Work!β€’10 minutes
  • Course Supportβ€’10 minutes
  • Assessment Expectationsβ€’5 minutes
  • Module 1 Slide Deckβ€’1 minute
1 assignmentβ€’Total 30 minutes
  • Introduction to Computational Bayesian Statistics Quizβ€’30 minutes
1 programming assignmentβ€’Total 60 minutes
  • Module 1 Programming Assignmentβ€’60 minutes
2 ungraded labsβ€’Total 120 minutes
  • Finding Gradients and the Gradient Ascent Algorithmβ€’60 minutes
  • The Gradient Ascent Algorithm in Rβ€’60 minutes

In this module, we introduce rejection sampling as a means of producing independent draws from a posterior density distribution where the density distribution's normalizing constant might not be known.

What's included

7 videos1 reading1 assignment1 programming assignment1 ungraded lab

7 videosβ€’Total 75 minutes
  • Rejection Sampling Procedureβ€’8 minutes
  • Proof of Rejection Samplingβ€’17 minutes
  • Motivating Hierarchical Modelsβ€’7 minutes
  • Hierarchical Models: A Bayesian Approachβ€’8 minutes
  • Reparameterizing the Hierarchical Modelβ€’10 minutes
  • Rejection Sampling Example in R: Part 1β€’11 minutes
  • Rejection Sampling Example in R: Part 2β€’15 minutes
1 readingβ€’Total 1 minute
  • Module 2 Slide Deckβ€’1 minute
1 assignmentβ€’Total 30 minutes
  • Rejection Sampling Quizβ€’30 minutes
1 programming assignmentβ€’Total 60 minutes
  • Module 2 Programming Assignmentβ€’60 minutes
1 ungraded labβ€’Total 60 minutes
  • Rejection Sampling in Rβ€’60 minutes

This module focuses on Gibbs sampling which is an Markov Chain Monte Carlo (MCMC) method for generating random draws from a posterior density distribution when the distribution of one model parameter conditioned on the other model parameters is known.

What's included

2 videos1 reading1 assignment1 ungraded lab

2 videosβ€’Total 38 minutes
  • Gibbs Samplingβ€’20 minutes
  • Gibbs Sampling in Rβ€’18 minutes
1 readingβ€’Total 1 minute
  • Module 3 Slide Deckβ€’1 minute
1 assignmentβ€’Total 30 minutes
  • Gibb's Sampling Quizβ€’30 minutes
1 ungraded labβ€’Total 60 minutes
  • Gibbs Sampling in R Labβ€’60 minutes

This module introduces the Metropolis sampling algorithm, another MCMC method for generating approximately independent, random draws from a posterior density distribution. The module also covers the Metropolis-Hastings extension of the Metropolis sampling algorithm and ends with a brief overview of some of the adaptations to the Metropolis-Hastings algorithm.

What's included

9 videos1 reading1 assignment1 programming assignment2 ungraded labs

9 videosβ€’Total 115 minutes
  • Metropolis Sampling Algorithmβ€’24 minutes
  • Metropolis Sampling Algorithm: An Example in Rβ€’16 minutes
  • Metropolis Sampling Algorithm: An Example of a Non-identifiable Model in Rβ€’5 minutes
  • Generalization of Metropolis Algorithm to the Metropolis Hastings Algorithmβ€’3 minutes
  • Why the Metropolis Hastings Algorithm Worksβ€’18 minutes
  • Convergence of the Metropolis Hastings Algorithmβ€’12 minutes
  • Adaptive Metropolis Hastings Algorithmβ€’6 minutes
  • Adaptive Metropolis Hastings Algorithm: An Example in Rβ€’24 minutes
  • Limitations of the Metropolis and Metropolis Hastings Algorithmsβ€’7 minutes
1 readingβ€’Total 1 minute
  • Module 4 Slide Deckβ€’1 minute
1 assignmentβ€’Total 30 minutes
  • Metropolis Hastings Sampling Quizβ€’30 minutes
1 programming assignmentβ€’Total 180 minutes
  • Module 4 Programming Assignmentβ€’180 minutes
2 ungraded labsβ€’Total 120 minutes
  • Metropolis Sampling in R Labβ€’60 minutes
  • Adaptive Metropolis Sampling in R Labβ€’60 minutes

This module introduces STAN and demonstrates its use in R using Google Colab. STAN provides an efficient implementation of an adaptive Metropolis-Hastings algorithm, to overcome some of the limitations of the Metropolis-Hastings algorithm.

What's included

4 videos1 reading1 assignment1 programming assignment2 ungraded labs

4 videosβ€’Total 55 minutes
  • Extending Metropolis Hastings to STANβ€’9 minutes
  • STAN: A Binomial Example in Rβ€’17 minutes
  • STAN: A Simple Linear Regression Example in Rβ€’12 minutes
  • STAN: A Multiparameter Example in Rβ€’16 minutes
1 readingβ€’Total 1 minute
  • Module 5 Slide Deckβ€’1 minute
1 assignmentβ€’Total 30 minutes
  • STAN Quizβ€’30 minutes
1 programming assignmentβ€’Total 60 minutes
  • Module 5 Programming Assignmentβ€’60 minutes
2 ungraded labsβ€’Total 120 minutes
  • Using STAN in Rβ€’60 minutes
  • Using STAN in Rβ€’60 minutes

Instructor

University of Colorado Boulder
5 Coursesβ€’15,384 learners

Explore more from Probability and Statistics

Why people choose Coursera for their career

πŸ‘ Image

Felipe M.

Learner since 2018
"To be able to take courses at my own pace and rhythm has been an amazing experience. I can learn whenever it fits my schedule and mood."
πŸ‘ Image

Jennifer J.

Learner since 2020
"I directly applied the concepts and skills I learned from my courses to an exciting new project at work."
πŸ‘ Image

Larry W.

Learner since 2021
"When I need courses on topics that my university doesn't offer, Coursera is one of the best places to go."
πŸ‘ Image

Chaitanya A.

"Learning isn't just about being better at your job: it's so much more than that. Coursera allows me to learn without limits."

Frequently asked questions

To access the course materials, assignments and to earn a Certificate, you will need to purchase the Certificate experience when you enroll in a course. You can try a Free Trial instead, or apply for Financial Aid. The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.

When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile.

Yes. In select learning programs, you can apply for financial aid or a scholarship if you can’t afford the enrollment fee. If fin aid or scholarship is available for your learning program selection, you’ll find a link to apply on the description page.

Financial aid available,