Searcharxiv⌕ Search

arXiv subjects

Babak Maboudi Afkham

Publications and source records attributed to Babak Maboudi Afkham.

At least 19 recordsLinked to original sources

A Goal-Oriented Bayesian Experimental Design to Reduce Uncertainty in Sparse-Angle X-ray Computed Tomography

Sparse-angle X-ray computed tomography (CT) presents a challenge for reliable inference, as limited measurements may leave object boundaries unresolved. Bayesian optimal experimental design (BOED) methods select informative measurements, but can be computationally expensive or require data-driven surrogates and do not explicitly exploit microlocal visibility. We address this limitation by focusing on estimating inclusion boundaries rather than the entire attenuation field. For piecewise-constant objects, these boundaries correspond to singularities characterized by their wavefront sets. Microlocal analysis determines the X-ray view-angles at which these singularities are visible. We combine this information with Bayesian uncertainty quantification to introduce B-MUSE, a microlocal uncertainty-driven sequential experimental design method. We define a microlocal C-optimality criterion associated with the wavefront direction of the most uncertain boundary singularity and prove that its optimal solution satisfies the microlocal visibility condition. B-MUSE uses this result to sequentially select informative view-angles according to boundary uncertainty. It also incorporates an adaptive stopping criterion that terminates acquisition when additional measurements provide no meaningful uncertainty reduction. We evaluate B-MUSE through numerical experiments, including interpretable examples, prior-generated inclusions, and a multi-inclusion example from an external dataset, and benchmark it against recent methods. The results show that B-MUSE substantially reduces posterior uncertainty with few adaptively selected measurements while providing boundary estimates. These findings establish a direct connection between BOED and microlocal visibility and demonstrate the potential of uncertainty-driven acquisition to reduce measurement requirements for goal-oriented X-ray CT without training data.

stat.AP↗

B-GRASP: A Bayesian Framework for Inferring Graph Weights from SPDE-Inspired Dynamics

We present B-GRASP (Bayesian GRAph inference with SPDE priors), a Bayesian framework for inferring uncertain edge weights in stochastic dynamical systems on graphs from noisy observations of nodal states. The unknown edge weights parameterize the graph differential operator and therefore directly govern the evolution of the graph process. Motivated by connections between differential operators in PDEs and SPDEs and their graph counterparts, we construct stochastic graph models incorporating diffusion, reaction dynamics, and stochastic forcing. The resulting hierarchical formulation jointly represents uncertainty in the graph structure and stochastic forcing. Latent graph variables determine positive edge weights and the corresponding graph Laplacian, while latent Brownian variables represent the stochastic forcing. Conditional on these variables, the graph dynamics define a deterministic forward map from which the likelihood and posterior distribution are constructed. We characterize the posterior using maximum a posteriori estimation and the No-U-Turn Sampler, enabling both point estimation and uncertainty quantification. We demonstrate the framework on a one-dimensional inverse heat-conduction problem, stationary and nonstationary graph reaction-diffusion systems with nonlinear dynamics, and state-level COVID-19 data in the United States. The numerical results show that posterior uncertainty provides information not captured by point estimates, particularly for weakly identifiable or highly conductive edges, and enables uncertainty in both graph connectivity and stochastic forcing to be quantified within a Bayesian framework.

stat.ME↗

3D Uncertainty Quantification for Photoacoustic Tomography

