LiST improves neural network robustness and calibration without manual tuning.
problem Developing robust and calibrated neural networks simultaneously.
method Lipschitz Scaling Training (LiST) that iteratively adjusts the global Lipschitz constant.
result LiST yields an out-of-the-box calibrated network with competitive accuracy and robustness.
Proposes new method for calibrating treatment effect predictors.
problem Calibrating predictors of heterogeneous treatment effects.
method Causal isotonic calibration and cross-calibration.
result Achieves fast calibration rates under weak conditions.
We improve adversarial robustness calibration analysis for broader hypothesis sets.
problem Improving calibration for adversarial robustness in machine learning.
method A finer definition of calibration for adversarial robustness.
result Our results cover most common hypothesis sets in machine learning.
Improves model calibration by addressing adversarially unrobust inputs.
problem Miscalibrated predictions and lack of adversarial robustness in neural networks.
method AR-AdaLS, an adaptive label smoothing method that considers adversarial robustness.
result AR-AdaLS improves model calibration, even under distributional shifts.
Corrects mismatch in consistency of nuisance estimators for doubly robust methods.
problem Mismatch in consistency of nuisance estimators in doubly robust methods.
method Calibrated debiased machine learning (calibrated DML) with isotonic regression adjustment.
result Calibrated DML yields doubly robust asymptotic normality with slower convergence of nuisance estimators.
This paper characterizes and designs loss functions for robust classification with abstention.
problem Ensuring robustness against adversarial attacks and knowing when to abstain from prediction.
method Proposes adversarial robust reject option loss and characterizes surrogates for calibration.
result Shifted Double Ramp Loss and Shifted Double Sigmoid Loss satisfy the calibration conditions.
Calibrated ensembles improve both ID and OOD accuracy in distribution shift.
problem Desired balance between in-distribution and out-of-distribution accuracy.
method Ensemble standard and robust models, calibrating on ID data only.
result ID-calibrated ensembles outperform state-of-the-art methods on multiple datasets.
AECF improves multimodal inference robustness and calibration.
problem Robustness and calibration issues in multimodal systems with missing inputs.
method Adaptive Entropy-Gated Contrastive Fusion (AECF) layer.
result Improves masked-input mAP by +18 pp at a 50% drop rate.
The paper addresses decision making with partially calibrated forecasts, offering a robust approach.
problem Developing a decision-making strategy for forecasts that are only partially calibrated.
method A minimax approach to mapping predictions to actions, considering worst-case distributions.
result The minimax optimal decision rule is to trust predictions and act accordingly, even for partially calibrated forecasts.
Improves robustness of propensity score estimators in challenging settings.
problem Limited overlap, small sample sizes, or unbalanced data.
method Extends calibration techniques for propensity score models, focusing on sample-splitting schemes.
result Calibration reduces variance and bias in inverse probability weighting and double/debiased machine learning frameworks.
The adaptation of numerical wind wave models to the local time-spatial conditions is a problem that can be solved by using various calibration techniques. However, the obtained sets of physical parameters become over-tuned to specific events if there is a lack of observations. In this paper, we propose a robust evoluti…
New method calibrates crypto option prices more robustly.
problem Large bid-ask spreads and missing quotes in crypto markets.
method Designs a novel calibration procedure for crypto options.
result Calibration is more robust and accurate than standard methods.
Decision-calibrated prediction sets improve power system operations by reducing unnecessary costs.
problem Balancing operating costs and reliability in power systems with renewable uncertainty.
method Learn conditional prediction sets as sub-level sets of norm-based score functions, calibrate uncertainty sets based on reliability of downstream decisions.
result Decision-calibrated sets lead to more efficient operations with smaller uncertainty sets and lower costs compared to standard coverage-based calibration.
New method calibrates heterogeneous treatment effect models.
problem Difficulty in estimating and calibrating heterogeneous treatment effects.
method Defined and proposed a robust estimator for HTE calibration, based on doubly robust treatment effect estimators.
result Proposed method evaluates calibration of learned HTE models, addressing overfitting and high-dimensionality.
This work evaluates uncertainty in deep Gaussian processes.
problem Uncertainty quantification in deep Gaussian processes.
method Hierarchical deep Gaussian processes (DGPs) and Deep Sigma Point Processes (DSPPs) evaluated on regression and classification tasks.
result DSPPs provide strong in-distribution calibration but are less robust under distribution shift compared to ensembles.
The uncertainty estimation is critical in real-world decision making applications, especially when distributional shift between the training and test data are prevalent. Many calibration methods in the literature have been proposed to improve the predictive uncertainty of DNNs which are generally not well-calibrated. H…
This research analyzes the consistency of convex and nonconvex surrogate losses for adversarially robust classification.
problem Ensuring classifiers are robust to adversarial perturbations.
method Analysis of convex and nonconvex surrogate losses through the lens of calibration.
result No convex surrogate loss is calibrated with respect to the adversarial 0-1 loss for linear models, but nonconvex losses can be calibrated under certain conditions.
New method improves calibration of neural networks by targeting robust margins and local smoothness.
problem Poor calibration of neural networks, leading to unreliable confidence estimates.
method Intervene on training procedure by targeting robust margins and local smoothness.
result Improved out-of-sample calibration without sacrificing accuracy.
New method calibrates neural network predictions for better reliability.
problem Improper probability estimates from deep networks leading to unreliable predictions.
method Proposes a constrained optimization approach for a monotonic calibration map.
result Achieves state-of-the-art performance across various datasets and models.
We study the out-of-sample properties of robust empirical optimization problems with smooth φ-divergence penalties and smooth concave objective functions, and develop a theory for data-driven calibration of the non-negative "robustness parameter" δ that controls the size of the deviations from the nominal model. Bu…
Study robustness of split conformal prediction under adversarial attacks.
problem Ensuring distribution-free coverage guarantees in CP under adversarial conditions.
method Theoretical analysis and extensive experiments on split conformal prediction robustness.
result Prediction coverage varies with calibration-time attack strength, enabling control over coverage under adversarial tests.
In this paper an improved Cuckoo Search Algorithm is developed to allow for an efficient and robust calibration of the Heston option pricing model for American options. Calibration of stochastic volatility models like the Heston is significantly harder than classical option pricing models as more parameters have to be …
Bayesian neural SDEs calibrate financial models robustly.
problem Calibrating financial models using neural SDEs for robustness.
method Bayesian framework with prior and likelihood, global approximation theorem, Langevin algorithm.
result Robust bounds on implied volatility surface learned from historical and option data.
Combining ensembles and data augmentation harms model calibration.
problem Improving model calibration and robustness with ensembles and data augmentation leads to a trade-off.
method Combining ensemble averaging and data augmentation techniques.
result Combining ensembles and data augmentation can harm model calibration.
New framework calibrates decision robustness using inverse conformal risk control.
problem Inadequate robustness levels in decision-making due to ad hoc choices.
method Constructs valid estimators to trace miscoverage-regret Pareto frontier.
result Provides distribution-free, finite-sample guarantees on robustness levels.
Study on calibration and consistency of adversarial surrogate losses.
problem Designing robust classifiers with theoretical guarantees.
method Extensive analysis of H-calibration and H-consistency of adversarial surrogate losses.
result Some convex loss functions and supremum-based convex losses are not H-calibrated for important hypothesis sets.
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.
PRISM-FCP improves federated prediction robustness against Byzantine attacks.
problem Byzantine attacks in federated learning.
method Partial model sharing and distance-based maliciousness scores.
result Maintains nominal coverage guarantees under Byzantine attacks.
This work investigates square loss in overparametrized neural networks, revealing its advantages in robustness and calibration.
problem Theoretical understanding of square loss in overparametrized neural networks.
method Systematic investigation of square loss in the NTK regime for both separable and non-separable classes.
result Square loss shows fast convergence rates and robustness guarantees for overparametrized neural networks.
Paper develops a new method to improve model calibration under distribution shifts.
problem Challenges in uncertainty quantification with different training and test distributions.
method Develops multi-domain temperature scaling to handle distribution shifts.
result Outperforms existing methods on in-distribution and out-of-distribution test sets.
In this paper we perform robustness and sensitivity analysis of several continuous-time stochastic volatility (SV) models with respect to the process of market calibration. The analyses should validate the hypothesis on importance of the jump part in the underlying model dynamics. Also an impact of the long memory para…
TCR improves DNN robustness to noisy labels with minimal overhead.
problem Training on noisy labeled datasets degrades DNN generalization.
method TCR combines original labels and previous epoch predictions for regularization.
result TCR consistently enhances DNN robustness to label noise.
A new method calibrates value predictions in offline RL to improve reliability.
problem Difficulty in long-horizon value prediction in offline reinforcement learning.
method Bellman calibration, a weak reliability criterion, and Iterated Bellman Calibration.
result Finite-sample guarantees show that Bellman calibration error is controlled at nonparametric rates.
New framework for evaluating multiclass classifier calibration.
problem Ensuring classifiers are well-calibrated for trustworthy predictions.
method Utility Calibration framework that measures calibration error relative to a utility function.
result Unified and robust interpretation of existing calibration metrics.
New approach improves model robustness and calibration in latent space.
problem Improving model robustness and calibration under input perturbations.
method VarMixup (Variational Mixup) in latent space of VAEs.
result Models trained with VarMixup in latent space are more robust and calibrated.
We describe a robust calibration algorithm of a set of SSVI slices (i.e. a set of 3 SSVI parameters θ,ρ,φ attached to each option maturity available on the market), which grants that these slices are free of Butterfly and Calendar-Spread arbitrage. Given such a set of consistent SSVI parameters, we show that …
The paper investigates how calibrating propensity scores improves DML estimates of average treatment effects.
problem Improving the accuracy of DML estimates in finite samples.
method Propensity score calibration within the Double/debiased machine learning framework.
result Calibrating propensity scores reduces the root mean squared error of DML estimates of average treatment effects in finite samples.
In many classification problems it is desirable to output well-calibrated probabilities on the different classes. We propose a robust, non-parametric method of calibrating probabilities called SplineCalib that utilizes smoothing splines to determine a calibration function. We demonstrate how applying certain transforma…
New method calibrates eSSVI volatility surfaces without arbitrage.
problem Sequential calibration of eSSVI surfaces lacks global view and guarantees no arbitrage.
method Global and arbitrage-free parametrization of eSSVI surfaces.
result Faster calibration always guarantees an arbitrage-free fit.
Adaptive uncertainty quantification improves black-box model predictions in generative AI.
problem Improving uncertainty quantification for black-box models in generative AI.
method Adaptive partitioning and local calibration of conformity scores.
result Local tightening of uncertainty sets with adaptive bands.
A new metric CKCE improves model calibration comparison.
problem Comparing the calibration of probabilistic models is challenging.
method CKCE based on Hilbert-Schmidt norm of conditional mean operators.
result CKCE provides more consistent and robust model calibration comparisons.
Discuss new policy learning objectives and methods.
problem Improving policy learning efficiency and robustness.
method Introducing curvature considerations and calibration data methods.
result Efficient retargeting and distributionally robust policies.
New method calibrates ambiguity sets for robust decision-making under contamination.
problem Minimizing worst-case expected loss over distributional shifts in out-of-sample environments.
method Bulk-calibrated credal ambiguity sets that learn a high-mass bulk set from data and bound tail contributions.
result Closed-form, finite robust objective and tractable optimization for various losses and geometries.
The paper calibrates uncertainty in dropout variational inference models.
problem Miscalibration of model uncertainty in dropout variational inference.
method Logit scaling methods are extended to recalibrate model uncertainty.
result Logit scaling reduces miscalibration, improving reliability of predictions.
New truthful calibration errors improve model ranking in multiclass prediction.
problem Non-truthful calibration errors can mislead model comparisons.
method Introduced perfectly truthful calibration errors for multiclass predictions.
result Truthful calibration errors preserve decision-theoretic dominance and stabilize model rankings.
Bayesian X-Learner calibrates uncertainty and robustness for CATE estimation under heavy-tailed data.
problem Estimating heterogeneous treatment effects with calibrated uncertainty and robustness to heavy-tailed outcomes.
method Bayesian X-Learner using cross-fitted doubly robust pseudo-outcomes and MCMC for a full posterior over CATE.
result Bayesian X-Learner achieves robust and calibrated CATE estimation on real and contaminated data.
Paper introduces a method to improve survival model calibration without sacrificing discrimination.
problem Survival models struggle to balance accurate ranking and event prediction.
method Uses conformal regression to enhance calibration without compromising discrimination.
result The approach improves model calibration across 11 real-world datasets.
Deep Neural Networks (DNNs) have achieved state-of-the-art accuracy performance in many tasks. However, recent works have pointed out that the outputs provided by these models are not well-calibrated, seriously limiting their use in critical decision scenarios. In this work, we propose to use a decoupled Bayesian stage…