Modules

Week learning objectives, slides, and task list

Week 1

Week Learning Objectives

By the end of this module, you will be able to

  • Navigate the course website and Blackboard site
  • Identify the Slack channels relevant for the course
  • Describe the historical origin of Bayesian statistics
  • Identify components in research papers involving Bayesian analyses
  • Knit a simple R Markdown file

Task List

  1. Review the syllabus
  2. Review the resources (slides and note)
  3. Install/Update R and RStudio on your computer
  4. Attend the Tuesday and Thursday class meetings
  5. Complete the assigned readings
  6. Introduce yourself on the #introduction Slack channel (as part of HW 1)
  7. Complete Homework 1 (see instruction on Blackboard)

Slides

PDF version

Week 2

Week Learning Objectives

By the end of this module, you will be able to

  • Explain the three axioms/properties of probability
  • Describe the subjectivist interpretation of probability, and contrast it with the frequentist interpretation
  • Explain the difference between probability mass and probability density
  • Compute probability density using simulations
  • Compute joint, marginal, and conditional probabilities with two variables
  • Write an R function and use loops for repeating computations

Task List

  1. Complete the assigned readings
    • Kruschke ch. 4
    • Wickham & Grolemund ch. 7, 19.1-19.5
  2. Review the resources (slides and notes on probability and R basics)
  3. Attend the Tuesday and Thursday class meetings
  4. Complete Homework 2 (see instruction on Blackboard)

Slides

PDF version

Week 3

Week Learning Objectives

By the end of this module, you will be able to

  • Derive Bayes’ rule from the definition of conditional probability
  • Apply Bayes’ rule to obtain posterior from prior and data
  • Explain what data-order invariance and exchangeability are
  • Use grid approximation to obtain the posterior for a Bernoulli model
  • Describe the influence of sample size and prior on the posterior
  • Use R to perform prior predictive checks

Task List

  1. Complete the assigned readings
  2. Review the resources (slides and note)
  3. Attend the Tuesday and Thursday class meetings
  4. No homework for this week, but you may work on Q1 and Q2 for Homework 3 (see instruction on Blackboard)

Slides

PDF version

Week 4

Week Learning Objectives

By the end of this module, you will be able to

  • Apply Bayesian workflow to analyze real data with a Bernoulli model
  • Explain the idea of a conjugate prior
  • Summarize the posterior distribution using simulations
  • Apply Bayesian terminology in summarizing the posterior
  • Use R to perform posterior predictive checks

Task List

  1. Complete the assigned readings
  2. Review the resources (slides and note)
  3. Attend the Tuesday and Thursday class meetings
  4. Complete Homework 3 (see instruction on Blackboard)

Slides

PDF version

Week 5

Week Learning Objectives

By the end of this module, you will be able to

  • Explain what is unique for samples using Markov Chain Monte Carlo (MCMC)
  • Explain why we need MCMC to approximate the posterior
  • Describe when MCMC samples are representative and accurate for approximating the posterior
  • Use R to perform convergence diagnostics for MCMC samples

Task List

  1. Complete the assigned readings
    • Kruschke ch. 7
  2. Review the resources (slides and note)
  3. Attend the Tuesday and Thursday class meetings
  4. Complete Homework 4 (see instruction on Blackboard)

Slides

PDF version

Week 6

Week Learning Objectives

By the end of this module, you will be able to

  • Apply Gibbs sampling to summarize parameters of a normal model

Task List

  1. Complete the assigned readings
    • Kruschke ch. 7
  2. Review the resources (slides and note)
  3. Attend the Tuesday and Thursday class meetings
  4. Complete Homework 5 (see instruction on Blackboard)

Slides

PDF version

Week 7

Week Learning Objectives

By the end of this module, you will be able to

  • Describe, conceptually, how the Hamiltonian Monte Carlo (HMC) algorithm achieves a better efficiency with the use of the gradients
  • Explain how tuning the step size and the tree depth affects HMC
  • Program a simple Bayesian model in Stan