Photoacoustic tomography (PAT) is a promising modality for high-resolution biomedical imaging, motivating the need for reliable uncertainty quantification (UQ) of reconstructed images. Bayesian approaches provide a rigorous framework for UQ but remain computationally challenging for realistic three-dimensional PAT and are sensitive to numerical approximations in the governing wave equation. We develop a finite-element Bayesian UQ framework for PAT that accommodates complex computational domains and detector geometries while enabling large-scale three-dimensional inference. The proposed methodology reformulates the randomize-then-optimize (RTO) sampling strategy as a matrix-free algorithm that generates independent posterior samples using only forward and adjoint wave propagations. Particular attention is given to constructing an adjoint discretization that forms an exact transpose pair with the discrete forward operator while remaining consistent with the continuous PAT adjoint, enabling efficient least-squares solvers within the sampling procedure. We investigate the influence of temporal discretization, artificial boundary conditions, and adjoint consistency on posterior uncertainty and identify discretization strategies that avoid numerical artifacts. The framework is validated against exact posterior statistics, existing Bayesian PAT methods, and Hamiltonian Monte Carlo using the No-U-Turn Sampler (NUTS), and is demonstrated on a three-dimensional problem with approximately $2\times 10^5$ unknowns on a general finite-element domain. To the best of our knowledge, this is the first large-scale Bayesian PAT study on general three-dimensional finite-element geometries, and the methodology extends naturally to a broad class of linear PDE-constrained inverse problems.

math.NA↗

Bayesian decomposition using Besov priors

In many inverse problems, the unknown is composed of multiple components with different regularities, for example, in imaging problems, where the unknown can have both rough and smooth features. We investigate linear Bayesian inverse problems, where the unknown consists of two components: one smooth and one piecewise constant. We model the unknown as a sum of two components and assign individual priors on each component to impose the assumed behavior. We propose and compare two prior models: (i) a combination of a Haar wavelet-based Besov prior and a smoothing Besov prior, and (ii) a hierarchical Gaussian prior on the gradient coupled with a smoothing Besov prior. To achieve a balanced reconstruction, we place hyperpriors on the prior parameters and jointly infer both the components and the hyperparameters. We propose Gibbs sampling schemes for posterior inference in both prior models. We demonstrate the capabilities of our approach on 1D and 2D deconvolution problems, where the unknown consists of smooth parts with jumps. The numerical results indicate that our methods improve the reconstruction quality compared to single-prior approaches and that the prior parameters can be successfully estimated to yield a balanced decomposition.

stat.CO↗

Adjoint-Based Bayesian Uncertainty Quantification for PDE-Constrained Inverse Problems with Application to Semiconductor Imaging

We formulate a Bayesian framework for reconstructing doping profiles in pn-junction semiconductor devices from boundary flux measurements. The unknown doping field is modeled as a piecewise-constant function characterized by an unknown interface and two plateau concentrations, leading to a nonlinear ill-posed inverse problem governed by a Poisson-Boltzmann-type equation. To represent this structure while enabling efficient gradient-based inference, we introduce a pushforward prior constructed by mapping a latent Gaussian field with Matérn-type covariance through a sigmoid transformation. The latent field is parameterized by a truncated Karhunen-Loève expansion, while the two piecewise-constant levels are represented by scalar plateau parameters. The prior yields differentiable approximations of piecewise-constant fields with controllable interface sharpness. We establish well-posedness of the Bayesian formulation by proving Lipschitz continuity of the forward map and Hellinger stability of the posterior. We then sample the posterior using the No-U-Turn Sampler (NUTS) with gradients computed by the adjoint method. Numerical experiments show that the combination of the proposed prior and NUTS provides more efficient posterior exploration than the dimension-robust preconditioned Crank-Nicolson (pCN) sampler, yielding one to two orders of magnitude larger effective sample sizes. In the known-plateau setting, the method reconstructs both planar and curved interfaces and provides spatially resolved uncertainty quantification (UQ). When the interface geometry and plateau concentrations are inferred jointly, posterior correlations reveal structural non-identifiability. These results demonstrate the effectiveness of combining pushforward priors with adjoint-gradient-based sampling for reliable UQ in nonlinear partial differential equation-constrained inverse problems with sharp interfaces.

math.NA↗

QVaR: a Quantum Variational Regularization method for Linear Inverse Problems

