Fused Multinomial Logistic Regression Utilizing Summary-Level External Machine-learning Information
Authors: Chi-Shian Dai, Jun Shao
Organizations: Department of Statistics, National Cheng Kung University, Tainan, 701, Taiwan · Department of Statistics, University of Wisconsin-Madison, Madison, 53706, USA
In many modern applications, a carefully designed primary study provides individual-level data for interpretable modeling, while summary-level external information is available through black-box, efficient, and nonparametric machine-learning predictions. Although summary-level external information has been studied in the data integration literature, there is limited methodology for leveraging external nonparametric machine-learning predictions to improve statistical inference in the primary study. We propose a general empirical-likelihood framework that incorporates external predictions through moment constraints. An advantage of nonparametric machine-learning prediction is that it induces a rich class of valid moment restrictions that remain robust to covariate shift under a mild overlap condition without requiring explicit density-ratio modeling. We focus on multinomial logistic regression as the primary model and address common data-quality issues in external sources, including coarsened outcomes, partially observed covariates, covariate shift, and heterogeneity in generating mechanisms known as concept shift. We establish large-sample properties of the resulting fused estimator, including consistency and asymptotic normality under regularity conditions. Moreover, we provide mild sufficient conditions under which incorporating external predictions delivers a strict efficiency gain relative to the primary-only estimator. Simulation studies and an application to the National Health and Nutrition Examination Survey on multiclass blood-pressure classification.
Figures & tables
θ1
θ2
Z
Shift
Metric
Method
0.2
1
−1
1
−1
−0.1
−1
1
1
1
X
None
Bias
MLE
− 0.010
0.025
− 0.025
− 0.011
0.003
− 0.012
− 0.010
− 0.005
− 0.007
0.041
FMLE
− 0.010
0.022
− 0.023
− 0.011
0.003
− 0.008
0.014
0.002
− 0.021
0.026
SD
MLE
0.143
0.255
0.268
0.241
0.252
0.156
0.305
0.300
0.289
0.288
FMLE
0.143
0.257
0.269
0.243
0.252
0.146
0.226
0.227
0.212
0.213
SE
MLE
0.141
0.258
0.258
0.250
0.257
0.158
0.296
0.296
0.281
0.296
Table 1: Simulation bias, standard deviation (SD), standard error (SE), and coverage probability (CP) of 95% confidence intervals, based on 500 replications.
Z=X
Z=X−5
Shift
Method
Class 1
Class 2
Class 3
Class 1
Class 2
Class 3
None
MLE
0.0021
0.0021
0.0018
0.0021
0.0021
0.0018
FMLE
0.0019
0.0019
0.0009
0.0019
0.0020
0.0012
Mean
MLE
0.0020
0.0021
0.0017
0.0020
0.0021
0.0017
FMLE
0.0019
0.0019
0.0009
0.0019
0.0020
0.0012
Variance
MLE
0.0021
0.0021
0.0018
0.0021
0.0021
0.0018
Table 2: The mean squared error of MLE and FMLE of class probabilities based on 500 replications.
Figure 1: Standardized mean differences for shared covariates between the primary and external sources.
Category
Primary
External
Normal
0.704
0.754
Prehypertension
0.153
0.134
Hypertension
0.146
0.112
Table 3: Empirical class proportions of blood pressure categories in the two samples.
Figure 2: Point estimates (dots) and confidence intervals (vertical bars).
We study prediction-powered conditional inference in the setting where labeled data are scarce, unlabeled covariates are abundant, and a black-box machine-learning predictor is available. The goal is to perform statistical inference on conditional functionals evaluated at a fixed target point, such as conditional means, without imposing a parametric model for the conditional relationship. Our approach combines localization with prediction-based variance reduction. First, we introduce an RKHS localization method that learns a data-adaptive weight from covariates and reformulates the target conditional moment at the target point as a weighted unconditional moment. Second, we incorporate machine-learning predictions through a correction-based decomposition of this localized moment, yielding a prediction-powered estimator and confidence interval that reduce variance when the predictor is informative while preserving validity regardless of predictor accuracy. We establish nonasymptotic error bounds and, in the abundant-unlabeled regime, minimax-optimal convergence rates for the resulting estimator, prove pointwise asymptotic normality with consistent variance estimation, and provide an explicit variance decomposition that characterizes how machine-learning predictions and unlabeled covariates improve statistical efficiency. Numerical experiments on simulated and real datasets demonstrate valid conditional coverage and substantially sharper confidence intervals than alternative methods.
Statistical estimation often involves tradeoffs between expensive, high-quality measurements and a variety of lower-quality proxies. We introduce Multiple-Prediction-Powered Inference (MultiPPI): a general framework for constructing statistically efficient estimates by optimally allocating resources across these diverse data sources. This work provides theoretical guarantees about the minimax optimality, finite-sample performance, and asymptotic normality of the MultiPPI estimator. Through experiments across three diverse large language model (LLM) evaluation scenarios, we show that MultiPPI consistently achieves lower estimation error than existing baselines. This advantage stems from its budget-adaptive allocation strategy, which strategically combines subsets of models by learning their complex cost and correlation structures.
Charlie Cowen-Breen, Alekh Agarwal, Stephen Bates +4
Massachusetts Institute of Technology · Google Research · Google DeepMind
The Super Learner (SL) is a widely used ensemble method that combines point predictions from a library of learners based on their predictive performance. Interval predictions are of considerable practical interest because they allow uncertainty in predictions produced by an individual learner or an ensemble to be quantified. Several methods have been proposed for constructing interval predictions based on the SL, however, these approaches are typically justified using asymptotic arguments or rely on computationally intensive procedures such as the bootstrap. Conformal prediction (CP) is a machine learning framework for constructing prediction intervals with finite-sample and asymptotic coverage guarantees under mild conditions. We propose coupling CP with the SL through a natural construction that mirrors the original SL framework, using individual learner weights and combining learner-specific conformity scores via a weighted majority vote. We characterize the properties of the resulting SL-based prediction intervals for continuous outcomes. We cover settings under exchangeability, potential violations of exchangeability, and data-generating mechanisms exhibiting heteroscedasticity, sparsity, and other forms of distributional heterogeneity. A comprehensive simulation study shows that the conformalized SL achieves valid finite-sample coverage with competitive performance relative to the true data-generating mechanism. A central contribution of this work is an application to predicting creatinine levels using socio-demographic, biometric, and laboratory measurements. This example demonstrates the benefits of an ensemble with carefully selected learners designed to capture key aspects of complex regression functions, including non-linear effects, interactions, sparsity, heteroscedasticity, and robustness to outliers.
Department of Mathematics King’s College London London, UK · Department of Statistics and Operations Research University of Granada Granada, Spain · Department of Statistical Science University College London London, UK