Searcharxiv⌕ Search

arXiv subjects

Jae Kwang Kim

Publications and source records attributed to Jae Kwang Kim.

At least 19 recordsLinked to original sources
arXiv2026

Coherent and robust Bayesian inference under informative sampling via sample-level weight models

We develop two complementary Bayesian procedures for analytic inference under informative sampling. The first constructs a coherent likelihood by modeling the sample-level distribution of the design weight given the study variable and recovering the conditional inclusion probability through the identity of Sverchkov and Pfeffermann (2004); it is the Bayesian counterpart of a recently proposed conditional-likelihood estimator, attains the model-based efficiency bound under the correctly specified sample-level joint model, and can be biased otherwise. The second uses the same weight model only as input to a Neyman-orthogonalized analog of the design-weighted score and applies the loss-likelihood bootstrap; the resulting credible intervals are asymptotically sandwich-correct under Poisson sampling, and the posterior remains centered at the truth under misspecification of the weight model, although the working model can still affect the first-order variance. A beta regression on the population-level inclusion probability, inducing a beta prime sample-level weight distribution, serves as the parametric default. A data-adaptive implementation of the second procedure estimates the efficient factor $\barπ(x,y)=1/E_p(W\mid x,y)$ by a design-weighted Gamma/log-link regression and uses it in a joint one-step loss-likelihood bootstrap for the analytic parameter; its validity requires no rate conditions on the nuisance fit. We illustrate both procedures with simulations and Canadian Workforce data.

stat.ME↗
arXiv2026

Semiparametric Efficient Data Integration Using the Dual-Frame Sampling Framework

Integrating probability and non-probability samples is increasingly important, yet unknown non-probability inclusion mechanisms complicate identification and efficient estimation. We develop semiparametric theory for dual-frame data integration and propose two complementary estimators. The first models the conditional inclusion probability parametrically and, under correct specification, attains the semiparametric efficiency bound. The probability sample serves as an outcome-observed validation sample, identifying the conditional inclusion parameters without instrumental variables even under informative selection. We derive the efficient influence function while leaving the conditional distribution of the design inclusion probability unrestricted. The resulting estimating equations satisfy exact augmentation invariance, which supports both same-sample sieve estimation and pooled cross-fitting under weak nuisance-rate conditions. The second estimator, motivated by a two-stage sampling approximation, does not require a non-probability inclusion model; although not fully efficient, it is efficient within a restricted augmentation class, is robust to misspecification of the non-probability inclusion model, and its oracle version weakly dominates optimally augmented probability-sample-only inference. Simulations and a public-data repeated-sampling study show efficiency gains under correct specification and stable performance under misspecification and weak identification. Across the main simulations, the efficient procedures substantially reduce RMSE relative to probability-sample-only estimation, while the restricted estimator remains stable under inclusion-model misspecification and weak identification.

stat.ME↗
arXiv2026

Bregman projection for calibration estimation in Survey Sampling

Calibration weighting is a fundamental tool in survey sampling for incorporating auxiliary population information into design-based estimators. Classical formulations measure distance between calibrated and design weights on the multiplicative ratio scale. We develop a unified framework based on Bregman divergence defined directly on the weight vector. The framework reveals a primal--dual symmetry in which both the weight-space and multiplier-space optimization problems are themselves Bregman projections, and the calibrated weights satisfy a generalized Pythagorean decomposition with respect to the constraint manifold. The resulting estimator is asymptotically equivalent to a debiased prediction estimator whose regression coefficient depends explicitly on the Bregman generator, in contrast to the generalized regression estimator equivalent of classical calibration. Exploiting this dependence, we identify a contrast-entropy generator that achieves design-optimality under Poisson sampling. Two extensions are developed: cross-fitted estimation under non-probability sampling, yielding doubly robust inference under standard product-rate conditions; and a regularized extension whose Lagrangian dual produces a Hölder-conjugate penalty for soft balance under high-dimensional auxiliary variables. Simulations and an analysis of National Oceanic and Atmospheric Administration (NOAA)'s Large Pelagics Intercept Survey illustrate the framework.

