The paper addresses the reliability of conformal prediction under covariate shift.
problem Ensuring reliable prediction sets under covariate shift.
method Derives upper bounds on training-conditional coverage.
result Offers PAC guarantees for conformal prediction methods.
Kandinsky conformal prediction expands conditional coverage guarantees.
problem Disparities in coverage guarantees across different subpopulations.
method Flexible handling of overlapping and fractional group memberships.
result Minimax-optimal high-probability conditional coverage bound.
New method predicts sets under unknown covariate shift with high confidence.
problem Adapting to unknown covariate shift in prediction sets.
method PredSet-1Step, a flexible distribution-free method.
result Achieves asymptotic probably approximately correct coverage.
A new kernel-based nonconformity score improves multivariate prediction regions.
problem Tackling the challenge of compressing multivariate residual vectors into scalars while preserving geometric structure.
method Introducing a Multivariate Kernel Score (MKS) that decomposes into an anisotropic MMD, providing finite-sample coverage guarantees and convergence rates.
result The MKS produces prediction regions that explicitly adapt to geometric structure, reducing volume compared to ellipsoidal baselines.
WR-CP reduces prediction set size and coverage gap under distribution shift.
problem Guaranteed coverage under distribution shift not achievable with i.i.d. assumption.
method Wasserstein distance, probability measure pushforwards, importance weighting, regularized representation learning.
result Reduces coverage gap to 3.2% across different confidence levels.
New method for valid prediction sets in high-dimensional covariate shifts.
problem Valid prediction sets in high-dimensional covariate shifts.
method Likelihood-ratio regularized quantile regression (LR-QR) algorithm.
result LR-QR constructs valid prediction sets with desired coverage in target domain.
The paper develops time-uniform inference methods for stochastic approximation parameters.
problem Statistical inference for parameters in stochastic approximation problems.
method Analysis of averaged iterates convergence rates and construction of asymptotic confidence sequences.
result Valid asymptotic confidence sequences for parameters in stochastic approximation problems.
Bayesian optimization enhanced with conformal prediction for better outcome reliability.
problem Uncertainty and model misspecification in Bayesian optimization.
method Conformal prediction to provide coverage guarantees and Bayesian optimization to select queries.
result Significant improvement in query coverage without sacrificing sample-efficiency.
Improved multivariate conformal prediction by standardizing residuals.
problem Weak conditional coverage in heteroskedastic multivariate settings.
method Natural extension of univariate normalization to multivariate setting, whitening residuals and standardizing local variance.
result Standardized residuals yield asymptotic conditional coverage under certain distributions.
Paper tackles covariate shift in offline IL using less proficient behavior data.
problem Mitigating covariate shift in Imitation Learning with limited data coverage.
method Model-based IL from Offline Data (MILO) framework.
result MILO can combat covariate shift even with sub-optimal behavior policy data.
Adapts conformal prediction for missing data, ensuring valid coverage.
problem Uncertainty quantification with missing covariates.
method Proposes a reweighted conformal prediction procedure for handling missing values.
result Guaranteed Marginal Coverage and Mask-Conditional Validity for general missing data mechanisms.
Optimizes ellipsoids for uncertainty regions in parameter estimation.
problem Learning minimal volume uncertainty ellipsoids for parameter estimation.
method Differentiable optimization approach using neural networks to approximate optimal ellipsoids.
result Approximately computed ellipsoids are smaller and more accurate than existing methods.
Paper develops conformalized survival analysis method for better prediction.
problem Survival analysis models often misspecify and require strong assumptions.
method Uses conformal prediction to wrap around any survival prediction algorithm.
result Lower predictive bounds provide guaranteed coverage without strong assumptions.
CoDrug uses KDE to create valid prediction sets for drug molecules under covariate shift.
problem Creating reliable uncertainty estimates for drug properties from computational models.
method CoDrug employs an energy-based model and KDE to assess and rectify distribution shift.
result CoDrug reduces the coverage gap by over 35% compared to non-adjusted conformal prediction sets.
Study improves conformal prediction for missing covariate data.
problem Uncertainty quantification with missing covariate values.
method Generalized conformalized quantile regression framework, missing data augmentation.
result Improved prediction intervals valid conditionally to missing data patterns.
New method provides valid confidence intervals for spatial associations.
problem Limited insight into covariate-response relationships in spatial settings.
method Lipschitz-driven uncertainty quantification for spatial association.
result Valid frequentist confidence intervals for associations in spatial settings.
The paper develops a theory for random forests, separating variance components and providing methods for estimating prediction intervals.
problem Understanding the variance and uncertainty in random forest predictions.
method Design-based theory, Monte Carlo averaging, PASR resampling.
result The floor of prediction uncertainty is positive and persists even without observation overlap, providing conservative prediction intervals.
The paper tackles temporal coverage bias in financial panel data, proposing a structuring framework to correct for incomplete histories.
problem Incomplete histories of financial instruments lead to biased panel data.
method Formalizes the problem and proposes a coverage-aware structuring framework using structured metadata and an availability matrix.
result The framework reveals substantial distortions in return dynamics and volatility when naive temporal alignment is used.
Improves random forest quantile estimation and prediction intervals.
problem Excessive bias in quantile estimates from random forests.
method Minimizes quantile coverage loss (QCL) by adjusting RF parameters.
result QCL-tuned RFs produce more accurate and narrower prediction intervals.
Trimming helps in conformal prediction when it separates anomaly scores.
problem Effectiveness of trimming in conformal prediction under contamination.
method Analyse fixed-threshold trimming as a replacement of the contaminated calibration law with a retained law.
result Trimming helps when it separates anomaly scores, reducing clean-target coverage to a one-dimensional score-CDF transfer problem.
DARTS optimizes covariate selection in trials with limited data.
problem Limited budget for high-dimensional pretreatment data.
method Dynamic Adaptive Rerandomization via Thompson Sampling (DARTS).
result DARTS efficiently concentrates budget on informative features.
Filtered conformal ellipsoids for graph-native time series
problem Joint prediction sets for multivariate time series
method Filtered conformal ellipsoids
result Sharper at-target ellipsoids than static-covariance and non-filter baselines
Study examines how imputation accuracy affects prediction accuracy in regression problems with missing covariates.
problem Missing covariates in regression or classification problems.
method Simulation and empirical analysis using UCI datasets and statistical inference.
result Imputation accuracy impacts prediction accuracy, especially with Machine Learning methods.
Study improves machine learning for estimating survival treatment effects.
problem Estimating heterogeneous survival treatment effects in observational data.
method Flexible machine learning methods in the counterfactual framework, including AFT-BART-NP.
result AFT-BART-NP consistently yields best performance in terms of bias, precision, and frequentist coverage.
Gaussian process (GP) regression is a powerful interpolation technique due to its flexibility in capturing non-linearity. In this paper, we provide a general framework for understanding the frequentist coverage of point-wise and simultaneous Bayesian credible sets in GP regression. As an intermediate result, we develop…
Robust forecast framework reduces distribution error by 63%.
problem Accurate distribution forecast for planning decisions.
method Backtest-based bootstrap and adaptive residual selection.
result Reduces Absolute Coverage Error by more than 63%.
We address the issue of knots selection for Gaussian predictive process methodology. Predictive process approximation provides an effective solution to the cubic order computational complexity of Gaussian process models. This approximation crucially depends on a set of points, called knots, at which the original proces…
New algorithm mitigates misspecification amplification in regression models with covariate shift.
problem Distribution shift and model misspecification in regression models.
method Developed a new algorithm inspired by robust optimization to avoid misspecification amplification.
result No misspecification amplification while still achieving optimal statistical rates.
Optimizes minimum-volume prediction sets for multivariate regression.
problem Lack of efficient methods for multivariate conformal prediction.
method Optimization-driven framework for minimum-volume covering sets.
result Efficient and informative prediction sets with tight coverage.
New method for estimating spatial associations with discrete data, even under model misspecification.
problem Estimating associations between covariates and discrete responses with spatial variability and nonrandom sampling.
method Proposes a novel approach to handle spatially varying noise, provides a proof of consistency, and uses a delta method argument.
result Empirically shows reliable confidence intervals compared to standard methods, even with model misspecification.
Proposes a new method for conformal prediction under covariate shift with posterior drift.
problem Improving classification performance in target domains with limited training data.
method Weighted conformal classifier that leverages source and target samples.
result Demonstrates favorable asymptotic properties and practical utility.
COMPASS improves uncertainty quantification for medical segmentation metrics.
problem Uncertainty quantification for medical segmentation metrics is crucial for clinical decision-making.
method COMPASS leverages deep neural network inductive biases to generate efficient, metric-based conformal prediction intervals.
result COMPASS produces significantly tighter intervals than traditional conformal prediction methods on medical image segmentation tasks.
JAWS audits predictive uncertainty under covariate shift using jackknife+ weighted methods.
problem Auditing predictive uncertainty under data distribution shifts.
method JAW and JAWA methods for distribution-free uncertainty quantification.
result JAW relaxes the jackknife+'s assumption of data exchangeability for covariate shift.
New benchmark predicts cardiometabolic risk from accelerometer data, with varying accuracy.
problem Lack of accurate tabular benchmarks for cardiometabolic risk from accelerometer data.
method Tabular learning methods (ridge regression, XGBoost, TabPFN v2) applied to NHANES data.
result TabPFN v2 achieves best performance, but triglycerides remain largely unpredictable.
Gaussian process models improve MJO predictions with better uncertainty quantification.
problem Lack of uncertainty quantification in MJO predictions by machine learning models.
method Developed a nonparametric strategy based on Gaussian process models, calibrating them using empirical correlations and proposing a posteriori covariance correction.
result Gaussian process models provide better prediction skills and extended probabilistic coverage for MJO forecasts.
Conformal Candidate Certification advances offline MBO by certifying candidate designs with statistical guarantees.
problem Offline model-based optimization
method Conformal Candidate Certification (CCC)
result CCC certifies 16.7% of an aggressive proposal pool with 0.990 empirical coverage at nominal 0.90.
New method uses machine learning to improve statistical inference.
problem Performing inference on conditional functionals with scarce labeled data.
method Combines localization with prediction-based variance reduction.
result Valid and sharp confidence intervals for conditional functionals.
New methods improve inference after prediction without strong model assumptions.
problem Improper inference after prediction can lead to invalid results.
method Angelopoulos et al. (2023) and Wang et al. (2020) propose corrections to inference.
result Angelopoulos et al. method controls type 1 error and provides correct coverage.
New method uses label-weighted conformal prediction for macro-coverage guarantees in classification.
problem Finding a balance between class-conditional and marginal coverage in long-tailed datasets.
method Label-weighted conformal prediction for macro-coverage guarantees.
result Validated prediction sets with macro-coverage guarantees on large-scale image datasets.
Paper accelerates conformal prediction by using approximate leave-one-out estimators.
problem Limited computational cost for conformal prediction.
method Incorporates approximate leave-one-out estimators to accelerate conformal prediction.
result ALO-based methods achieve comparable coverage and efficiency to exact methods but with significantly reduced runtime.
Algorithm balances learning and coverage for multi-robots over unknown fields.
problem Balancing learning and coverage for multi-robots over unknown, nonuniform sensory fields.
method DSLC algorithm that schedules learning and coverage epochs, using Gaussian Process modeling and coverage regret analysis.
result Upper bound on expected cumulative coverage regret provided for DSLC.
Proposes a method for generating prediction intervals in dose-response models using conformal prediction.
problem Uncertainty quantification in continuous treatments for personalized healthcare decisions.
method Causal dose-response problem framed as covariate shift, using weighted conformal prediction with propensity estimation and kernel functions.
result Demonstrates the significance of covariate shift assumptions for robust prediction intervals.
New method refines prediction intervals for individual treatment effects using cross-world correlation.
problem Uncertainty in individual treatment effects for high-stakes decisions.
method Introduces cross-world correlation parameter ρ to refine prediction intervals for individual treatment effects.
result Achieves more stable and accurate coverage of prediction intervals for individual treatment effects.
Improved conformal prediction for better conditional coverage of classifier predictions.
problem Achieving exact conditional coverage in finite samples for prediction sets.
method Developed a variant of conformal prediction targeting coverage conditional on confidence and trust score.
result Empirically improved conditional coverage properties compared to standard conformal prediction.
Propensity score (PS) based estimators are increasingly used for causal inference in observational studies. However, model selection for PS estimation in high-dimensional data has received little attention. In these settings, PS models have traditionally been selected based on the goodness-of-fit for the treatment mech…
Adaptive coverage policies improve conformal prediction accuracy.
problem Fixed coverage levels in traditional conformal prediction lead to uninformative predictions.
method Optimizes adaptive coverage policy using a neural network trained on leave-one-out calibration.
result Adaptive coverage policies produce more informative and flexible prediction sets.
Proposes extensions to semi-parametric models using BART for shared covariates.
problem Avoiding poor coverage properties and reducing bias in linear predictor estimates.
method Modifies tree-generation moves in BART to handle shared covariates between linear and non-parametric components.
result Competitive performance in modelling complex interactions and predicting student achievements.
MEC improves efficiency and robustness in semi-supervised inference.
problem Efficient inference with limited labeled data and robust uncertainty quantification.
method Machine-Learning-Assisted Generalized Entropy Calibration (MEC) using cross-fitted, calibration-weighted PPI.
result MEC achieves semiparametric efficiency bounds under weaker assumptions and provides near-nominal coverage.