Learning Context-conditioned Gaussian Overbounds for Convolution-Based Uncertainty Propagation

• URL: http://arxiv.org/abs/2605.15789v1
• Date: Fri, 15 May 2026 09:47:05 GMT
• Title: Learning Context-conditioned Gaussian Overbounds for Convolution-Based Uncertainty Propagation
• Abstract summary: We propose a unified learning framework that trains neural networks to produce context-aware Gaussian overbounds.<n>We provide a scoped analysis of discrete-to-continuous conservatism and compact-domain objective regularity.<n>The framework is modality-agnostic and applicable to learning systems that require conservative, feature-conditioned uncertainty estimates.
• Score: 4.891998873486944
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Uncertainty quantification is essential in safety-critical settings--from autonomous driving to aviation, finance, and health--where decisions must rely on conservative bounds rather than point estimates. Predictor-level intervals (e.g., from quantile regression, conformal prediction, variance networks, or Bayesian models) generally do not compose: adding two per-variable intervals need not yield a valid interval for their sum or preserve coverage. In aviation, Gaussian overbounding replaces complex error distributions with a conservative Gaussian whose tails dominate the truth, so conservatism propagates through linear operations. Yet classical overbounds are global, often overly conservative, and hard to adapt to feature-conditioned errors. We propose a unified learning framework that trains neural networks to produce context-aware Gaussian overbounds--mean and scale--with provable conservatism on a finite quantile grid and, under three explicit regularity assumptions, continuous-tail conservatism on a certified interval. Our overbounding loss enforces conservativeness at selected quantiles while penalizing distributional distance with a Wasserstein-style term. The learned bounds support conservative linear-combination and convolution analysis on the enforced grid, and on the certified interval when assumptions hold, while being less redundant than traditional methods. We provide a scoped analysis of discrete-to-continuous conservatism and compact-domain objective regularity, and validate on synthetic data and real-world datasets, including multipath, ionospheric, and tropospheric residual errors. Across these settings, the method yields tighter bounds while maintaining conservatism on the enforced grid and in experiments. The framework is modality-agnostic and applicable to learning systems that require conservative, feature-conditioned uncertainty estimates in dynamic environments.

Related papers

• Finite Reliability Representations: Noise-Calibrated Belief-Space Covers for Reliable Decision-Making [0.0]
  We introduce Finite Reliability Representations (FRR), a framework for covering belief spaces by reliability cells.<n>FRR is formulated on beliefs rather than states and uses a cover rather than an equivalence quotient.<n>It applies to finite POMDPs, linear-Gaussian filters, locally linearized nonlinear filters, and particle-filter implementations.
  arXiv  Detail & Related papers  (2026-07-04T20:30:48Z)
• Dangerous Liaisons of Convex Learning and Non-Affine Aggregation [19.624245500772027]
  Last-iterate convergence and generalization guarantees in first-order convex learning hinge on the monotonicity of the update operator.<n>Non-affine aggregation prevents steady convergence and substantially degrades algorithmic stability.<n>Our results provide a unified theoretical framework explaining the disparate failure modes observed in modern learning systems.
  arXiv  Detail & Related papers  (2026-06-26T14:24:11Z)
• RareCP: Regime-Aware Retrieval for Efficient Conformal Prediction [11.259098206661077]
  We introduce RareCP, a regime-aware retrieval method for adaptive conformal time series prediction.<n>RareCP learns local calibration representations through a mixture of cosine-attention experts.<n>It forms a weighted conformal quantile over their signed residuals, yielding asymmetric prediction intervals.
  arXiv  Detail & Related papers  (2026-05-09T10:12:07Z)
• Recovering Physical Dynamics from Discrete Observations via Intrinsic Differential Consistency [12.266189649117003]
  We replace local supervision with a global structural constraint.<n>We train a time-conditioned secant velocity field whose deviation from this property serves two purposes.<n>As a training regularizer, it confines the hypothesis space to flows that compose consistently across temporal scales.
  arXiv  Detail & Related papers  (2026-05-08T20:24:32Z)
• Optimal uncertainty bounds for multivariate kernel regression under bounded noise: A Gaussian process-based dual function [3.2093811507874768]
  Non-conservative uncertainty bounds are essential for making reliable predictions about latent functions from noisy data.<n>This paper presents a tight, distribution-free bound for multi-output kernel-based estimates.
  arXiv  Detail & Related papers  (2026-03-17T13:06:54Z)
• Verifying Closed-Loop Contractivity of Learning-Based Controllers via Partitioning [52.23804865017831]
  We address the problem of verifying closed-loop contraction in nonlinear control systems whose controller and contraction metric are both parameterized by neural networks.<n>We derive a tractable and scalable sufficient condition for closed-loop contractivity that reduces to checking that the dominant eigenvalue of a symmetric Metzler matrix is nonpositive.
  arXiv  Detail & Related papers  (2025-12-01T23:06:56Z)
• Smooth Sailing: Lipschitz-Driven Uncertainty Quantification for Spatial Association [15.706262708190643]
  We show that existing methods for constructing confidence intervals for associations can fail to provide nominal coverage in the face of model misspecification and nonrandom locations.<n>We introduce a method that constructs valid frequentist confidence intervals for associations in spatial settings.<n>Our approach is the first to guarantee nominal coverage in this setting and outperforms existing techniques in both real and simulated experiments.
  arXiv  Detail & Related papers  (2025-02-09T23:20:03Z)
• Relaxed Quantile Regression: Prediction Intervals for Asymmetric Noise [51.87307904567702]
  Quantile regression is a leading approach for obtaining such intervals via the empirical estimation of quantiles in the distribution of outputs.<n>We propose Relaxed Quantile Regression (RQR), a direct alternative to quantile regression based interval construction that removes this arbitrary constraint.<n>We demonstrate that this added flexibility results in intervals with an improvement in desirable qualities.
  arXiv  Detail & Related papers  (2024-06-05T13:36:38Z)
• Neuro-Symbolic Entropy Regularization [78.16196949641079]
  In structured prediction, the goal is to jointly predict many output variables that together encode a structured object. One approach -- entropy regularization -- posits that decision boundaries should lie in low-probability regions. We propose a loss, neuro-symbolic entropy regularization, that encourages the model to confidently predict a valid object.
  arXiv  Detail & Related papers  (2022-01-25T06:23:10Z)
• Estimation and Applications of Quantiles in Deep Binary Classification [0.0]
  Quantile regression, based on check loss, is a widely used inferential paradigm in Statistics. We consider the analogue of check loss in the binary classification setting. We develop individualized confidence scores that can be used to decide whether a prediction is reliable.
  arXiv  Detail & Related papers  (2021-02-09T07:07:42Z)
• Distribution-free binary classification: prediction sets, confidence intervals and calibration [106.50279469344937]
  We study three notions of uncertainty quantification -- calibration, confidence intervals and prediction sets -- for binary classification in the distribution-free setting. We derive confidence intervals for binned probabilities for both fixed-width and uniform-mass binning. As a consequence of our 'tripod' theorems, these confidence intervals for binned probabilities lead to distribution-free calibration.
  arXiv  Detail & Related papers  (2020-06-18T14:17:29Z)
• On dissipative symplectic integration with applications to gradient-based optimization [77.34726150561087]
  We propose a geometric framework in which discretizations can be realized systematically. We show that a generalization of symplectic to nonconservative and in particular dissipative Hamiltonian systems is able to preserve rates of convergence up to a controlled error.
  arXiv  Detail & Related papers  (2020-04-15T00:36:49Z)
• 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)

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.