Abowd 2022 - 2020 Census TopDown Algorithm - Overview

Summary

The U.S. Census Bureau’s TopDown Algorithm (TDA) produces privacy-protected microdata for the 2020 Census Redistricting Data (P.L. 94-171) Summary File. It takes noisy discrete-Gaussian measurements of marginal queries at every level of the geographic hierarchy (US, state, county, tract, block group, block), accounts for privacy with zero-concentrated DP, and then post-processes top-down with non-negative weighted least squares plus controlled rounding to produce consistent, non-negative integer microdata subject to invariants. Production used a total privacy-loss budget ( persons, housing units).

Overview

Problem. Decennial census data apportion the House, allocate at least $675 billion of federal funds each year, and redistrict every legislative body, yet respondent confidentiality is legally mandated. Traditional methods (swapping, suppression, aggregation) are vulnerable to reconstruction attacks given modern computing and abundant auxiliary data. The Bureau adopted formal privacy and had to meet hard operational requirements: microdata output (non-negative integer counts), internal consistency, invariants, edit constraints, and accuracy for use cases defined only after release (redistricting).

What the paper does. Describes the DP mechanisms, the optimization-based post-processing, the privacy-loss accounting, the tuning and testing history, and utility experiments on 2010 data.

Key facts.

ItemValue
Privacy framework-zCDP, converted to by the Bun-Steinke conversion at for communication
Noisemultivariate discrete Gaussian (exact sampling; Canonne-Kamath-Steinke)
Geographic spineUS, state, county, tract, block group, block (+ AIAN spine, custom block groups)
Person detailed query2,016 cells without geography; 11,879,679,168 with geography
Housing-unit detailed query11,785,396 cells (occupancy by block)
Invariantsstate populations; housing units per block; occupied group quarters (count and type) per block
Production budget: persons 2.56, housing units 0.07
Final pre-production demo (Apr 2021) () and ()
Utility targetlargest race/ethnicity share within percentage points of the enumerated share at least 95% of the time

Main Content

Source Map

Paper sectionContentCovered in
Abstract, 1 Introductionscope, roadmapthis note
2 Differential Privacy: what and why (2.1 definitions, Defs. 1-2, Fig. 1; 2.2 curator models)rationale, zCDP, curator modelsAbowd 2022 - Why Differential Privacy, zCDP and Curator Models
3 Policy and practical constraintsmicrodata, consistency, invariants, multi-use accuracyAbowd 2022 - Policy Constraints, Invariants and the Redistricting Schema
4 Sources of uncertaintydisclosure avoidance vs census errorAbowd 2022 - Policy Constraints, Invariants and the Redistricting Schema
5 Redistricting data (5.1 schema, 5.2 invariants, 5.3 edit constraints)tables P1-P5, H1, detailed queriesAbowd 2022 - Policy Constraints, Invariants and the Redistricting Schema
6.1 Discrete Gaussian (Defs. 3-4, Theorem 1)mechanismAbowd 2022 - Discrete Gaussian, Queries and the Optimization Problem
6.2 Notation; 6.3 Problem statement and utility; 6.4 Queriescontingency-table formalism, optimization problemAbowd 2022 - Discrete Gaussian, Queries and the Optimization Problem
6.5 The TopDown Algorithm (Table 1)algorithmAbowd 2022 - The TopDown Algorithm and Privacy Accounting Proof
7.1 Basic estimators (Eqs. 7.1-7.4)least squares and rounderAbowd 2022 - Least Squares and Rounder Estimators
7.2 Multi-pass least squares (7.5-7.6); 7.3 Multi-query multi-pass rounder (7.7)improvementsAbowd 2022 - Least Squares and Rounder Estimators
7.4 AIAN spine; 7.5 Optimized spine (Table 2); 7.6 Computinggeography and systemAbowd 2022 - Geography Spines, Computing Environment and Block-by-Block Baseline
8.1 Tuning and demonstration products (Tables 3-5); 8.2 Production settings (Tables 6-8)budget allocationAbowd 2022 - Privacy-Loss Budget Allocation and Tuning
8.3 Accuracy over time (Figures 2-5)accuracy historyAbowd 2022 - Utility Experiments
9 Utility experiments (Tables 9-13)marginal effectsAbowd 2022 - Utility Experiments
10 Conclusiontimeline, public processAbowd 2022 - Conclusion, Limitations and Marketing Relevance
Appendix A Block-by-block algorithm (Table 14; A.1 comparison)baselineAbowd 2022 - Geography Spines, Computing Environment and Block-by-Block Baseline
Appendix B TDA satisfies -DP (Theorem 2)privacy proofAbowd 2022 - The TopDown Algorithm and Privacy Accounting Proof

The idea in one picture

Measure marginals at each geographic level with independent noise. Then estimate from the top: fit the US, fix it, fit the states given the US, fix them, and so on down to blocks. Each fit is an inverse-variance-weighted least-squares problem with non-negativity, invariant and aggregation constraints, followed by a controlled rounding to integers. Post-processing costs no privacy; the total privacy loss is the sum of the spent across levels because every level touches the same individual.

Examples

Why not just measure blocks?

Appendix A.1: with only total population, no invariants and negative estimates allowed, taking block-level Gaussian measurements with variance for each of blocks at total budget makes the national total’s variance , an unacceptable MSE. Splitting into six equal levels gives variance per measurement at every level, so the national total is vastly better and most other levels are better too (except blocks and block groups with fewer than six blocks).

Connections

See Also