scott cunningham

ben h. williams professor of economics
baylor university

Gov 2001: Quantitative Social Science Methods I

Spring 2026 — Harvard University

Instructor: Scott Cunningham

Email: anthony_cunningham@fas.harvard.edu

Meeting: Mon & Wed, 1:30–2:45 PM, Sever 208

Office Hours: Mon & Wed, 3:00–5:00 PM

CGIS Knafel Building, Room 402 (1737 Cambridge St)

By appointment only: Sign up via Calendly

Teaching Fellow: Kaixiao Liu

TF Email: kaixiaoliu@g.harvard.edu

Sections:

Fridays 10:30–11:45 AM (LISE 303)

Fridays 1:30–2:45 PM (Boylston 104)

TF Office Hours: Sign up via Calendly

Course Description

This course provides a rigorous foundation in quantitative social science methods for first-year PhD students. After reviewing basic probability theory, we offer a systematic introduction to statistical inference and linear regression—the workhorse tools for empirical research in political science.

We take a "population-first" approach: define what you want to know about the population before worrying about estimation. Probability is the language for describing populations; statistics is the machinery for learning about them from samples.

Required Texts

  • Blackwell, Matthew. A User's Guide to Statistical Inference and Regression. Free online
  • Aronow, Peter M. and Benjamin T. Miller (A&M). Foundations of Agnostic Statistics. Cambridge University Press. Amazon

Suggested Text

  • Angrist, Joshua D. and Jörn-Steffen Pischke (MHE). Mostly Harmless Econometrics: An Empiricist's Companion. Princeton University Press. Amazon — The most widely used text in applied causal inference. We reference Chapter 3 on regression. Inexpensive and worth owning.

Grading

Component Weight
Problem Sets (weekly) 30%
Midterm Exam (in-class, Week 7) 35%
Final Exam (in-class) 35%

Note: 70% of your grade comes from in-class exams. Problem sets are for learning; exams are for assessment.

Problem Sets

Problem sets are due Tuesdays at 11:59 PM. Each includes analytical problems and R simulation components. Weekly problem sets help you practice and internalize the material before exams.

Assignment Due Date Topics
Problem Set 1 Tue Feb 3, 11:59 PM Probability, conditional probability, Bayes' rule
Problem Set 2 Tue Feb 10 Random variables, expectation, variance
Problem Set 3 Tue Feb 17 TBD
Problem Set 4 Tue Feb 24, 11:59 PM Joint distributions, covariance, correlation
Problem Set 5 Tue Mar 3, 11:59 PM CEF, sampling, bootstrap, propensity scores
Spring Break: March 14–22 | Midterm Week 7 (before break)
Problem Set 6 Tue Mar 31 Markov & Chebyshev bounds; Consistency via LLN; CLT & delta method; Confidence intervals (Chebyshev vs CLT)
Problem Set 7 Wed Apr 8 Hypothesis testing, p-values, power, bootstrap
Problem Set 8 Tue Apr 14 TBD
Problem Set 9 Tue Apr 21 TBD
Problem Set 10 Tue Apr 28 TBD

Schedule

Part I: Statistical Inference (Weeks 1–7)

Week Dates Topic Readings Slides R Scripts
1 Jan 26, 28 Introduction; Probability Foundations A&M 1.1; Blackwell 2.1 Introduction | Probability
2 Feb 2, 4 Random Variables; Expectation and Variance A&M 1.2, 2.1; Blackwell 2.2–2.5 Random Variables | Working Session | Expected Value Puzzle (note from Feb 5)
3 Feb 9, 11 Famous Distributions: Discrete (Bernoulli, Binomial, Poisson) and Continuous (Uniform, Normal, Exponential) A&M 1.3, 2.2; Blackwell 2.4–2.5 Discrete Distributions | Continuous Distributions
4 Feb 16, 18 Joint Distributions; Conditional Expectation and LIE A&M 2.2.3–2.2.4; Blackwell Ch. 1 Joint Distributions
5 Feb 23, 25 CEF, Sampling, and Estimation; Plug-in Estimator A&M 2.2.3–2.2.4, 3.1; Blackwell Ch. 1, 3; MHE Ch. 3 CEF & Sampling
6 Mar 2, 4 MLE; Asymptotics and LLN A&M 3.2, Ch. 5; Blackwell Ch. 3 Likelihood & MLE | Asymptotics & LLN
7 Mar 9, 11 CLT, Confidence Intervals, Delta Method; MIDTERM (Wed Mar 11) A&M 3.2.3, 3.3.1; Blackwell Ch. 2 CLT & CIs
Spring Break: March 14–22

