Convolutional Bayesian Filtering

• URL: http://arxiv.org/abs/2404.00481v1
• Date: Sat, 30 Mar 2024 22:20:02 GMT
• Title: Convolutional Bayesian Filtering
• Abstract summary: We transform the conditional probability into a special integration that is analogous to convolution. We show that both transition probability and output probability can be generalized to convolutional forms. We also exemplify the effectiveness of our approach by reshaping classic filtering algorithms into convolutional versions.
• Score: 11.750661897960054
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Bayesian filtering serves as the mainstream framework of state estimation in dynamic systems. Its standard version utilizes total probability rule and Bayes' law alternatively, where how to define and compute conditional probability is critical to state distribution inference. Previously, the conditional probability is assumed to be exactly known, which represents a measure of the occurrence probability of one event, given the second event. In this paper, we find that by adding an additional event that stipulates an inequality condition, we can transform the conditional probability into a special integration that is analogous to convolution. Based on this transformation, we show that both transition probability and output probability can be generalized to convolutional forms, resulting in a more general filtering framework that we call convolutional Bayesian filtering. This new framework encompasses standard Bayesian filtering as a special case when the distance metric of the inequality condition is selected as Dirac delta function. It also allows for a more nuanced consideration of model mismatch by choosing different types of inequality conditions. For instance, when the distance metric is defined in a distributional sense, the transition probability and output probability can be approximated by simply rescaling them into fractional powers. Under this framework, a robust version of Kalman filter can be constructed by only altering the noise covariance matrix, while maintaining the conjugate nature of Gaussian distributions. Finally, we exemplify the effectiveness of our approach by reshaping classic filtering algorithms into convolutional versions, including Kalman filter, extended Kalman filter, unscented Kalman filter and particle filter.

Related papers

• Learning Probabilistic Filters with Strictly Proper Scoring Rules [8.61813579171868]
  We introduce the proper scoring ensemble filter (PSEF), an ensemble data assimilation method based on training an analysis map to approximate the filtering distribution.<n>We prove that, under a realizability assumption, the population objective is minimized by the true Bayesian filtering distribution.<n> Numerical experiments show that the learned filter accurately approximates challenging filtering distributions, including nonlinear, non-Gaussian, and multi-modal posteriors.
  arXiv  Detail & Related papers  (2026-06-25T01:04:21Z)
• Filtered Conformal Ellipsoids for Graph-Native Time Series [0.8460698440162889]
  We use a filter to choose the ellipsoid shape; conformal calibration chooses the scalar radius.<n>We analyse contraction in an observable predictive-law quotient.<n>We instantiate the framework with a GCN-GRU filter with diagonal-plus-low-rank covariance.
  arXiv  Detail & Related papers  (2026-06-15T17:46:19Z)
• Deformable Wiener Filter for Future Video Coding [55.405068056883614]
  We propose a deformable Wiener Filter (DWF) for in-loop filters in Versatile Video Coding (VVC)<n>It combines the local and non-local characteristics and supervisedly trains the filter coefficients based on the Wiener Filter theory.<n>It achieves 1.16%, 1.92%, and 2.67% bit-rate savings on average compared to the VTM-11.0 for All Intra, Random Access, and Low-Delay B configurations.
  arXiv  Detail & Related papers  (2026-06-01T02:24:07Z)
• Preconditioned Regularized Wasserstein Proximal Sampling [2.7957842724446174]
  We consider sampling from a noise-free distribution by evolving finitely many particles.<n>For potentials, we provide a non-asymotic convergence analysis and explicitly the bias, which is dependent on regularization.
  arXiv  Detail & Related papers  (2025-09-01T18:04:31Z)
• Closed-form Filtering for Non-linear Systems [83.91296397912218]
  We propose a new class of filters based on Gaussian PSD Models, which offer several advantages in terms of density approximation and computational efficiency. We show that filtering can be efficiently performed in closed form when transitions and observations are Gaussian PSD Models. Our proposed estimator enjoys strong theoretical guarantees, with estimation error that depends on the quality of the approximation and is adaptive to the regularity of the transition probabilities.
  arXiv  Detail & Related papers  (2024-02-15T08:51:49Z)
• Generating random Gaussian states [0.4604003661048266]
  We show that the eigenvalues of an RQCM converge to a shifted semicircular distribution in the limit of a large number of modes. We show that the symplectic eigenvalues of an RQCM converge to a probability distribution that can be characterized using free probability.
  arXiv  Detail & Related papers  (2024-01-24T13:06:57Z)
