strategies / sparsity

strategy 03 · sparsity

The economy.

Populace deliberately assembles a candidate frame larger than any deployable file needs, so it can cover state and congressional-district targets at once. That candidate frame then has to be reduced to a record count that ships and simulates — and which records survive the cut changes how well the final file matches its targets.

paper: preprint Read the paper Repository
01 — the 30-second version

Selection beats random thinning; refit beats the raw gates.

L0 regularization with Hard Concrete gates (Louizos et al. 2018) attaches a gate to every candidate record and lets the optimizer drive it toward zero or one, so the retained-record count becomes an explicit optimization variable rather than a fixed draw. Scored on the full Populace US target surface, target-informed selection beats matched random-sampling baselines at the same record budget:

records retained 57,240of 337,704 candidates (17.0%) normalized L0 penalty share 0.8
post-L0 refit loss 4.74%vs 5.07% dense, 7.55% random+reweight capped weighted calibration loss, 32,633 targets
random support, scaled, no refit 24.24%worst of the five compared arms a sparse file still needs a reweighting step

sparsity-paper abstract and Table 5 (Populace commit 558e46c1; three-year pooled ASEC support file, period 2024). The dense no-L0 run was still declining at its 1,500-epoch budget, so the comparison is a finite-optimization result at a matched compute budget, not a claim that dense calibration could not converge lower given more epochs.

Records retained versus calibration loss A plot of records retained (horizontal) against capped weighted calibration loss on 32,633 targets (vertical). L0 selection then refit keeps 57,240 records at 4.74 percent loss — fewer records and lower loss than dense no-L0 calibration, which keeps all 337,704 records at 5.07 percent. At the same 57,240-record budget, random sampling then reweight scores 7.55 percent and the raw gated weights before refit score 9.86 percent. A random support that is scaled without a reweighting step scores 24.24 percent, the worst of the five compared arms. 0% 5% 10% 15% 20% 25% calibration loss 57,240 337,704 records retained → same record budget random, scaled, no refit — 24.24% (worst of five) raw gated weights, no refit · 9.86% random + reweight · 7.55% dense, no L0 all records · 5.07% L0 + refit · 4.74% fewer records, lower loss
Records retained against calibration loss (32,633 targets). Target-informed L0 selection then refit lands down and to the left of dense calibration — 57,240 records at 4.74% versus all 337,704 at 5.07% — so it wins on both axes at once. At the same record budget, random sampling + reweight scores 7.55% and the raw gated weights (before the refit step) 9.86%; a random support scaled without any reweighting scores 24.24%, the worst of the five arms.
02 — the method

Selection and weighting as one optimization.

gatesshipped

Hard Concrete gates

Each candidate record carries a stochastic gate that the optimizer can drive to an exact zero or one while staying differentiable in between, making the expected retained-record count a term the optimizer minimizes alongside calibration error, not a separate thresholding step applied afterward.

refitshipped

Ordinary calibration after selection

The raw gated weights score a 9.86% loss on their own — not good enough to publish. Removing the gates and refitting ordinary calibration weights on exactly the selected 57,240 records lowers that to 4.74%: the gates are valuable as a support selector, and the publication weights should be refit after selection.

concentrationshipped

Soft and hard weight bounds

A soft L2 penalty and a hard per-record weight-ratio cap bound how concentrated the fitted weights can become, so matching the target surface with fewer records cannot be bought by placing arbitrarily large weight on a handful of survivors.

compared against dense no-L0 calibration, random sampling + reweight, and a dense-random scaled sample, all on the same 32,633-target surface and calibration loss

03 — scope and what's next

A proof of concept, not a released frontier.

The reported comparison is a single fixed-penalty, single-seed probe on Populace's current full target surface — a proof of concept that informed selection earns its complexity, not a release-ready budget frontier. Sweeping the normalized penalty across multiple retained counts and concentration settings, and a family-level (not row-level) holdout, are named as next work in the paper rather than run here. Target attainment for the file Populace actually ships is tracked separately on the evaluation strategy page.

Read the full comparison.