Part II: Inference & Regression (Weeks 8–13)

Week Dates Topic Readings Slides R Scripts
8 Mar 23, 25 Asymptotics Continued: Confidence Intervals and Practice A&M 3.2.3, 3.3.1; Blackwell Ch. 2 Confidence Intervals | Delta Method & Practice
9 Mar 30, Apr 1 Hypothesis Testing; Power and Bootstrap A&M 3.3.2–3.3.3, 3.4.3; Blackwell Ch. 4 Hypothesis Testing | Power & Bootstrap
10 Apr 6, 8 What Is Regression? (BLP, OLS intro) Blackwell Ch. 5; A&M 2.2.4; MHE 3.1 BLP & OLS | Multiple Regression
11 Apr 13, 15 OVB & Interactions (Mon); OLS Mechanics I (Wed) Blackwell Ch. 6–7; A&M 4.1 OVB & Interactions | OLS Mechanics I
12 Apr 20, 22 OLS Inference (Wed) Blackwell Ch. 6; MHE 3.1.3, 3.2.2 OLS Inference
13 Apr 27, 29 Robust & Clustered SEs (Mon); Variance Weights (Wed) Blackwell Ch. 7; A&M 4.1.4, 4.2; MHE 8.2; Angrist (1998); Sloczyński (2022); A&M 7.3 Non-spherical SEs · recording
Variance Weights · recording · Shiny app
May 7–16 FINAL EXAM (during finals period)

Practice Final Exam

The Practice Final Exam is a 15-problem packet organized into five scaffolded parts. Each part builds toward one of the five families of problem you will see on the actual final. The three problems within each part walk you up the skill stack: the first drills a single foundational move, the second combines two moves, and the third puts the whole stack together on a full in-family problem.

The point is not to memorize answers. The numbers, distributions, and design matrices on the real exam will be different. The point is to build pattern recognition: when you see an unfamiliar problem on the final, you should recognize which family it belongs to and know which tools to reach for. If you have practiced all three problems within a part, you should be able to execute the steps on a new problem in that family without hesitation.

Suggested approach. Do the third problem in each part (1c, 2c, 3a or 3b, 4c, 5c) first, closed-book and timed. The c-problems are the full rehearsals; the a's and b's are scaffolds you can fall back on if you get stuck. Solutions will be posted later this week.

Companion Shiny app for Problem 5c (variance-weighted regression): the OLS weights interactive app lets you slide $P(G{=}1)$, $p_0$, $p_1$, $\tau_0$, $\tau_1$ in real time and watch the ATE, the OLS coefficient, and the gap update live. The first load is slow (the WebAssembly R runtime downloads in your browser); after that it's instant. Use it to build intuition for how the variance weights respond to take-up and stratum size.

Course Policies

AI Policy

Do not use AI assistants (ChatGPT, Claude, Copilot, etc.) on problem sets. Work with your classmates instead. The learning happens when you struggle through confusion. The 70% of your grade that comes from in-class exams will reveal whether you actually understand the material.

Certain assignments in this course will permit or even encourage the use of generative artificial intelligence (GAI) tools such as ChatGPT. The default is that such use is disallowed unless otherwise stated. Any such use must be appropriately acknowledged and cited. It is each student’s responsibility to assess the validity and applicability of any GAI output that is submitted; you bear the final responsibility. Violations of this policy will be considered academic misconduct. We draw your attention to the fact that different classes at Harvard could implement different AI policies, and it is the student’s responsibility to conform to expectations for each course.

Collaboration

You may discuss problem sets with classmates, but you must write your own solutions and code independently. List all collaborators on your submission.

Late Policy

You have 2 late days total for the semester to use at your discretion—no approval needed. After your late days are used, problem sets lose 10% per day late. Additional extensions require advance approval.