We present a tailored framework for solving regularized linear inverse problems using quantum optimization methods. By discretizing the solution space and encoding data fidelity and regularization terms into quadratic unconstrained binary optimization (QUBO) models, we formulate both Tikhonov- and sparsity-promoting regularized inverse problems within a unified quantum optimization framework. We further introduce a notion of quantum sensitivity that characterizes the effect of perturbations arising from approximate quantum evolution and discretization. We derive bounds relating these perturbations to stability properties of the underlying inverse problem, thereby establishing a theoretical connection between quantum solution variability and classical notions of ill-posedness. The framework is extended to variational inverse problems through wavelet-based representations and complemented by reduced-order modeling strategies in both parameter and Hamiltonian spaces to mitigate current hardware limitations. Numerical experiments on simulated and physical quantum hardware indicate that the resulting low-energy solution distributions retain information about the underlying inverse problem, while also revealing the limitations imposed by finite-time evolution, discretization, and hardware noise.

math.NA↗

Simultaneous Estimation of Seabed and Its Roughness With Longitudinal Waves

This paper introduces an infinite-dimensional Bayesian framework for acoustic seabed tomography, leveraging wave scattering to simultaneously estimate the seabed and its roughness. Tomography is considered an ill-posed problem where multiple seabed configurations can result in similar measurement patterns. We propose a novel approach focusing on the statistical isotropy of the seabed. Utilizing fractional differentiability to identify seabed roughness, the paper presents a robust numerical algorithm to estimate the seabed and quantify uncertainties. Extensive numerical experiments validate the effectiveness of this method, offering a promising avenue for large-scale seabed exploration.

stat.AP↗

Bayesian Formulation of Acousto-Electric Tomography and Quantified Uncertainty in Limited View

Acousto-electric tomography (AET) is a hybrid imaging modality that combines electrical impedance tomography with focused ultrasound perturbations to obtain interior power density measurements, which provide additional information that can enhance the stability of conductivity reconstruction. In this work, we study the AET inverse problem within a Bayesian framework and compare statistical reconstruction with analytical approaches. The unknown conductivity is modeled as a random field, and inference is based on the posterior distribution conditioned on the measurements. We consider likelihood constructions based on both L1- and L2-type data misfit norms and establish Bayesian well-posedness for both formulations within the framework of Stuart (2010). Numerical experiments investigate the performance of the Bayesian method from noisy power density measurements using the L1 and L2 likelihood functions and a smooth prior and a piecewise-constant prior for different limited view configurations, including severely limited boundary access. In particular, we demonstrate that small inclusions near the accessible boundary can be reconstructed from AET data corresponding to a single EIT measurement, and we quantify reconstruction uncertainty through posterior statistics.

math.AP↗

Inhomogeneous Priors for Bayesian Inverse Problems

Many inverse problems arising in engineering and applied sciences involve unknown quantities with pronounced spatial inhomogeneity, such as localized defects or spatially varying material properties, making reliable uncertainty quantification particularly challenging. While Bayesian inverse problem methodologies provide a principled framework for assessing reconstruction reliability, commonly used Gaussian priors, such as Whittle-Matern models, impose globally homogeneous assumptions that limit their ability to capture such structure in large-scale settings. We introduce a new class of inhomogeneous priors defined via convolution with white noise, yielding nonstationary Whittle-Matern-type random fields with a rigorous mathematical construction. These priors fit naturally within existing Bayesian well-posedness theory and enable efficient sampling by reducing prior realizations to the solution of a pseudo-differential equation, for which we develop numerical schemes with quantified approximation error. Numerical experiments in one-dimensional denoising and two-dimensional limited-angle X-ray tomography demonstrate significant improvements in reconstruction quality and uncertainty quantification, particularly in data-limited scenarios.

math.NA↗

Neural Optimal Design of Experiment for Inverse Problems

We introduce Neural Optimal Design of Experiments, a learning-based framework for optimal experimental design in inverse problems that avoids classical bilevel optimization and indirect sparsity regularization. NODE jointly trains a neural reconstruction model and a fixed-budget set of continuous design variables representing sensor locations, sampling times, or measurement angles, within a single optimization loop. By optimizing measurement locations directly rather than weighting a dense grid of candidates, the proposed approach enforces sparsity by design, eliminates the need for l1 tuning, and substantially reduces computational complexity. We validate NODE on an analytically tractable exponential growth benchmark, on MNIST image sampling, and illustrate its effectiveness on a real world sparse view X ray CT example. In all cases, NODE outperforms baseline approaches, demonstrating improved reconstruction accuracy and task-specific performance.

