Bayesian variational regularization on the ball
Matthew A. Price, Jason D. McEwen

TL;DR
This paper introduces Bayesian variational regularization methods tailored for inverse problems on the 3D ball, enabling native spherical domain processing, improved continuity, and efficient uncertainty quantification.
Contribution
It presents a novel variational regularization approach that operates directly on the ball, integrating Bayesian priors with convex optimization for inverse problems.
Findings
Method effectively solves ill-posed inverse problems on the ball.
Supports principled uncertainty quantification.
Provides computationally efficient algorithms.
Abstract
We develop variational regularization methods which leverage sparsity-promoting priors to solve severely ill posed inverse problems defined on the 3D ball (i.e. the solid sphere). Our method solves the problem natively on the ball and thus does not suffer from discontinuities that plague alternate approaches where each spherical shell is considered independently. Additionally, we leverage advances in probability density theory to produce Bayesian variational methods which benefit from the computational efficiency of advanced convex optimization algorithms, whilst supporting principled uncertainty quantification. We showcase these variational regularization and uncertainty quantification techniques on an illustrative example. The C++ code discussed throughout is provided under a GNU general public license.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Statistical Methods and Inference · Probabilistic and Robust Engineering Design