stat.ME↗
arXiv2026

A Tutorial on Bregman Projection in Statistics

A single geometric operation -- projecting a reference onto a constrained family under a Bregman divergence -- underlies a striking range of statistical methods. This tutorial develops the operation first as pure convex geometry, with no statistics attached. A strictly convex generator $G$ and its conjugate $F$ furnish two coordinate systems, a projection theorem with existence and uniqueness, and a Pythagorean {theorem}; the Pythagorean theorem itself produces {two} dual projections -- the information (e-) projection onto moment-constrained families and the moment (m-) projection onto exponential families -- exchanged by the conjugacy $G\leftrightarrow F$, so a single theorem governs both. Part~II reads off the statistics. The generalized linear model is treated in detail as the concrete carrier of the two projections: {under the canonical link,} the score equation is exactly the Pythagorean orthogonality, and the fit is simultaneously an e-projection in the natural coordinate and an m-projection in the mean coordinate. Maximum entropy, survey calibration, over-identified moment models, the EM algorithm, variational inference, autoencoders, and expectation propagation then fall into place as instances of the same construction -- exactly where the underlying families are flat, and as controlled approximations or neighboring-divergence analogies where they are not. The mathematics of Part~I is self-contained; the statistical sections presume only familiarity with the methods being unified.

math.ST↗
arXiv2026

TS-Neyman: Posterior Sampling for Adaptive Stratified Estimation

Many model evaluation tasks reduce to estimating an average loss, error rate, or subgroup metric on a stratified pool when each label, human rating, or simulator call is costly. The precision-optimal Neyman allocation depends on within-stratum variances, which must be learned from the same observations used for estimation. We formulate this as a sequential allocation problem and use the exact one-step marginal variance reduction as the priority index. Replacing the unknown variances by independent inverse-chi-squared posterior draws yields TS-Neyman, a Thompson-sampling rule that preserves the oracle marginal-gain structure while randomizing over variance uncertainty. For any fixed finite number of strata, we prove almost-sure convergence of the TS-Neyman allocation proportions to the Neyman target, asymptotic optimality of the variance proxy, and a central limit theorem for the resulting adaptive stratified estimator. In two five-stratum budget-scaling benchmarks, one bounded-loss benchmark and one binary model-error benchmark in the spirit of Dai et al. 2023, TS-Neyman's relative efficiency stays within 5 percent of the oracle on the bounded-loss population and within about 15 percent on the binary benchmark. In an additional CivilComments real-data replay with confidence-based strata, it stays within about 8 percent of the oracle and improves on equal allocation by roughly 7 to 14 percent in MSE across budgets, while plug-in greedy and two-stage plug-in can degrade by over an order of magnitude under sparse pilots. Common-pilot warm-start and prior-sensitivity studies show that this behavior is stable under working-model and working-prior misspecification.

stat.ME↗
arXiv2026

Statistical Optimality of Prediction-Powered Inference

The prediction-powered inference (PPI) proposed by Angelopoulos et al. (2023) is a popular method that leverages a small number of labeled samples and machine learning predictions for semi-supervised inference. While several variants of PPI have appeared in the literature, its rigorous statistical theory has not been fully developed. In this paper, we study the statistical optimality of PPI. Our contributions span both foundational theory and new methodology. First, we frame PPI as an M-estimation problem, revealing a link between the bias-corrected PPI estimating equation and the ideal full-data estimating equation. This connection leads to the consistency and asymptotic normality of the PPI estimator under simple random sampling without replacement. Next, we identify the efficient influence function and prove that PPI can attain the semiparametric efficiency lower bound when the predictor is score-calibrated, that is, when the predictor's output aligns with the true conditional expectation of the estimating function. Finally, for learned prediction rules, we develop asymptotic theory for cross-fitting and for a single-fit variant with variance correction in the special case of semiparametric mean estimation. Simulation experiments and a real-data application support these findings.

math.ST↗
arXiv2026

MEC-Cox: Machine-Learning-Assisted Generalized Entropy Calibration for ATT Marginal Hazard-Ratio Estimation

