arXiv subjects

Tapio Helin

Publications and source records attributed to Tapio Helin.

At least 37 records · Page 2Linked to original sources

arXiv2023

Statistical inverse learning problems with random observations

We provide an overview of recent progress in statistical inverse problems with random experimental design, covering both linear and nonlinear inverse problems. Different regularization schemes have been studied to produce robust and stable solutions. We discuss recent results in spectral regularization methods and regularization by projection, exploring both approaches within the context of Hilbert scales and presenting new insights particularly in regularization by projection. Additionally, we overview recent advancements in regularization using convex penalties. Convergence rates are analyzed in terms of the sample size in a probabilistic sense, yielding minimax rates in both expectation and probability. To achieve these results, the structure of reproducing kernel Hilbert spaces is leveraged to establish minimax rates in the statistical learning setting. We detail the assumptions underpinning these key elements of our proofs. Finally, we demonstrate the application of these concepts to nonlinear inverse problems in pharmacokinetic/pharmacodynamic (PK/PD) models, where the task is to predict changes in drug concentrations in patients.

math.ST↗

arXiv2023

Stability estimates for the expected utility in Bayesian optimal experimental design

We study stability properties of the expected utility function in Bayesian optimal experimental design. We provide a framework for this problem in a non-parametric setting and prove a convergence rate of the expected utility with respect to a likelihood perturbation. This rate is uniform over the design space and its sharpness in the general setting is demonstrated by proving a lower bound in a special case. To make the problem more concrete we proceed by considering non-linear Bayesian inverse problems with Gaussian likelihood and prove that the assumptions set out for the general case are satisfied and regain the stability of the expected utility with respect to perturbations to the observation map. Theoretical convergence rates are demonstrated numerically in three different examples.

math.ST↗

arXiv2023

Bayesian design of measurements for magnetorelaxometry imaging

The aim of magnetorelaxometry imaging is to determine the distribution of magnetic nanoparticles inside a subject by measuring the relaxation of the superposition magnetic field generated by the nanoparticles after they have first been aligned using an external activation magnetic field that has subsequently been switched off. This work applies techniques of Bayesian optimal experimental design to (sequentially) selecting the positions for the activation coil in order to increase the value of data and enable more accurate reconstructions in a simplified measurement setup. Both Gaussian and total variation prior models are considered for the distribution of the nanoparticles. The former allows simultaneous offline computation of optimized designs for multiple consecutive activations, while the latter introduces adaptability into the algorithm by using previously measured data in choosing the position of the next activation. The total variation prior has a desirable edge-enhancing characteristic, but with the downside that the computationally attractive Gaussian form of the posterior density is lost. To overcome this challenge, the lagged diffusivity iteration is used to provide an approximate Gaussian posterior model and allow the use of the standard Bayesian A- and D-optimality criteria for the total variation prior as well. Two-dimensional numerical experiments are performed on a few sample targets, with the conclusion that the optimized activation positions lead, in general, to better reconstructions than symmetric reference setups when the target distribution or region of interest are nonsymmetric in shape.

math.NA↗

arXiv2023

Bayesian Posterior Perturbation Analysis with Integral Probability Metrics

In recent years, Bayesian inference in large-scale inverse problems found in science, engineering and machine learning has gained significant attention. This paper examines the robustness of the Bayesian approach by analyzing the stability of posterior measures in relation to perturbations in the likelihood potential and the prior measure. We present new stability results using a family of integral probability metrics (divergences) akin to dual problems that arise in optimal transport. Our results stand out from previous works in three directions: (1) We construct new families of integral probability metrics that are adapted to the problem at hand; (2) These new metrics allow us to study both likelihood and prior perturbations in a convenient way; and (3) our analysis accommodates likelihood potentials that are only locally Lipschitz, making them applicable to a wide range of nonlinear inverse problems. Our theoretical findings are further reinforced through specific and novel examples where the approximation rates of posterior measures are obtained for different types of perturbations and provide a path towards the convergence analysis of recently adapted machine learning techniques for Bayesian inverse problems such as data-driven priors and neural network surrogates.

stat.ML↗

arXiv2023

Introduction To Gaussian Process Regression In Bayesian Inverse Problems, With New ResultsOn Experimental Design For Weighted Error Measures