Task List

  1. Complete the assigned readings
    • Kruschke ch. 14
  2. Review the resources (slides and note)
  3. Attend the Tuesday and Thursday class meetings

Slides

PDF version

Week 8

Week Learning Objectives

By the end of this module, you will be able to

  • Explain the logic of a hierarchical model
  • Apply the binomial distribution to describe the sum of multiple Bernoulli trials
  • Program a hierarchical binomial model in Stan
  • Analyze secondary data using a hierarchical normal model (i.e., random-effect meta-analysis)

Task List

  1. Complete the assigned readings
    • Kruschke ch. 9
  2. Review the resources (slides and note)
  3. Attend the Tuesday and Thursday class meetings
  4. Start thinking about the class project
    • Prospectus due March 21

Slides

PDF version

Lecture Videos

Hierarchical binomial

Hierarchical normal

Week 9

Week Learning Objectives

By the end of this module, you will be able to

  • Conduct a Bayesian comparison of two groups
  • Apply a \(t\) model for robust modeling
  • Select an appropriate distribution for different kinds of data
  • Conduct comparisons with hierarchical data (e.g., within-subject designs)

Task List

  1. Complete the assigned readings
    • Kruschke ch. 12.1, 16
  2. Review the resources (note)
  3. Attend class meetings
  4. Start thinking about the class project
    • Prospectus due March 21

Week 11

Week Learning Objectives

By the end of this module, you will be able to

  • Describe the three components of the generalized linear model (GLM)
  • Name examples of the GLM (e.g., linear regression, Poisson regression)
  • Interpret the coefficients in a linear regression model
  • Obtain posterior predictive distributions and checks
  • Perform Bayesian regression with the R package brms

Task List

  1. Complete the assigned readings
    • Kruschke ch. 15, 17
  2. Review the resources (note)
  3. Attend class meetings
  4. Complete Homework 7 (see instruction on Blackboard)
  5. Schedule a meeting with the instructor for your prospectus (see sign-up link on Blackboard)

Slides

PDF version

Week 12–13

Week Learning Objectives

By the end of this module, you will be able to

  • Draw a directed acyclic graph (DAG) to represent causal assumptions
  • Use a DAG to guide analyses for obtaining causal effects
  • Describe how randomization can remove potential confounders
  • Explain how the back-door criterion can be used to identify a set of adjusted variables with nonexperimental data
  • Perform a mediation analysis and interpret the results

Task List

  1. Complete the assigned readings
    • McElreath ch 5, 6
  2. Review the resources (note)
  3. Attend class meetings
  4. Complete Homework 8 (see instruction on Blackboard)

Slides

PDF version

Week 14

Week Learning Objectives

By the end of this module, you will be able to

  • Describe the difference between subgroup analyses and an interaction model
  • Interpret results from an interaction model using plots and posterior predictions
  • Explain how information criteria approximates out-of-sample divergence from the “true” model
  • Use WAIC and LOO-IC to compare models

Task List

  1. Complete the assigned readings
    • McElreath ch. 7
  2. Review the resources (notes on interaction and model comparison)
  3. Attend class meetings
  4. Complete Homework 9 (see instruction on Blackboard)

Slides

PDF version

Week 15

Week Learning Objectives

By the end of this module, you will be able to

  • Use DAGs to describe the different missing data mechanisms
  • Use the mi() syntax in brms to account for missing data based on a DAG
  • Explain the Bayesian ideas in the technique multiple imputation

Task List

  1. Complete the assigned readings
    • McElreath ch. 15
  2. Review the resources (note23)
  3. Attend class meetings
  4. Complete Homework 10 (see instruction on Blackboard)
  5. Prepare your final project/paper

Last updated

[1] "April 28, 2022"

Corrections

If you see mistakes or want to suggest changes, please create an issue on the source repository.

Reuse

Text and figures are licensed under Creative Commons Attribution CC BY-NC-SA 4.0. Source code is available at https://github.com/marklhc/20221-psyc573-usc, unless otherwise noted. The figures that have been reused from other sources don't fall under this license and can be recognized by a note in their caption: "Figure from ...".