Externally controlled survival trials are increasingly used when concurrent randomized controls are infeasible, particularly in oncology and rare-disease settings with time-to-event endpoints. We target an average-treatment-effect-on-the-treated (ATT)-type marginal hazard-ratio estimand, comparing treatment with counterfactual control in the treated trial population, and estimate it using inverse-probability-weighted (IPW) Cox regression. Valid inference is challenging because IPW Cox regression depends on the weights through both event contributions and risk-set averages, making flexible machine-learning nuisance estimation difficult to incorporate directly. Building on machine-learning-assisted generalized entropy calibration (MEC) by Lee and Kim (2026), we propose MEC-Cox for ATT-weighted IPW Cox regression. The method begins with normalized source-propensity-score odds weights for external controls and then applies Bregman calibration to balance cross-fitted prognostic summaries between external controls and treated trial patients. The calibration basis may include control-survival predictions, Cox linear predictors, penalized-survival-model predictions, or other prognostic-score summaries. MEC-updated weights therefore play a dual role as source-transport and prognostic-score balancing weights. We establish consistency, characterize a calibration-induced efficiency gain, and develop a stacked sandwich variance estimator. Simulations show that MEC-Cox can reduce bias, increase efficiency, and improve coverage through flexible machine-learning-assisted adjustment.

stat.ML↗
arXiv2026

MEC: Machine-Learning-Assisted Generalized Entropy Calibration for Semi-Supervised Mean Estimation

Obtaining high-quality labels is costly, whereas unlabeled covariates are often abundant, motivating semi-supervised inference methods with reliable uncertainty quantification. Prediction-powered inference (PPI) leverages a machine-learning predictor trained on a small labeled sample to improve efficiency, but it can lose efficiency under model misspecification and suffer from coverage distortions due to label reuse. We introduce Machine-Learning-Assisted Generalized Entropy Calibration (MEC), a cross-fitted, calibration-weighted variant of PPI. MEC improves efficiency by reweighting labeled samples to better align with the target population, using a principled calibration framework based on Bregman projections. This yields robustness to affine transformations of the predictor and relaxes requirements for validity by replacing conditions on raw prediction error with weaker projection-error conditions. As a result, MEC attains the semiparametric efficiency bound under weaker assumptions than existing PPI variants. Across simulations and a real-data application, MEC achieves near-nominal coverage and tighter confidence intervals than CF-PPI and vanilla PPI.

stat.ML↗
arXiv2026

Toward design-based inference for data integration

Integrating non-probability samples into finite-population inference typically requires modeling unknown selection probabilities under a missing-at-random (MAR) assumption that is difficult to verify. We propose a design-based alternative in which the non-probability sample is treated as a fully observed certainty stratum and a probability sample is drawn only from the complementary, previously unsampled units. Within this sequential framework, we develop two generalized regression estimators: one fitting the outcome model separately in the complementary stratum, the other pooling both samples; we make two distinct contributions. First, both estimators are design-consistent and admit consistent variance estimators with no assumption whatsoever on the non-probability selection mechanism, including under not-missing-at-random (NMAR) selection. Second, under a working superpopulation model that holds in both strata, the pilot non-probability sample can be used to construct second-stage inclusion probabilities that achieve Isaki-Fuller asymptotic optimality for the separate estimator; this optimality claim relies on assumptions strictly stronger than MAR, but its failure does not invalidate the consistency results above. A diagnostic test for coefficient homogeneity is proposed to guide the choice between the two estimators. Simulations confirm that the sequential estimators remain essentially unbiased under both MAR and NMAR, while propensity-adjusted competitors can be severely biased under NMAR. Two applications from Lithuanian official statistics illustrate that separate regression is preferable when the pilot stratum and its complement are strongly heterogeneous, whereas combined regression offers a modest efficiency gain when the two strata are similar.

stat.ME↗
arXiv2026

Sample-split REGression SREG: A robust estimator for high-dimensional survey data

