mlsanityData to 7 Oct 2026

Predicting Census Survey Response Rates With Parsimonious Additive Models and Structured Interactions

arXiv 2108.11328 ↗First posted 24 Aug 2021stat.ML cs.LG stat.APcited by 3

Not on the map. Why?

Abstract (arXiv)

In this paper, we consider the problem of predicting survey response rates using a family of flexible and interpretable nonparametric models. The study is motivated by the US Census Bureau's well-known ROAM application, which uses a linear regression model trained on the US Census Planning Database data to identify hard-to-survey areas. A crowdsourcing competition (Erdman and Bates, 2016) organized more than ten years ago revealed that machine learning methods based on ensembles of regression trees led to the best performance in predicting survey response rates; however, the corresponding models could not be adopted for the intended application due to their black-box nature. We consider nonparametric additive models with a small number of main and pairwise interaction effects using ℓ0-based penalization. From a methodological viewpoint, we study our estimator's computational and statistical aspects and discuss variants incorporating strong hierarchical interactions. Our algorithms (open-sourced on GitHub) extend the computational frontiers of existing algorithms for sparse additive models to be able to handle datasets relevant to the application we consider. We discuss and interpret findings from our model on the US Census Planning Database. In addition to being useful from an interpretability standpoint, our models lead to predictions comparable to popular black-box machine learning methods based on gradient boosting and feedforward neural networks - suggesting that it is possible to have models that have the best of both worlds: good model accuracy and interpretability.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 14 of its 77 references that are in the map. First posted on arXiv 24 Aug 2021.

Builds on

14 of 77 references.

References · 14

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  3. 2019InterpretML: A Unified Framework for Machine Learning Interpretabilitycited by 243
  4. 2015Coordinate Descent Algorithmscited by 218
  5. 2015Best Subset Selection via a Modern Optimization Lenscited by 99
  6. 2020GAMI-Net: An Explainable Neural Network based on Generalized Additive Models with Structured Interactionscited by 82
  7. 2018Fast Best Subset Selection: Coordinate Descent and Local Combinatorial Optimization Algorithmscited by 52
  8. 2020Sparse Regression at Scale: Branch-and-Bound rooted in First-Order Optimizationcited by 45
  9. 2017Subset Selection with Shrinkage: Sparse Linear Modeling when the SNR is lowcited by 17
  10. 2015Minimax Optimal Rates of Estimation in High Dimensional Additive Models: Universal Phase Transitioncited by 13
  11. 2021Grouped Variable Selection with Discrete Optimization: Computational and Statistical Perspectivescited by 12
  12. 2015Hierarchical Sparse Modeling: A Choice of Two Group Lasso Formulationscited by 6
2 more
  1. 2015The Discrete Dantzig Selector: Estimating Sparse Linear Models via Mixed Integer Linear Optimizationcited by 5
  2. 2019Learning Hierarchical Interactions at Scale: A Convex Optimization Approachcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 0; 2025: 0; 2026: 2.

3 papers.