mlsanityData to 7 Oct 2026

Scalable kernel balancing weights in a nationwide observational study of hospital profit status and heart attack outcomes

arXiv 2311.00568 ↗First posted 1 Nov 2023stat.ME stat.CO stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

Weighting is a general and often-used method for statistical adjustment. Weighting has two objectives: first, to balance covariate distributions, and second, to ensure that the weights have minimal dispersion and thus produce a more stable estimator. A recent, increasingly common approach directly optimizes the weights toward these two objectives. However, this approach has not yet been feasible in large-scale datasets when investigators wish to flexibly balance general basis functions in an extended feature space. For example, many balancing approaches cannot scale to national-level health services research studies. To address this practical problem, we describe a scalable and flexible approach to weighting that integrates a basis expansion in a reproducing kernel Hilbert space with state-of-the-art convex optimization techniques. Specifically, we use the rank-restricted Nystr"om method to efficiently compute a kernel basis for balancing in nearly linear time and space, and then use the specialized first-order alternating direction method of multipliers to rapidly find the optimal weights. In an extensive simulation study, we provide new insights into the performance of weighting estimators in large datasets, showing that the proposed approach substantially outperforms others in terms of accuracy and speed. Finally, we use this weighting approach to conduct a national study of the relationship between hospital profit status and heart attack outcomes in a comprehensive dataset of 1.27 million patients. We find that for-profit hospitals use interventional cardiology to treat heart attacks at similar rates as other hospitals, but have higher mortality and readmission rates.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 12 of its 44 references that are in the map. First posted on arXiv 1 Nov 2023.

Builds on

12 of 44 references.

References · 12

  1. 2017OSQP: An Operator Splitting Solver for Quadratic Programscited by 156
  2. 2013Revisiting the Nystrom Method for Improved Large-Scale Machine Learningcited by 76
  3. 2016Generalized Optimal Matching Methods for Causal Inferencecited by 39
  4. 2016Covariate Balancing Propensity Score by Tailored Loss Functionscited by 34
  5. 2021The Balancing Act in Causal Inferencecited by 20
  6. 2017Minimal Dispersion Approximately Balancing Weights: Asymptotic Properties and Practical Considerationscited by 18
  7. 2017Scalable Kernel K-Means Clustering with Nystrom Approximation: Relative-Error Boundscited by 16
  8. 2019Minimax Linear Estimation of the Retargeted Meancited by 11
  9. 2017The biglasso Package: A Memory- and Computation-Efficient Solver for Lasso Model Fitting with Big Data in Rcited by 6
  10. 2015Parameter Selection and Pre-Conditioning for a Graph Form Solvercited by 4
  11. 2015Stochastic gradient descent methods for estimation with large data setscited by 2
  12. 2016Randomized Clustered Nystrom for Large-Scale Kernel Machinescited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.