Bayesian posterior distributions arising in modern applications, including inverse problems in partial differential equation models in tomography and subsurface flow, are often computationally intractable due to the large computational cost of evaluating the data likelihood. To alleviate this problem, we consider using Gaussian process regression to build a surrogate model for the likelihood, resulting in an approximate posterior distribution that is amenable to computations in practice. This work serves as an introduction to Gaussian process regression, in particular in the context of building surrogate models for inverse problems, and presents new insights into a suitable choice of training points. We show that the error between the true and approximate posterior distribution can be bounded by the error between the true and approximate likelihood, measured in the $L^2$-norm weighted by the true posterior, and that efficiently bounding the error between the true and approximate likelihood in this norm suggests choosing the training points in the Gaussian process surrogate model based on the true posterior.

stat.ML↗

arXiv2022

Status of the PSF Reconstruction Work Package for MICADO ELT

MICADO is a workhorse instrument for the ESO ELT, allowing first light capability for diffraction limited imaging and long-slit spectroscopy at near-infrared wavelengths. The PSF Reconstruction (PSF-R) Team of MICADO is currently implementing, for the first time within all ESO telescopes, a software service devoted to the blind reconstruction of the PSF. This tool will work independently of the science data, using adaptive optics telemetry data, both for Single Conjugate (SCAO) and Multi-Conjugate Adaptive Optics (MCAO) allowed by the MORFEO module. The PSF-R service will support the state-of-the-art post-processing scientific analysis of the MICADO imaging and spectroscopic data. We provide here an update of the status of the PSF-R service tool of MICADO, after successfully fulfilling the Final Design Review phase, and discuss recent results obtained on simulated and real data gathered on instruments similar to MICADO.

astro-ph.IM↗

arXiv2022

LBT SOUL data as a science test bench for MICADO PSF-R tool

Current state-of-the-art adaptive optics (AO) provides ground-based, diffraction-limited observations with high Strehl ratios (SR). However, a detailed knowledge of the point spread function (PSF) is required to fully exploit the scientific potential of these data. This is even more crucial for the next generation AO instruments that will equip 30-meter class telescopes, as the characterization of the PSF will be mandatory to fulfill the planned scientific requirements. For this reason, there is a growing interest in developing tools that accurately reconstruct the observed PSF of AO systems, the so-called PSF reconstruction. In this context, a PSF-R service is a planned deliverable for the MICADO@ELT instrument and our group is in charge of its development. In the case of MICADO, a blind PSF-R approach is being pursued to have the widest applicability to science cases. This means that the PSF is reconstructed without extracting information from the science data, relying only on telemetry and calibrations. While our PSF-R algorithm is currently being developed, its implementation is mature enough to test performances with actual observations. In this presentation we will discuss the reliability of our reconstructed PSFs and the uncertainties introduced in the measurements of scientific quantities for bright, on-axis observations taken with the SOUL+LUCI instrument of the LBT. This is the first application of our algorithm to real data. It demonstrates its readiness level and paves the way to further testing. Our PSF-R algorithm is able to reconstruct the SR and full-width at half maximum of the observed PSFs with errors smaller than 2% and 4.5%, respectively. We carried out the scientific evaluation of the obtained reconstructed PSFs thanks to a dedicated set of simulated observations of an ideal science case.

astro-ph.IM↗

arXiv2022

Point spread function reconstruction for SOUL+LUCI LBT data

This paper presents the status of an ongoing project aimed at developing a PSF reconstruction software for adaptive optics (AO) observations. In particular, we test for the first time the implementation of pyramid wave-front sensor data on our algorithms. As a first step in assessing its reliability, we applied the software to bright, on-axis, point-like sources using two independent sets of observations, acquired with the single-conjugated AO upgrade for the Large Binocular Telescope. Using only telemetry data, we reconstructed the PSF by carefully calibrating the instrument response. The accuracy of the results has been first evaluated using the classical metric: specifically, the reconstructed PSFs differ from the observed ones by less than 2% in Strehl ratio and 4.5% in full-width at half maximum. Moreover, the recovered encircled energy associated with the PSF core is accurate at 4% level in the worst case. The accuracy of the reconstructed PSFs has then been evaluated by considering an idealized scientific test-case consisting in the measurements of the morphological parameters of a compact galaxy. In the future, our project will include the analysis of anisoplanatism, low SNR regimes, and the application to multi-conjugated AO observations.

astro-ph.IM↗

arXiv2021

Convex regularization in statistical inverse learning problems

We consider a statistical inverse learning problem, where the task is to estimate a function $f$ based on noisy point evaluations of $Af$, where $A$ is a linear operator. The function $Af$ is evaluated at i.i.d. random design points $u_n$, $n=1,...,N$ generated by an unknown general probability distribution. We consider Tikhonov regularization with general convex and $p$-homogeneous penalty functionals and derive concentration rates of the regularized solution to the ground truth measured in the symmetric Bregman distance induced by the penalty functional. We derive concrete rates for Besov norm penalties and numerically demonstrate the correspondence with the observed rates in the context of X-ray tomography.

