This paper presents quantitative shrinking target results for rotations and interval exchange transformations. To do this a quantitative version of a unique ergodicity criterion of Boshernitzan is established.
Boosted conformal procedure improves prediction intervals.
problem Enhancing prediction interval properties like coverage and length.
method Gradient boosting to optimize conformity score function.
result Significant improvements in interval length and coverage.
New method for valid prediction intervals in counterfactual outcomes with runtime confounding.
problem Valid prediction intervals for counterfactual outcomes under runtime confounding.
method Debiased machine learning framework grounded in semiparametric efficiency theory.
result Prediction intervals achieve desired coverage rates with faster convergence compared to standard methods.
Paper proposes a method to create more reliable confidence intervals for off-policy evaluations.
problem Creating reliable confidence intervals for off-policy evaluations.
method Proposes a deeply-debiasing procedure to construct efficient, robust, and flexible confidence intervals.
result Validated by theoretical results and numerical experiments, the method improves the reliability of off-policy evaluations.
This paper presents a method to automatically generate high-quality prediction intervals for neural networks.
problem Accurate uncertainty quantification for deep learning models in real-world applications.
method Dual neural network approach with a novel loss function to balance prediction interval width and coverage.
result Our method produces significantly narrower prediction intervals with higher probability coverage compared to state-of-the-art methods.
Proposes methods to aggregate prediction intervals for domain shift uncertainty.
problem Uncertainty quantification in distribution shifts.
method Aggregates prediction intervals for minimal width and adequate coverage.
result Effective methodologies for unsupervised domain shift under labeled source and unlabeled target.
Paper develops new conformal prediction methods for sum or average of unknown labels.
problem Uncertainty quantification in joint distributions of random variables.
method Introduces novel conformal prediction methods for sum or average of unknown labels.
result Validates the proposed method for sum or average of unknown labels under permutation invariant assumptions.
A new pricing controller handles resource constraints to infer target prices effectively.
problem Resource constraints prevent fixed-price inference, leading to support exclusion.
method Formalizes support-exclusion failure, designs a target-aware controller, and uses a realized information clock.
result The controller can certify feasible target bands and log continuous local densities, leading to polynomial rates of inference.
Develops methods to estimate and quantify uncertainty in off-policy evaluation.
problem Uncertainty quantification in off-policy evaluation for new policy deployment.
method Designs a pseudo policy to generate subsamples and applies conformal prediction.
result Valid interval estimators for target policy's return with uncertainty quantification.
TA-CQR predicts regression intervals with exact coverage, splitting miscoverage between endpoints.
problem Predicting regression intervals with exact coverage under reporting constraints.
method TA-CQR uses tail allocation to parameterize the oracle, estimating the allocation by searching quantile cores and applying nonnegative additive split-conformal calibration.
result TA-CQR achieves exact finite-sample marginal coverage under exchangeability, with theoretical guarantees on calibration and length.
Study compares Interval Regression models and their performance.
problem Regression models struggle with interval target values.
method Comprehensive review and comparative analysis of existing Interval Regression models.
result No single model is universally optimal for all scenarios.
Prediction intervals are a valuable way of quantifying uncertainty in regression problems. Good prediction intervals should be both correct, containing the actual value between the lower and upper bound at least a target percentage of the time; and tight, having a small mean width of the bounds. Many prior techniques f…
The paper develops methods to predict the probability of achieving a user goal in a task, ensuring the system alerts when the probability falls below a threshold.
problem Ensuring an autonomous system achieves the user's goal with calibrated probability estimates.
method Invertible conformal prediction using Probability-space Conformalized Quantile Regression (PCQR) to produce well-calibrated conditional prediction intervals.
result The method produces well-calibrated probabilities that the cumulative reward will fall within a user-specified target interval, with finite-sample guarantees.
CoinDICE estimates confidence intervals for unknown behavior policies in reinforcement learning.
problem Estimating value of a target policy using only behavior policy data.
method Function space embedding, generalized empirical likelihood method, Lagrangian optimization.
result Valid confidence intervals with tighter and more accurate estimates than existing methods.
AutoCP automates the construction of accurate prediction intervals.
problem Creating valid and accurate prediction intervals for machine learning models.
method AutoML framework that optimizes prediction interval length for better accuracy and less conservatism.
result AutoCP significantly outperforms benchmark algorithms in constructing accurate prediction intervals.
In this work, a method of random parameters generation for randomized learning of a single-hidden-layer feedforward neural network is proposed. The method firstly, randomly selects the slope angles of the hidden neurons activation functions from an interval adjusted to the target function, then randomly rotates the act…
Randomized methods of neural network learning suffer from a problem with the generation of random parameters as they are difficult to set optimally to obtain a good projection space. The standard method draws the parameters from a fixed interval which is independent of the data scope and activation function type. This …
A new method improves density ratio estimation with fewer function evaluations.
problem Stable and accurate estimation of density ratios with high variance issues.
method Diffusion Secant Alignment for Score-Based Density Ratio Estimation (ISA-DRE)
result ISA-DRE achieves comparable or superior results with fewer function evaluations.
Targeted Learning uses robust statistics for reproducible research.
problem Improving reproducibility and rigor in statistical analyses.
method Principled standard for statistical estimation and inference, minimizing assumptions.
result Enhances reliability of statistical conclusions.
RQR improves prediction intervals for skewed data.
problem Invalid prediction intervals for skewed noise.
method Relaxed Quantile Regression (RQR) for asymmetric noise.
result Improved prediction intervals with desirable qualities.
CONTINA provides adaptive confidence intervals for traffic demand prediction.
problem Uncertainty in future traffic demand predictions and the need for valid confidence intervals.
method Adaptive confidence interval method that adjusts based on deployment errors.
result Valid confidence intervals with shorter lengths and theoretical coverage guarantee.
Skew-adaptive method improves prediction intervals for regression.
problem Improving prediction intervals for regression models, especially in cases of skewness and varying scales.
method Develops a skew-adaptive extension of split conformal prediction using an asymmetric interval family and gauge approach.
result Preserves marginal validity and adapts to local scale and skewness, with efficiency gains over existing methods.
Introduces neural network for interval-censored survival analysis.
problem Lack of non-linear regression algorithms for interval-censored data.
method Sparse neural network architecture for feature selection and AFT model for prediction.
result Outperforms traditional AFT algorithms in non-linear scenarios.
An online framework optimizes efficiency in conformal prediction with a target miscoverage rate.
problem Achieving coverage and minimizing interval length in a sequential, online setting.
method Optimizes efficiency by directly optimizing the average length of intervals while maintaining coverage.
result Shows a gap between optimal performance for exchangeable and arbitrary sequences, and provides a matching algorithm for the Pareto-optimal settings.
Combines multiple OPE estimators into a more accurate and efficient estimate.
problem Offline evaluation of recommender systems using biased data.
method Meta-analysis of correlated OPE estimators, accounting for inter-estimator correlation.
result Improved statistical efficiency and accuracy in estimating policy value.
Proposes a method to generate multivariate prediction intervals for random forests.
problem Uncertainty estimates for iterative design of experiments with multiple correlated model outputs.
method Recalibrated bootstrap method for bagged models.
result Significantly decreases the number of iterations required for satisfactory candidate in sequential learning problems.
A new method for evaluating and selecting policies in contextual bandits improves confidence intervals and policy quality.
problem Evaluating and selecting policies in contextual bandits with logged data.
method Self-normalized Importance Weighting (SN) estimator with Efron-Stein tail inequality and multiplicative bias control.
result The method provides tighter confidence intervals and better policy selection compared to competitors.
The paper tackles distribution-free prediction intervals for multi-source data.
problem Challenges in achieving valid inferences due to distribution shifts and privacy concerns.
method Derives efficient influence functions, incorporates machine learning, and proposes data-adaptive strategies.
result Achieves parametric rates of convergence to nominal coverage probabilities for prediction intervals.
This work describes an outlier detection procedure (named "OutlierTree") loosely based on the GritBot software developed by RuleQuest research, which works by evaluating and following supervised decision tree splits on variables, in whose branches 1-d confidence intervals are constructed for the target variable and pot…
A method for constructing tight prediction intervals for multiple numerical outputs.
problem Constructing tight prediction intervals for multiple related numerical outputs.
method A novel coordinate-wise standardization procedure that makes residuals comparable across output dimensions, estimating suitable scaling parameters using calibration data.
result The method produces tighter prediction intervals than existing baselines while maintaining valid simultaneous coverage.
Novel framework for contextual anomaly detection models uncertainty.
problem Identifying anomalies in target variables influenced by contextual variables.
method Normalcy score (NS) framework using heteroscedastic Gaussian process regression.
result NS outperforms state-of-the-art methods in detection accuracy and interpretability.
CREDO combines credal and conformal methods to create interpretable prediction intervals.
problem Overconfident prediction intervals in regions of model extrapolation.
method CREDO uses a credal envelope to widen intervals in weak evidence regions and then applies conformal calibration.
result CREDO prediction intervals are interpretable and maintain target coverage.
TCP provides well-calibrated prediction intervals for nonstationary time series.
problem Nonstationary time series forecasting with well-calibrated prediction intervals.
method Temporal Conformal Prediction (TCP) couples a modern quantile forecaster with a rolling split-conformal calibration layer.
result TCP achieves near-nominal coverage, providing slightly wider intervals than Historical Simulation.
Combines coarse learners for nonparametric probabilistic regression.
problem Predicting full probability density functions without strong assumptions.
method Combining gradient boosted forests trained on coarsened target values.
result Prediction intervals have high fidelity and provide valuable insights.
Accelerates DNN robustness verification with target labels.
problem Improving the robustness of deep neural networks against adversarial attacks.
method Guiding robustness verification with target labels, reducing search space and using symbolic interval propagation and linear relaxation.
result Significantly improves DNN verification speed by 36X, especially when perturbation distance is reasonable.
Unified framework for error quantification in off-policy evaluation with distributional shift.
problem Establishing high-confidence CI for target policy value from offline data.
method Unified error analysis quantifying misspecification and sampling errors.
result Achieves tightest possible CI and robustness against distributional shifts.
Calibration error is commonly adopted for evaluating the quality of uncertainty estimators in deep neural networks. In this paper, we argue that such a metric is highly beneficial for training predictive models, even when we do not explicitly measure the uncertainties. This is conceptually similar to heteroscedastic ne…
CoCP optimizes prediction intervals by jointly learning center and radius, improving efficiency and coverage.
problem Inefficient conformal prediction intervals under heteroscedasticity and skewness.
method Co-optimization framework that learns center and radius through alternating optimization steps.
result CoCP yields consistently shorter intervals and state-of-the-art conditional coverage diagnostics.
SCIENCE improves prediction intervals for individual causal effects.
problem Wide prediction intervals limit practical utility of causal inference.
method Surrogate-assisted conformal inference for efficient individual causal effects.
result SCIENCE produces more efficient prediction intervals for individual causal effects.
Enhances polynomial chaos models with uncertainty intervals.
problem Uncertainty quantification in surrogate models.
method Jackknife-based conformal prediction integrated into polynomial chaos expansions.
result Produces accurate predictive intervals for low-accuracy models.
PPI++ uses machine learning predictions to improve inference from small datasets.
problem Efficient inference from small labeled datasets with high-quality predictions.
method Adapts prediction-powered inference (PPI) to compute confidence sets for any parameter dimensionality.
result Improves classical intervals using only labeled data, always yielding better results.
We solve the problem of optimal liquidation with volume weighted average price (VWAP) benchmark when the market impact is linear and transient. Our setting is indeed more general as it considers the case when the trading interval is not necessarily coincident with the benchmark interval: Implementation Shortfall and Ta…
Study improves model fit by transferring info from related datasets.
problem Improving model fit on target data using source data.
method Proposes a transfer learning algorithm for GLMs, derives error bounds, and introduces detection of informative sources.
result Theoretical and practical improvements over classical methods in high-dimensional GLM settings.
We develop a novel method for counterfactual analysis based on observational data using prediction intervals for units under different exposures. Unlike methods that target heterogeneous or conditional average treatment effects of an exposure, the proposed approach aims to take into account the irreducible dispersions …
The paper improves off-policy evaluation in contextual bandits using conformal prediction.
problem Quantifying the performance of a target policy using data from a different behavior policy.
method Proposes a novel algorithm based on a PAC-valid conformal prediction framework to construct probably approximately correct prediction intervals.
result Establishes PAC-type bounds on coverage, improving theoretical guarantees.
LCMQR improves prediction intervals by adapting to local heteroscedasticity.
problem Efficient and adaptive prediction intervals for local heteroscedasticity.
method LCMQR combines multi-quantile information with kernel-based localization.
result LCMQR constructs tighter intervals than prior methods, especially in heterogeneous environments.
Paper develops a method to estimate value of a policy in confounded MDPs.
problem Estimating value of a policy in the presence of unmeasured confounders.
method Uses auxiliary variables to identify target policy's value in a confounded MDP.
result Develops an off-policy value estimator robust to model misspecification.
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.