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

• URL: http://arxiv.org/abs/2604.05446v1
• Date: Tue, 07 Apr 2026 05:30:11 GMT
• Title: MEC: Machine-Learning-Assisted Generalized Entropy Calibration for Semi-Supervised Mean Estimation
• Abstract summary: Prediction-powered inference (PPI) leverages a machine-learning predictor trained on a small labeled sample to improve efficiency.<n>We introduce Machine-Learning-Assisted Generalized Entropy (MEC), a cross-fitted, calibration-weighted variant of PPI.<n>MEC improves efficiency by reweighting labeled samples to better align with the target population.
• Score: 1.3965477771846408
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Optimizing Symmetry Informed Probabilistic Error Cancellation [0.19116784879310023]
  We show that combining quantum error detection with probabilistic error cancellation gives more accurate and lower-variance estimates than PEC alone.<n>Because noisy symmetry measurements can negate the benefits of the PEC+QED approach, we cast the selection of measurement configurations as a classical optimization problem.<n>Our results demonstrate the importance of circuit-specific tailoring of QEM techniques and that fault-tolerant design principles may already provide value for near-term devices.
  arXiv  Detail & Related papers  (2026-07-01T15:30:56Z)
• Set-Preserving Calibration from Conformal P-Values to E-Values [6.673032375204486]
  We propose a novel P2E calibrator that converts conformal p-values into e-values without altering the prediction set induced by the original conformal p-value.<n>This e-value formulation enables principled use of recent advances in e-value merging and randomization.
  arXiv  Detail & Related papers  (2026-06-02T13:06:01Z)
• FragileFlow: Spectral Control of Correct-but-Fragile Predictions for Foundation Model Robustness [13.992146221170543]
  We introduce FragileFlow, a plug-in regularizer that identifies correct-but-fragile predictions and organizes their off-class probability mass into a class-wise vulnerable-risk matrix.<n>Experiments show that FragileFlow consistently improves the proposed theory-facing risk measures over matched baselines.
  arXiv  Detail & Related papers  (2026-05-09T11:25:07Z)
• Distributional Process Reward Models: Calibrated Prediction of Future Rewards via Conditional Optimal Transport [6.379494871147752]
  In-time scaling methods rely on Process Reward Models (PRMs), which are often poorly calibrated and overestimate success probabilities.<n>We propose the first use of conditional optimal transport for calibrating PRMs, modifying conditional OT (CondOT) map learning citebunne2022 to estimate a monotonic conditional quantile function.<n>This yields structurally valid quantile estimates and enables efficient extraction of confidence bounds at arbitrary levels.
  arXiv  Detail & Related papers  (2026-05-07T18:00:04Z)
• ECO: Quantized Training without Full-Precision Master Weights [58.97082407934466]
  Error-Compensating (ECO) eliminates master weights by applying updates directly to quantized parameters.<n>We show that ECO converges to a constant-radius neighborhood of the optimum, while naive master-weight removal can incur an error that is inversely proportional to the learning rate.
  arXiv  Detail & Related papers  (2026-01-29T18:35:01Z)
• Calibration Strategies for Robust Causal Estimation: Theoretical and Empirical Insights on Propensity Score-Based Estimators [0.6562256987706128]
  partitioning of data for estimation and calibration critically impacts the performance of propensity score based estimators.<n>We extend recent advances in calibration techniques for propensity score estimation, improving the robustness of propensity scores in challenging settings.
  arXiv  Detail & Related papers  (2025-03-21T16:41:10Z)
• Prediction-Powered Adaptive Shrinkage Estimation [0.22917707112773592]
  Prediction-Powered Adaptive Shrinkage (PAS) is a method that bridges PPI with empirical Bayes shrinkage to improve the estimation of multiple means.<n>PAS adapts to the reliability of the ML predictions and outperforms traditional and modern baselines in large-scale applications.
  arXiv  Detail & Related papers  (2025-02-20T00:24:05Z)
• Uncertainty-Calibrated Test-Time Model Adaptation without Forgetting [65.21599711087538]
  Test-time adaptation (TTA) seeks to tackle potential distribution shifts between training and test data by adapting a given model w.r.t. any test sample.<n>Prior methods perform backpropagation for each test sample, resulting in unbearable optimization costs to many applications.<n>We propose an Efficient Anti-Forgetting Test-Time Adaptation (EATA) method which develops an active sample selection criterion to identify reliable and non-redundant samples.
  arXiv  Detail & Related papers  (2024-03-18T05:49:45Z)
• Conformal Approach To Gaussian Process Surrogate Evaluation With Coverage Guarantees [47.22930583160043]
  We propose a method for building adaptive cross-conformal prediction intervals. The resulting conformal prediction intervals exhibit a level of adaptivity akin to Bayesian credibility sets. The potential applicability of the method is demonstrated in the context of surrogate modeling of an expensive-to-evaluate simulator of the clogging phenomenon in steam generators of nuclear reactors.
  arXiv  Detail & Related papers  (2024-01-15T14:45:18Z)
• Calibration by Distribution Matching: Trainable Kernel Calibration Metrics [56.629245030893685]
  We introduce kernel-based calibration metrics that unify and generalize popular forms of calibration for both classification and regression. These metrics admit differentiable sample estimates, making it easy to incorporate a calibration objective into empirical risk minimization. We provide intuitive mechanisms to tailor calibration metrics to a decision task, and enforce accurate loss estimation and no regret decisions.
  arXiv  Detail & Related papers  (2023-10-31T06:19:40Z)
• Federated Conformal Predictors for Distributed Uncertainty Quantification [83.50609351513886]
  Conformal prediction is emerging as a popular paradigm for providing rigorous uncertainty quantification in machine learning. In this paper, we extend conformal prediction to the federated learning setting. We propose a weaker notion of partial exchangeability, better suited to the FL setting, and use it to develop the Federated Conformal Prediction framework.
  arXiv  Detail & Related papers  (2023-05-27T19:57:27Z)
• Optimization of Annealed Importance Sampling Hyperparameters [77.34726150561087]
  Annealed Importance Sampling (AIS) is a popular algorithm used to estimates the intractable marginal likelihood of deep generative models. We present a parameteric AIS process with flexible intermediary distributions and optimize the bridging distributions to use fewer number of steps for sampling. We assess the performance of our optimized AIS for marginal likelihood estimation of deep generative models and compare it to other estimators.
  arXiv  Detail & Related papers  (2022-09-27T07:58:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.