Between Resolution Collapse and Variance Inflation: Weighted Conformal Anomaly Detection in Low-Data Regimes

• URL: http://arxiv.org/abs/2603.23205v1
• Date: Tue, 24 Mar 2026 13:51:59 GMT
• Title: Between Resolution Collapse and Variance Inflation: Weighted Conformal Anomaly Detection in Low-Data Regimes
• Abstract summary: Real-world data often exhibit distribution shifts, necessitating a weighted conformal approach to adapt to local non-stationarity.<n>We show that this adaptation induces a critical trade-off between the minimum attainable p-value and its stability.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Standard conformal anomaly detection provides marginal finite-sample guarantees under the assumption of exchangeability . However, real-world data often exhibit distribution shifts, necessitating a weighted conformal approach to adapt to local non-stationarity. We show that this adaptation induces a critical trade-off between the minimum attainable p-value and its stability. As importance weights localize to relevant calibration instances, the effective sample size decreases. This can render standard conformal p-values overly conservative for effective error control, while the smoothing technique used to mitigate this issue introduces conditional variance, potentially masking anomalies. We propose a continuous inference relaxation that resolves this dilemma by decoupling local adaptation from tail resolution via continuous weighted kernel density estimation. While relaxing finite-sample exactness to asymptotic validity, our method eliminates Monte Carlo variability and recovers the statistical power lost to discretization. Empirical evaluations confirm that our approach not only restores detection capabilities where discrete baselines yield zero discoveries, but outperforms standard methods in statistical power while maintaining valid marginal error control in practice.

Related papers

• Finite-Sample Metric Non-Collapse for Geometrically Supervised Latent World Models in Control [0.0]
  We establish a finite-sample learning-to-control theory for geometrically supervised latent models of nonlinear deterministic systems.<n>We introduce an encoder-only local--global metric hinge that enforces directional resolution and separated-state discrimination.<n>A modular deterministic transfers the learned certificates to trajectory, finite-horizon cost, learned-cost-head, and corollary guarantees, while a validated finite-net result enables sharper model-specific certification.
  arXiv  Detail & Related papers  (2026-08-07T14:25:33Z)
• Adaptive MPPI with Online Disturbance Covariance Estimation: Provable Stability Tightening via Spatial Smoothing [0.0]
  We study Model Predictive Path Integral (MPPI) control for nonlinear systems with additive process disturbances.<n>A mismatched disturbance covariance produces a persistent penalty in closed-loop stability certificates.
  arXiv  Detail & Related papers  (2026-07-09T21:12:40Z)
• Discovery of Hidden Miscalibration Regimes [52.452902154360565]
  Models may be systematically overconfident on some kinds of inputs and underconfident on others.<n>We define the corresponding miscalibration field and propose a diagnostic framework for estimating it.<n>Our approach learns a calibration-aware representation of the input space and estimates signed local miscalibration by kernel smoothing in the learned geometry.
  arXiv  Detail & Related papers  (2026-05-13T13:07:50Z)
• ConformaDecompose: Explaining Uncertainty via Calibration Localization [0.26385121748044166]
  Conformal Prediction provides distribution-free prediction intervals with guaranteed coverage.<n>Its reliance on a single global calibration threshold obscures the sources of uncertainty at the instance level.<n>We introduce an uncertainty-aware explainability framework that analyses the reducibility of calibration-induced uncertainty.
  arXiv  Detail & Related papers  (2026-04-29T19:58:15Z)
• Non-monotonicity in Conformal Risk Control [4.71350885287928]
  Conformal risk control (CRC) provides distribution-free guarantees for controlling the expected loss at a user-specified level.<n>We study CRC under non-monotone loss functions when the tuning parameter is selected from a finite grid.<n>We show that the validity of CRC without monotonicity depends on the relationship between the calibration sample size and the grid resolution.
  arXiv  Detail & Related papers  (2026-04-02T00:26:50Z)
• Prediction-Powered Conditional Inference [15.801272841475681]
  We study prediction-powered conditional inference in the setting where labeled data are scarce.<n>Our approach combines localization with prediction-based variance reduction.<n> Numerical experiments on simulated and real datasets demonstrate valid conditional coverage.
  arXiv  Detail & Related papers  (2026-03-05T17:13:06Z)
• Non-exchangeable Conformal Prediction with Optimal Transport: Tackling Distribution Shifts with Unlabeled Data [13.788274786492286]
  Conformal prediction is a distribution-free uncertainty quantification method that has gained popularity in the machine learning community.<n>Its most common variant, dubbed split conformal prediction, is also computationally efficient as it boils down to collecting statistics of the model predictions on some calibration data not yet seen by the model.<n>We show that it is possible to estimate the loss in coverage and mitigate arbitrary distribution shifts, offering a principled and broadly applicable solution.
  arXiv  Detail & Related papers  (2025-07-14T16:10:55Z)
• Multivariate Latent Recalibration for Conditional Normalizing Flows [6.932606401614012]
  latent recalibration learns a transformation of the latent space with finite-sample bounds on latent calibration.<n>LR consistently improves latent calibration error and the negative log-likelihood of the recalibrated models.
  arXiv  Detail & Related papers  (2025-05-22T13:08:20Z)
• Rectifying Conformity Scores for Better Conditional Coverage [75.73184036344908]
  We present a new method for generating confidence sets within the split conformal prediction framework.<n>Our method performs a trainable transformation of any given conformity score to improve conditional coverage while ensuring exact marginal coverage.
  arXiv  Detail & Related papers  (2025-02-22T19:54:14Z)
• Near-optimal inference in adaptive linear regression [60.08422051718195]
  Even simple methods like least squares can exhibit non-normal behavior when data is collected in an adaptive manner. We propose a family of online debiasing estimators to correct these distributional anomalies in at least squares estimation. We demonstrate the usefulness of our theory via applications to multi-armed bandit, autoregressive time series estimation, and active learning with exploration.
  arXiv  Detail & Related papers  (2021-07-05T21:05:11Z)
• Amortized Conditional Normalized Maximum Likelihood: Reliable Out of Distribution Uncertainty Estimation [99.92568326314667]
  We propose the amortized conditional normalized maximum likelihood (ACNML) method as a scalable general-purpose approach for uncertainty estimation. Our algorithm builds on the conditional normalized maximum likelihood (CNML) coding scheme, which has minimax optimal properties according to the minimum description length principle. We demonstrate that ACNML compares favorably to a number of prior techniques for uncertainty estimation in terms of calibration on out-of-distribution inputs.
  arXiv  Detail & Related papers  (2020-11-05T08:04:34Z)
• Log-Likelihood Ratio Minimizing Flows: Towards Robust and Quantifiable Neural Distribution Alignment [52.02794488304448]
  We propose a new distribution alignment method based on a log-likelihood ratio statistic and normalizing flows. We experimentally verify that minimizing the resulting objective results in domain alignment that preserves the local structure of input domains.
  arXiv  Detail & Related papers  (2020-03-26T22:10:04Z)
• GenDICE: Generalized Offline Estimation of Stationary Values [108.17309783125398]
  We show that effective estimation can still be achieved in important applications. Our approach is based on estimating a ratio that corrects for the discrepancy between the stationary and empirical distributions. The resulting algorithm, GenDICE, is straightforward and effective.
  arXiv  Detail & Related papers  (2020-02-21T00:27:52Z)

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.