arXiv subjects

Leila Taghizadeh

Publications and source records attributed to Leila Taghizadeh.

6 recordsLinked to original sources

arXiv2026

Score-based diffusion models for severely ill-posed problems in diffuse optical tomography

Score-based diffusion models are a recently developed framework for posterior sampling in Bayesian inverse problems, enabling high-quality reconstructions in inverse problems by leveraging expressive prior distributions learned from empirical data. Despite their strong empirical performance and growing interest within the machine learning community, their behaviour in realistic, severely ill-posed inverse problems with experimental measurement data remains under-explored. Diffuse optical tomography (DOT) is an inverse boundary value problem that uses boundary measurements of near-infrared light to recover spatially varying absorption and scattering parameters in biological tissue. The problem is highly ill-posed and particularly sensitive to both measurement noise and modelling errors. We introduce a regularization strategy by constructing a mixed score consisting of a learned component and a model-based component. We show that the resulting mixed score approximates the score of a corresponding mixture distribution locally and in the small diffusion-time regime, providing a theoretical justification for the approach. We compare four approaches for difference imaging in DOT: a classical model-based method, an approximate score-based diffusion method (DPS), an exact posterior sampling method (UCoS) and a novel, regularized version of UCoS. We show that both the model-based approach and approximate diffusion-based sampling degrade significantly in the presence of limited-view geometry and real experimental data, whereas UCoS yields more accurate reconstructions.

stat.ML↗

arXiv2026

A Convex Approximation Framework for Neural Likelihood-Based Bayesian Inverse Problems

Many problems in science and engineering are difficult to model accurately, either due to unknown physical mechanisms, poorly quantified measurement uncertainty, or prohibitive computational costs of high-fidelity simulations. These challenges limit the applicability of classical probabilistic inference methods such as Markov chain Monte Carlo, especially in high-dimensional Bayesian inverse problems. As data from scientific experiments become increasingly available, machine learning methods offer a flexible alternative to explicit parametric modelling. We study neural likelihood approximation, where the goal is to learn the likelihood function directly from data without explicit knowledge of the underlying data-generating process. A common approach trains likelihood surrogates by minimizing the Kullback-Leibler divergence between the true posterior and an approximate posterior, which is equivalent to minimizing the expected negative log-likelihood. This work improves the theoretical foundations of neural likelihood approximation by alleviating limitations of restrictive model classes: we show that, by working with un-normalized potentials and folding normalization into the training objective, the resulting learning problem is strictly convex. We show that empirical minimizers of the resulting data-driven objective converge to the true likelihood as the sample size grows. Numerical experiments for the neural likelihood approximation are conducted for a deblurring and a non-linear PDE based imaging problem.

stat.ML↗

arXiv2026

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↗

arXiv2026

Post-Quantum Discovery as a Governance Capability: Evidence-Based Cryptographic Visibility and Exposure Prioritisation in a Critical Service Provider

Post Quantum Cryptography (PQC) readiness is increasingly constrained not by algorithm availability, but by cryptographic visibility, dependency complexity, and fragmented governance. This paper presents an anonymised case study of a large European critical service provider that initiated PQC readiness through a discovery first strategy, utilizing tool supported cryptographic inventorying to establish an evidence based baseline prior to migration planning. The discovery phase revealed systemic challenges, including distributed cryptographic ownership, uneven evidence quality across legacy and modern environments, and high dependency on third party cryptographic roadmaps. To operationalise these findings, the organisation introduced a structured exposure register that enabled prioritisation based on asset criticality, confidentiality longevity, and migration feasibility. We argue that PQC discovery should be understood as a governance capability that stabilises organisational knowledge and converts cryptographic uncertainty into measurable accountability, supporting risk based decision making and ecosystem coordination. The results contribute actionable lessons for institutions pursuing crypto-agility and resilience under post quantum harvest now, decrypt later threat models.

cs.CR↗

arXiv2024

Bayesian inversion for the identification of the doping profile in unipolar semiconductor devices

A rigorous Bayesian formulation of the inverse doping profile problem in infinite dimensions for a stationary linearized unipolar drift-diffusion model for semiconductor devices is given. The goal is to estimate the posterior probability distribution of the doping profile and to compute its posterior mean. This allows for the reconstruction of the doping profile from voltage-current measurements. The well-posedness of the Bayesian inverse problem is shown by proving boundedness and continuity properties of the semiconductor model with respect to the unknown parameter. A preconditioned Crank-Nicolson Markov chain Monte-Carlo method for the Bayesian estimation of the doping profile, using a physics-informed prior model, is proposed. The numerical results for a two-dimensional diode illustrate the efficiency of the proposed approach.

math.NA↗

arXiv2016

The optimal multilevel Monte-Carlo approximation of the stochastic drift-diffusion-Poisson system

Existence and local-uniqueness theorems for weak solutions of a system consisting of the drift-diffusion-Poisson equations and the Poisson-Boltzmann equation, all with stochastic coefficients, are presented. For the numerical approximation of the expected value of the solution of the system, we develop a multi-level Monte-Carlo (MLMC) finite-element method (FEM) and we analyze its rate of convergence and its computational complexity. This allows to find the optimal choice of discretization parameters. Finally, numerical results show the efficiency of the method. Applications are, among others, noise and fluctuations in nanoscale transistors, in field-effect bio- and gas sensors, and in nanopores.

math.AP↗