• On Rate-Optimal Partitioning Classification from Observable and from Privatised Data [4.2931743492904095]
  We revisit the classical method of partitioning classification and study its convergence rate under relaxed conditions.<n>We consider the problem of classification in a $d$ dimensional Euclidean space.
  arXiv  Detail & Related papers  (2023-12-22T18:07:18Z)
• An adaptive ensemble filter for heavy-tailed distributions: tuning-free inflation and localization [0.3749861135832072]
  Heavy tails is a common feature of filtering distributions that results from the nonlinear dynamical and observation processes. We propose an algorithm to estimate the prior-to-posterior update from samples of joint forecast distribution of the states and observations. We demonstrate the benefits of this new ensemble filter on challenging filtering problems.
  arXiv  Detail & Related papers  (2023-10-12T21:56:14Z)
• Fit Like You Sample: Sample-Efficient Generalized Score Matching from Fast Mixing Diffusions [29.488555741982015]
  We show a close connection between the mixing time of a broad class of Markov processes with generator $mathcalL$. We adapt techniques to speed up Markov chains to construct better score-matching losses. In particular, preconditioning' the diffusion can be translated to an appropriate preconditioning'' of the score loss.
  arXiv  Detail & Related papers  (2023-06-15T17:58:42Z)
• Will My Robot Achieve My Goals? Predicting the Probability that an MDP Policy Reaches a User-Specified Behavior Target [56.99669411766284]
  As an autonomous system performs a task, it should maintain a calibrated estimate of the probability that it will achieve the user's goal. This paper considers settings where the user's goal is specified as a target interval for a real-valued performance summary. We compute the probability estimates by inverting conformal prediction.
  arXiv  Detail & Related papers  (2022-11-29T18:41:20Z)
• Continuous and Distribution-free Probabilistic Wind Power Forecasting: A Conditional Normalizing Flow Approach [1.684864188596015]
  We present a data-driven approach for probabilistic wind power forecasting based on conditional normalizing flow (CNF) In contrast with the existing, this approach is distribution-free (as for non-parametric and quantile-based approaches) and can directly yield continuous probability densities.
  arXiv  Detail & Related papers  (2022-06-06T08:48:58Z)
• Deep Learning for the Benes Filter [91.3755431537592]
  We present a new numerical method based on the mesh-free neural network representation of the density of the solution of the Benes model. We discuss the role of nonlinearity in the filtering model equations for the choice of the domain of the neural network.
  arXiv  Detail & Related papers  (2022-03-09T14:08:38Z)
• Adversarial sampling of unknown and high-dimensional conditional distributions [0.0]
  In this paper the sampling method, as well as the inference of the underlying distribution, are handled with a data-driven method known as generative adversarial networks (GAN) GAN trains two competing neural networks to produce a network that can effectively generate samples from the training set distribution. It is shown that all the versions of the proposed algorithm effectively sample the target conditional distribution with minimal impact on the quality of the samples.
  arXiv  Detail & Related papers  (2021-11-08T12:23:38Z)
• Fourier Series Expansion Based Filter Parametrization for Equivariant Convolutions [73.33133942934018]
  2D filter parametrization technique plays an important role when designing equivariant convolutions. New equivariant convolution method based on the proposed filter parametrization method, named F-Conv. F-Conv evidently outperforms previous filter parametrization based method in image super-resolution task.
  arXiv  Detail & Related papers  (2021-07-30T10:01:52Z)
• Variational Transport: A Convergent Particle-BasedAlgorithm for Distributional Optimization [106.70006655990176]
  A distributional optimization problem arises widely in machine learning and statistics. We propose a novel particle-based algorithm, dubbed as variational transport, which approximately performs Wasserstein gradient descent. We prove that when the objective function satisfies a functional version of the Polyak-Lojasiewicz (PL) (Polyak, 1963) and smoothness conditions, variational transport converges linearly.
  arXiv  Detail & Related papers  (2020-12-21T18:33:13Z)
• Distributionally Robust Bayesian Quadrature Optimization [60.383252534861136]
  We study BQO under distributional uncertainty in which the underlying probability distribution is unknown except for a limited set of its i.i.d. samples. A standard BQO approach maximizes the Monte Carlo estimate of the true expected objective given the fixed sample set. We propose a novel posterior sampling based algorithm, namely distributionally robust BQO (DRBQO) for this purpose.
  arXiv  Detail & Related papers  (2020-01-19T12:00:33Z)

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.