stat.ML↗

arXiv2021

Non-asymptotic error estimates for the Laplace approximation in Bayesian inverse problems

In this paper we study properties of the Laplace approximation of the posterior distribution arising in nonlinear Bayesian inverse problems. Our work is motivated by Schillings et al. (2020), where it is shown that in such a setting the Laplace approximation error in Hellinger distance converges to zero in the order of the noise level. Here, we prove novel error estimates for a given noise level that also quantify the effect due to the nonlinearity of the forward mapping and the dimension of the problem. In particular, we are interested in settings in which a linear forward mapping is perturbed by a small nonlinear mapping. Our results indicate that in this case, the Laplace approximation error is of the size of the perturbation. The paper provides insight into Bayesian inference in nonlinear inverse problems, where linearization of the forward mapping has suitable approximation properties.

math.NA↗

arXiv2021

Adaptive Optics control using Model-Based Reinforcement Learning

Reinforcement Learning (RL) presents a new approach for controlling Adaptive Optics (AO) systems for Astronomy. It promises to effectively cope with some aspects often hampering AO performance such as temporal delay or calibration errors. We formulate the AO control loop as a model-based RL problem (MBRL) and apply it in numerical simulations to a simple Shack-Hartmann Sensor (SHS) based AO system with 24 resolution elements across the aperture. The simulations show that MBRL controlled AO predicts the temporal evolution of turbulence and adjusts to mis-registration between deformable mirror and SHS which is a typical calibration issue in AO. The method learns continuously on timescales of some seconds and is therefore capable of automatically adjusting to changing conditions.

astro-ph.IM↗

arXiv2021

Edge-promoting adaptive Bayesian experimental design for X-ray imaging

This work considers sequential edge-promoting Bayesian experimental design for (discretized) linear inverse problems, exemplified by X-ray tomography. The process of computing a total variation type reconstruction of the absorption inside the imaged body via lagged diffusivity iteration is interpreted in the Bayesian framework. Assuming a Gaussian additive noise model, this leads to an approximate Gaussian posterior with a covariance structure that contains information on the location of edges in the posterior mean. The next projection geometry is then chosen through A-optimal Bayesian design, which corresponds to minimizing the trace of the updated posterior covariance matrix that accounts for the new projection. Two and three-dimensional numerical examples based on simulated data demonstrate the functionality of the introduced approach.

stat.ME↗

arXiv2021

PCS -- A Roadmap for Exoearth Imaging with the ELT

The Planetary Camera and Spectrograph (PCS) for the Extremely Large Telescope (ELT) will be dedicated to detecting and characterising nearby exoplanets with sizes from sub-Neptune to Earth-size in the neighbourhood of the Sun. This goal is achieved by a combination of eXtreme Adaptive Optics (XAO), coronagraphy and spectroscopy. PCS will allow us not only to take images, but also to look for biosignatures such as molecular oxygen in the exoplanets' atmospheres. This article describes the PCS primary science goals, the instrument concept and the research and development activities that will be carried out over the coming years.

astro-ph.IM↗

arXiv2020

MICADO PSF-Reconstruction work package description

The point spread function reconstruction (PSF-R) capability is a deliverable of the MICADO@ESO-ELT project. The PSF-R team works on the implementation of the instrument software devoted to reconstruct the point spread function (PSF), independently of the science data, using adaptive optics (AO) telemetry data, both for Single Conjugate (SCAO) and Multi-Conjugate Adaptive Optics (MCAO) mode of the MICADO camera and spectrograph. The PSF-R application will provide reconstructed PSFs through an archive querying system to restore the telemetry data synchronous to each science frame that MICADO will generate. Eventually, the PSF-R software will produce the output according to user specifications. The PSF-R service will support the state-of-the-art scientific analysis of the MICADO imaging and spectroscopic data.

astro-ph.IM↗

arXiv2020

Rates of contraction of posterior distributions based on $p$-exponential priors