cs.LG↗

Uncertainty Quantification for Linear Inverse Problems with Besov Prior: A Randomize-Then-Optimize Method

In this work, we investigate the use of Besov priors in the context of Bayesian inverse problems. The solution to Bayesian inverse problems is the posterior distribution which naturally enables us to interpret the uncertainties. Besov priors are discretization invariant and can promote sparsity in terms of wavelet coefficients. We propose the randomize-then-optimize method to draw samples from the posterior distribution with Besov priors under a general parameter setting and estimate the modes of the posterior distribution. The performance of the proposed method is studied through numerical experiments of a 1D inpainting problem, a 1D deconvolution problem, and a 2D computed tomography problem. Further, we discuss the influence of the choice of the Besov parameters and the wavelet basis in detail, and we compare the proposed method with the state-of-the-art methods. The numerical results suggest that the proposed method is an effective tool for sampling the posterior distribution equipped with general Besov priors.

math.NA↗

Inferring Object Boundaries and their Roughness with Uncertainty Quantification

This work describes a Bayesian framework for reconstructing the boundaries that represent targeted features in an image, as well as the regularity (i.e., roughness vs. smoothness) of these boundaries.This regularity often carries crucial information in many inverse problem applications, e.g., for identifying malignant tissues in medical imaging. We represent the boundary as a radial function and characterize the regularity of this function by means of its fractional differentiability. We propose a hierarchical Bayesian formulation which, simultaneously, estimates the function and its regularity, and in addition we quantify the uncertainties in the estimates. Numerical results suggest that the proposed method is a reliable approach for estimating and characterizing object boundaries in imaging applications, as illustrated with examples from X-ray CT and image inpainting. We also show that our method is robust under various noise types, noise levels, and incomplete data.

math.NA↗

Goal-oriented Uncertainty Quantification for Inverse Problems via Variational Encoder-Decoder Networks

In this work, we describe a new approach that uses variational encoder-decoder (VED) networks for efficient goal-oriented uncertainty quantification for inverse problems. Contrary to standard inverse problems, these approaches are \emph{goal-oriented} in that the goal is to estimate some quantities of interest (QoI) that are functions of the solution of an inverse problem, rather than the solution itself. Moreover, we are interested in computing uncertainty metrics associated with the QoI, thus utilizing a Bayesian approach for inverse problems that incorporates the prediction operator and techniques for exploring the posterior. This may be particularly challenging, especially for nonlinear, possibly unknown, operators and nonstandard prior assumptions. We harness recent advances in machine learning, i.e., VED networks, to describe a data-driven approach to large-scale inverse problems. This enables a real-time goal-oriented uncertainty quantification for the QoI. One of the advantages of our approach is that we avoid the need to solve challenging inversion problems by training a network to approximate the mapping from observations to QoI. Another main benefit is that we enable uncertainty quantification for the QoI by leveraging probability distributions in the latent space. This allows us to efficiently generate QoI samples and circumvent complicated or even unknown forward models and prediction operators. Numerical results from medical tomography reconstruction and nonlinear hydraulic tomography demonstrate the potential and broad applicability of the approach.

math.NA↗

A Bayesian approach for consistent reconstruction of inclusions

This paper considers a Bayesian approach for inclusion detection in nonlinear inverse problems using two known and popular push-forward prior distributions: the star-shaped and level set prior distributions. We analyze the convergence of the corresponding posterior distributions in a small measurement noise limit. The methodology is general; it works for priors arising from any Hölder continuous transformation of Gaussian random fields and is applicable to a range of inverse problems. The level set and star-shaped prior distributions are examples of push-forward priors under Hölder continuous transformations that take advantage of the structure of inclusion detection problems. We show that the corresponding posterior mean converges to the ground truth in a proper probabilistic sense. Numerical tests on a two-dimensional quantitative photoacoustic tomography problem showcase the approach. The results highlight the convergence properties of the posterior distributions and the ability of the methodology to detect inclusions with sufficiently regular boundaries.