Model-assisted regression estimation is fundamental in survey sampling for incorporating auxiliary information. However, when the auxiliary dimension grows with the sample size, the standard Generalized regression (GREG) estimator can exhibit non-negligible bias under informative sampling, even when the working model is correctly specified. This failure stems from the double use of sampled outcomes simultaneously for fitting the regression and for forming the residual correction. We propose a sample-split REGression (SREG) estimator based on K-fold cross-fitting that eliminates this bias by pairing each unit's residual with an out-of-fold prediction. The resulting estimator is first-order equivalent to the oracle difference estimator under a weak prediction-norm consistency requirement, without requiring root-n consistent estimation of regression coefficients. We establish asymptotic normality and prove consistency of a variance estimator based on cross-fitted residuals. The key conditional fluctuation assumption is verified for simple random, stratified, and rejective sampling. Simulations demonstrate that SREG effectively removes high-dimensional bias while maintaining competitive efficiency.

stat.ME↗
arXiv2026

A Calibration Framework for Inference with Partially Observed Data

Missing data is an universal problem in statistics. We develop a unified framework for estimating parameters defined by general estimating equations under a missing-at-random (MAR) mechanism, based on generalized entropy calibration weighting. We construct weights by minimizing a convex entropy subject to (i) balancing constraints on a data-adaptive calibration function, estimated using flexible machine-learning predictors with cross-fitting, and (ii) a debiasing constraint involving the fitted propensity score (PS) model. The resulting estimator is doubly robust, remaining consistent if either the outcome regression (OR) or the PS model is correctly specified, and attains the semiparametric efficiency bound when both models are correctly specified. Our formulation encompasses classical inverse probability weighting (IPW) and augmented IPW (AIPW) as special cases and accommodates a broad class of entropy functions. We illustrate the versatility of the approach in three important settings: semi-supervised learning with unlabeled outcomes, regression analysis with missing covariates, and causal effect estimation in observational studies. Extensive simulation studies and real-data applications demonstrate that the proposed estimators achieve greater efficiency and numerical stability than existing methods. In particular, the proposed estimator outperforms the classical AIPW estimator under the OR model misspecification.

stat.ME↗
arXiv2025

Multi-source Learning for Target Population by High-dimensional Calibration

Multi-source learning is an emerging area of research in statistics, where information from multiple datasets with heterogeneous distributions is combined to estimate the parameter of interest for a target population without observed responses. We propose a high-dimensional debiased calibration (HDC) method and a multi-source HDC (MHDC) estimator for general estimating equations. The HDC method uses a novel approach to achieve Neyman orthogonality for the target parameter via high-dimensional covariate balancing on an augmented set of covariates. It avoids the augmented inverse probability weighting formulation and leads to an easier optimization algorithm for the target parameter in estimating equations and M-estimation. The proposed MHDC estimator integrates multi-source data while supporting flexible specifications for both density ratio and outcome regression models, achieving multiple robustness against model misspecification. Its asymptotic normality is established, and a specification test is proposed to examine the transferability condition for the multi-source data. Compared to the linear combination of single-source HDC estimators, the MHDC estimator improves efficiency by jointly utilizing all data sources. Through simulation studies, we show that the MHDC estimator accommodates multiple sources and multiple working models effectively and performs better than the existing doubly robust estimators for multi-source learning. An empirical analysis of a meteorological dataset demonstrates the utility of the proposed method in practice.

stat.ME↗
arXiv2025

A General Approach for Calibration Weighting under Missing at Random

We propose a unified class of calibration weighting methods based on weighted generalized entropy to handle missing at random (MAR) data with improved stability and efficiency. The proposed generalized entropy calibration (GEC) formulates weight construction as a convex optimization program that unifies entropy-based approaches and generalized regression weighting. Double robustness is achieved by augmenting standard covariate balancing with a debiasing constraint tied to the propensity score model and a Neyman-orthogonal constraint that removes first-order sensitivity to nuisance estimation. Selection of the weights on the entropy function can lead to the optimal calibration estimator under a correctly specified outcome regression model. The proposed GEC weighting ha a nice geometric characterization: the GEC solution is the Bregman projection of the initial weights onto a constraint set, which yields a generalized Pythagorean identity and a nested decomposition that quantifies the incremental distance paid for additional constraints. We also develop a high-dimensional extension with soft calibration and a projection calibration constraint that preserves doubly robust inference. Two simulation studies are presented to compare the performance of the proposed method with the existing methods.