We consider a family of infinite dimensional product measures with tails between Gaussian and exponential, which we call $p$-exponential measures. We study their measure-theoretic properties and in particular their concentration. Our findings are used to develop a general contraction theory of posterior distributions on nonparametric models with $p$-exponential priors in separable Banach parameter spaces. Our approach builds on the general contraction theory for Gaussian process priors in van der Vaart and van Zanten 2008, namely we use prior concentration to verify prior mass and entropy conditions sufficient for posterior contraction. However, the specific concentration properties of $p$-exponential priors lead to a more complex entropy bound which can influence negatively the obtained rate of contraction, depending on the topology of the parameter space. Subject to the more complex entropy bound, we show that the rate of contraction depends on the position of the true parameter relative to a certain Banach space associated to $p$-exponential measures and on the small ball probabilities of these measures. For example, we apply our theory in the white noise model under Besov regularity of the truth and obtain minimax rates of contraction using (rescaled) $α$-regular $p$-exponential priors. In particular, our results suggest that when interested in spatially inhomogeneous unknown functions, in terms of posterior contraction, it is preferable to use Laplace rather than Gaussian priors.

math.ST↗

arXiv2020

Fuel rod classification from Passive Gamma Emission Tomography (PGET) of spent nuclear fuel assemblies

Safeguarding the disposal of spent nuclear fuel in a geological repository needs an effective, efficient, reliable and robust non-destructive assay (NDA) system to ensure the integrity of the fuel prior to disposal. In the context of the Finnish geological repository, Passive Gamma Emission Tomography (PGET) will be a part of such an NDA system. We report here on the results of PGET measurements at the Finnish nuclear power plants during the years 2017-2020. Gamma activity profiles are recorded from all angles by rotating the detector arrays around the fuel assembly that has been inserted into the center of the torus. Image reconstruction from the resulting tomographic data is defined as a constrained minimization problem with a data fidelity term and regularization terms. The activity and attenuation maps, as well as detector sensitivity corrections, are the variables in the minimization process. The regularization terms ensure that prior information on the (possible) locations of fuel rods and their diameter are taken into account. Fuel rod classification, the main purpose of the PGET method, is based on the difference of the activity of a fuel rod from its immediate neighbors, taking into account its distance from the assembly center. The classification is carried out by a support vector machine. We report on the results for ten different fuel types with burnups between 5.72 and 55.0 GWd/tU, cooling times between 1.87 and 34.6 years and initial enrichments between 1.9 and 4.4%. For all fuel assemblies measured, missing fuel rods, partial fuel rods and water channels were correctly classified. Burnable absorber fuel rods were classified as fuel rods. On rare occasions, a fuel rod that is present was falsely classified as missing. We conclude that the combination of the PGET device and our image reconstruction method provides a reliable base for fuel rod classification.

physics.ins-det↗

arXiv2020

Sequentially optimized projections in X-ray imaging

This work applies Bayesian experimental design to selecting optimal projection geometries in (discretized) parallel beam X-ray tomography assuming the prior and the additive noise are Gaussian. The introduced greedy exhaustive optimization algorithm proceeds sequentially, with the posterior distribution corresponding to the previous projections serving as the prior for determining the design parameters, i.e. the imaging angle and the lateral position of the source-receiver pair, for the next one. The algorithm allows redefining the region of interest after each projection as well as adapting parameters in the (original) prior to the measured data. Both A and D-optimality are considered, with emphasis on efficient evaluation of the corresponding objective functions. Two-dimensional numerical experiments demonstrate the functionality of the approach.

math.NA↗

arXiv2019

Hyperparameter Estimation in Bayesian MAP Estimation: Parameterizations and Consistency

The Bayesian formulation of inverse problems is attractive for three primary reasons: it provides a clear modelling framework; means for uncertainty quantification; and it allows for principled learning of hyperparameters. The posterior distribution may be explored by sampling methods, but for many problems it is computationally infeasible to do so. In this situation maximum a posteriori (MAP) estimators are often sought. Whilst these are relatively cheap to compute, and have an attractive variational formulation, a key drawback is their lack of invariance under change of parameterization. This is a particularly significant issue when hierarchical priors are employed to learn hyperparameters. In this paper we study the effect of the choice of parameterization on MAP estimators when a conditionally Gaussian hierarchical prior distribution is employed. Specifically we consider the centred parameterization, the natural parameterization in which the unknown state is solved for directly, and the noncentred parameterization, which works with a whitened Gaussian as the unknown state variable, and arises when considering dimension-robust MCMC algorithms; MAP estimation is well-defined in the nonparametric setting only for the noncentred parameterization. However, we show that MAP estimates based on the noncentred parameterization are not consistent as estimators of hyperparameters; conversely, we show that limits of finite-dimensional centred MAP estimators are consistent as the dimension tends to infinity. We also consider empirical Bayesian hyperparameter estimation, show consistency of these estimates, and demonstrate that they are more robust with respect to noise than centred MAP estimates. An underpinning concept throughout is that hyperparameters may only be recovered up to measure equivalence, a well-known phenomenon in the context of the Ornstein-Uhlenbeck process.

math.ST↗