math.ST↗

Uncertainty Quantification of Inclusion Boundaries in the Context of X-ray Tomography

In this work, we describe a Bayesian framework for reconstructing the boundaries of piecewise smooth regions in the X-ray computed tomography (CT) problem in an infinite-dimensional setting. In addition to the reconstruction, we are also able to quantify the uncertainty of the predicted boundaries. Our approach is goal oriented, meaning that we directly detect the discontinuities from the data, instead of reconstructing the entire image. This drastically reduces the dimension of the problem, which makes the application of Markov Chain Monte Carlo (MCMC) methods feasible. We show that our method provides an excellent platform for challenging X-ray CT scenarios (e.g., in case of noisy data, limited angle, or sparse angle imaging). We investigate the performance and accuracy of our method on synthetic data as well as on real-world data. The numerical results indicate that our method provides an accurate method in detecting boundaries of piecewise smooth regions and quantifies the uncertainty in the prediction.

math.NA↗

Learning Regularization Parameters of Inverse Problems via Deep Neural Networks

In this work, we describe a new approach that uses deep neural networks (DNN) to obtain regularization parameters for solving inverse problems. We consider a supervised learning approach, where a network is trained to approximate the mapping from observation data to regularization parameters. Once the network is trained, regularization parameters for newly obtained data can be computed by efficient forward propagation of the DNN. We show that a wide variety of regularization functionals, forward models, and noise models may be considered. The network-obtained regularization parameters can be computed more efficiently and may even lead to more accurate solutions compared to existing regularization parameter selection methods. We emphasize that the key advantage of using DNNs for learning regularization parameters, compared to previous works on learning via optimal experimental design or empirical Bayes risk minimization, is greater generalizability. That is, rather than computing one set of parameters that is optimal with respect to one particular design objective, DNN-computed regularization parameters are tailored to the specific features or properties of the newly observed data. Thus, our approach may better handle cases where the observation is not a close representation of the training set. Furthermore, we avoid the need for expensive and challenging bilevel optimization methods as utilized in other existing training approaches. Numerical results demonstrate the potential of using DNNs to learn regularization parameters.

math.NA↗

Symplectic Model-Reduction with a Weighted Inner Product

In the recent years, considerable attention has been paid to preserving structures and invariants in reduced basis methods, in order to enhance the stability and robustness of the reduced system. In the context of Hamiltonian systems, symplectic model reduction seeks to construct a reduced system that preserves the symplectic symmetry of Hamiltonian systems. However, symplectic methods are based on the standard Euclidean inner products and are not suitable for problems equipped with a more general inner product. In this paper, we generalize symplectic model reduction to allow for the norms and inner products that are most appropriate to the problem while preserving the symplectic symmetry of the Hamiltonian systems. To construct a reduced basis and accelerate the evaluation of nonlinear terms, a greedy generation of a symplectic basis is proposed. Furthermore, it is shown that the greedy approach yields a norm-bounded reduced basis. The accuracy and the stability of this model reduction technique are illustrated through the development of reduced models for a vibrating elastic beam and the sine-Gordon equation.

math.NA↗

Structure-Preserving Model-Reduction of Dissipative Hamiltonian Systems

Reduced basis methods are popular for approximately solving large and complex systems of differential equations. However, conventional reduced basis methods do not generally preserve conservation laws and symmetries of the full order model. Here, we present an approach for reduced model construction, that preserves the symplectic symmetry of dissipative Hamiltonian systems. The method constructs a closed reduced Hamiltonian system by coupling the full model with a canonical heat bath. This allows the reduced system to be integrated with a symplectic integrator, resulting in a correct dissipation of energy, preservation of the total energy and, ultimately, in the stability of the solution. Accuracy and stability of the method are illustrated through the numerical simulation of the dissipative wave equation and a port-Hamiltonian model of an electric circuit.

math.NA↗