stat.ME↗
arXiv2025

Generalized entropy calibration for analyzing voluntary survey data

Statistical analysis of voluntary survey data is an important area of research in survey sampling. We consider a unified approach to voluntary survey data analysis under the assumption that the sampling mechanism is ignorable. Generalized entropy calibration is introduced as a unified tool for calibration weighting to control the selection bias. We first establish the relationship between the generalized calibration weighting and its dual expression for regression estimation. The dual relationship is critical in identifying the implied regression model and developing model selection for calibration weighting. Also, if a linear regression model for an important study variable is available, then two-step calibration method can be used to smooth the final weights and achieve the statistical efficiency. Asymptotic properties of the proposed estimator are investigated. Results from a limited simulation study are also presented.

stat.ME↗
arXiv2025

Debiased calibration estimation using generalized entropy in survey sampling

Incorporating the auxiliary information into the survey estimation is a fundamental problem in survey sampling. Calibration weighting is a popular tool for incorporating the auxiliary information. The calibration weighting method of Deville and Sarndal (1992) uses a distance measure between the design weights and the final weights to solve the optimization problem with calibration constraints. This paper introduces a novel framework that leverages generalized entropy as the objective function for optimization, where design weights play a role in the constraints to ensure design consistency, rather than being part of the objective function. This innovative calibration framework is particularly attractive due to its generality and its ability to generate more efficient calibration weights compared to traditional methods based on Deville and Sarndal (1992). Furthermore, we identify the optimal choice of the generalized entropy function that achieves the minimum variance across various choices of the generalized entropy function under the same constraints. Asymptotic properties, such as design consistency and asymptotic normality, are presented rigorously. The results from a limited simulation study are also presented. We demonstrate a real-life application using agricultural survey data collected from Kynetec, Inc.

stat.ME↗
arXiv2024

Statistics in Survey Sampling

Survey sampling theory and methods are introduced. Sampling designs and estimation methods are carefully discussed as a textbook for survey sampling. Topics includes Horvitz-Thompson estimation, simple random sampling, stratified sampling, cluster sampling, ratio estimation, regression estimation, variance estimation, two-phase sampling, and nonresponse adjustment methods.

stat.ME↗
arXiv2024

Semiparametric adaptive estimation under informative sampling

In survey sampling, survey data do not necessarily represent the target population, and the samples are often biased. However, information on the survey weights aids in the elimination of selection bias. The Horvitz-Thompson estimator is a well-known unbiased, consistent, and asymptotically normal estimator; however, it is not efficient. Thus, this study derives the semiparametric efficiency bound for various target parameters by considering the survey weight as a random variable and consequently proposes a semiparametric optimal estimator with certain working models on the survey weights. The proposed estimator is consistent, asymptotically normal, and efficient in a class of the regular and asymptotically linear estimators. Further, a limited simulation study is conducted to investigate the finite sample performance of the proposed method. The proposed method is applied to the 1999 Canadian Workplace and Employee Survey data.

stat.ME↗
arXiv2024

Robust propensity score weighting estimation under missing at random

Missing data is frequently encountered in many areas of statistics. Propensity score weighting is a popular method for handling missing data. The propensity score method employs a response propensity model, but correct specification of the statistical model can be challenging in the presence of missing data. Doubly robust estimation is attractive, as the consistency of the estimator is guaranteed when either the outcome regression model or the propensity score model is correctly specified. In this paper, we first employ information projection to develop an efficient and doubly robust estimator under indirect model calibration constraints. The resulting propensity score estimator can be equivalently expressed as a doubly robust regression imputation estimator by imposing the internal bias calibration condition in estimating the regression parameters. In addition, we generalize the information projection to allow for outlier-robust estimation. Some asymptotic properties are presented. The simulation study confirms that the proposed method allows robust inference against not only the violation of various model assumptions, but also outliers. A real-life application is presented using data from the Conservation Effects Assessment Project.

stat.ME↗