Searcharxiv⌕ Search

arXiv subjects

Matti Lassas

Publications and source records attributed to Matti Lassas.

At least 37 records · Page 2Linked to original sources

Numerical reconstruction of Schrödinger equations with quadratic nonlinearities

We introduce a numerical framework for reconstructing the potential in two dimensional semilinear elliptic PDEs with power type nonlinearities from the nonlinear Dirichlet to Neumann map. By applying higher order linearization method, we compute the Fourier data of the unknown potential and then invert it to recover $q$. Numerical experiments show accurate reconstructions for both smooth and discontinuous test cases.

math.NA↗

Extension and neural operator approximation of the electrical impedance tomography inverse map

This paper considers the problem of noise-robust neural operator approximation for the solution map of Calderón's inverse conductivity problem. In this continuum model of electrical impedance tomography (EIT), the boundary measurements are realized as a noisy perturbation of the Neumann-to-Dirichlet map's integral kernel. The theoretical analysis proceeds by extending the domain of the inversion operator to a Hilbert space of kernel functions. The resulting extension shares the same stability properties as the original inverse map from kernels to conductivities, but is now amenable to neural operator approximation. Numerical experiments demonstrate that Fourier neural operators excel at reconstructing infinite-dimensional piecewise constant and lognormal conductivities in noisy setups both within and beyond the theory's assumptions. The methodology developed in this paper for EIT exemplifies a broader strategy for addressing nonlinear inverse problems with a noise-aware operator learning framework.

math.NA↗

An Unconditional Representation of the Conditional Score in Infinite-Dimensional Linear Inverse Problems

Score-based diffusion models (SDMs) have emerged as a powerful tool for sampling from the posterior distribution in Bayesian inverse problems. However, existing methods often require multiple evaluations of the forward mapping to generate a single sample, resulting in significant computational costs for large-scale inverse problems. To address this, we propose an unconditional representation of the conditional score function (UCoS) tailored to linear inverse problems, which avoids forward model evaluations during sampling by shifting computational effort to an offline training phase. In this phase, a \emph{task-dependent} score function is learned based on the linear forward operator. Crucially, we show that the conditional score can be derived \emph{exactly} from a trained (unconditional) score using affine transformations, eliminating the need for conditional score approximations. Our approach is formulated in infinite-dimensional function spaces, making it inherently discretization-invariant. We support this formulation with a rigorous convergence analysis that justifies UCoS beyond any specific discretization. Finally we validate UCoS through high-dimensional computed tomography (CT) and image deblurring experiments, demonstrating both scalability and accuracy.

stat.ML↗

A Hyperbolic Inverse Problem for lower order terms on a closed manifold with disjoint data

We study the unique recovery of time-independent lower order terms appearing in the symmetric first order perturbation of the Riemannian wave equation by sending and measuring waves in disjoint open sets of \textit{a priori} known closed Riemannian manifold. In particular, we show that if the set where we capture the waves satisfies a geometric control condition as well as a certain local symmetry condition for the distance functions, then the aforementioned measurement is sufficient to recover the lower order terms up to the natural gauge. For instance, our result holds if the complement of the receiver set is contained in a simple Riemannian manifold.

math.AP↗

Gaussian beam interactions and inverse source problems for nonlinear wave equations

We study the inverse source problem for the semilinear wave equation \[ (\Box_g + q_1)u + q_2 u^2 = F, \] on a globally hyperbolic Lorentzian manifold. We demonstrate that the coefficients $q_1$ and $q_2$, as well as the source term $F$, can be recovered up to a natural gauge symmetry inherent in the problem from local measurements. Furthermore, if $q_1$ is known, we establish the unique recovery of the source $F$, which is in a striking contrast to inverse source problems for linear equations where unique recovery is not possible. Our results also generalize previous works by eliminating the assumption that $u= 0$ is a solution, and by accommodating quadratic nonlinearities. A key contribution is the development of a calculus for nonlinear interactions of Gaussian beams. This framework provides an explicit representation for waves that correspond to sources involving products of two or more Gaussian beams. We anticipate this calculus will serve as a versatile tool in related problems, offering a concrete alternative to Fourier integral operator methods.

math.AP↗

Transformers through the lens of support-preserving maps between measures

Transformers are deep architectures that define ``in-context maps'' which enable predicting new tokens based on a given set of tokens (such as a prompt in NLP applications or a set of patches for a vision transformer). In previous work, we studied the ability of these architectures to handle an arbitrarily large number of context tokens. To mathematically, uniformly analyze their expressivity, we considered the case that the mappings are conditioned on a context represented by a probability distribution which becomes discrete for a finite number of tokens. Modeling neural networks as maps on probability measures has multiple applications, such as studying Wasserstein regularity, proving generalization bounds and doing a mean-field limit analysis of the dynamics of interacting particles as they go through the network. In this work, we study the question what kind of maps between measures are transformers. We fully characterize the properties of maps between measures that enable these to be represented in terms of in-context maps via a push forward. On the one hand, these include transformers; on the other hand, transformers universally approximate representations with any continuous in-context map. These properties are preserving the cardinality of support and that the regular part of their Fréchet derivative is uniformly continuous. Moreover, we show that the solution map of the Vlasov equation, which is of nonlocal transport type, for interacting particle systems in the mean-field regime for the Cauchy problem satisfies the conditions on the one hand and, hence, can be approximated by a transformer; on the other hand, we prove that the measure-theoretic self-attention has the properties that ensure that the infinite depth, mean-field measure-theoretic transformer can be identified with a Vlasov flow.

cs.CL↗

An inverse problem for the Standard Model of particle physics

We pose and solve an inverse problem for the classical field equations that arise in the Standard Model of particle physics. Our main result describes natural conditions on the representations, so that it is possible to recover all the fields from measurements in a small set within a causal domain in Minkowski space. These conditions are satisfied for the representations arising in the Standard Model.

math.AP↗

Reconstruction and interpolation of manifolds II: Inverse problems with partial data for distances observations and for the heat kernel

We consider how a closed Riemannian manifold $M$ and its metric tensor $g$ can be approximately reconstructed from local distance measurements. Moreover, we consider an inverse problem of determining $(M,g)$ from limited knowledge on the heat kernel. In the part 1 of the paper, we considered the approximate construction of a smooth manifold in the case when one is given the noisy distances $\tilde d(x,y)=d(x,y)+\varepsilon_{x,y}$ for all points $x,y\in X$, where $X$ is a $δ$-dense subset of $M$ and $|\varepsilon_{x,y}|<δ$. In this part 2 of the paper, we consider a similar problem with partial data, that is, the approximate construction of the manifold $(M,g)$ when we are given $\tilde d(x,y)$ for $x\in X$ and $y \in U\cap X$, where $U$ is an open subset of $M$. In addition, we consider the inverse problem of determining the manifold $(M,g)$ with non-negative Ricci curvature from noisy observations of the heat kernel $G(y,z,t)$. We show that a manifold approximating $(M,g)$ can be determined in a stable way, when for some unknown source points $z_j$ in $X\setminus U$, we are given the values of the heat kernel $G(y,z_k,t)$ for $y\in X\cap U$ and $t\in (0,1)$ with a multiplicative noise. We also give a uniqueness result for the inverse problem in the case when the data does not contain noise and consider applications in manifold learning. A novel feature of the inverse problem for the heat kernel is that the set $M\setminus U$ containing the sources and the observation set $U$ are disjoint.

math.DG↗

Reconstruction of anisotropic stiffness tensors from partial data around one polarization

We study inverse problems in anisotropic elasticity using tools from algebraic geometry. The singularities of solutions to the elastic wave equation in dimension $n$ with an anisotropic stiffness tensor have propagation kinematics captured by so-called slowness surfaces, which are hypersurfaces in the cotangent bundle of $\mathbb{R}^n$ that turn out to be algebraic varieties. Leveraging the algebraic geometry of families of slowness surfaces we show that, for tensors in a dense open subset in a space of anisotropic two-dimensional stiffness tensors, a small amount of data around one polarization in an individual slowness surface uniquely determines the entire slowness surface and its stiffness tensor. In three dimensions, for generic orthorhombic and monoclinic stiffness tensors, a small number of anomalous companions give rise to the same slowness surface; nevertheless, we conjecture that in the most anisotropic setting (triclinic) the tensor is unique, as in two dimensions. The partial data needed to determine a tensor arises naturally from seismological measurements or geometrized versions of seismic inverse problems. Additionally, we explain how the reconstruction of the stiffness tensor can be carried out effectively, using Gröbner bases. Our uniqueness or finiteness results fail for symmetric materials (e.g., fully isotropic), evidencing the counterintuitive claim that inverse problems in elasticity can become more tractable with increasing asymmetry.

math.DG↗

An inverse Signorini obstacle problem

We study the inverse problem of determining a Signorini obstacle from boundary measurements for the isotropic elasticity system. We prove that the obstacle can be uniquely determined by a single measurement of displacement and normal stress for the Signorini problem on an open subset of the boundary up to a natural obstruction. In addition to considering the Signorini problem, we develop techniques that can be used to study inverse problems for general differential inequalities.

math.AP↗

Introduction to inverse problems for non-linear partial differential equations

We consider inverse problems for non-linear hyperbolic and elliptic equations and give an introduction to the method based on the multiple linearization, or on the construction of artificial sources, to solve these problems. The method is based on self-interaction of linearized waves or other solutions in the presence of non-linearities. Multiple linearization has successfully been used to solve inverse problems for non-linear equation which are still unsolved for the corresponding linear equations.

math.AP↗

Reconstruction along a geodesic from sphere data in Finsler geometry and anisotropic elasticity

Dix formulated the inverse problem of recovering an elastic body from the measurements of wave fronts of point sources. We geometrize this problem in the context of seismology, leading to the geometrical inverse problem of recovering a Finsler manifold from certain sphere data in a given open subset of the manifold. We solve this problem locally along any geodesic through the measurement set.

math.DG↗

Semialgebraic Neural Networks: From roots to representations

Many numerical algorithms in scientific computing -- particularly in areas like numerical linear algebra, PDE simulation, and inverse problems -- produce outputs that can be represented by semialgebraic functions; that is, the graph of the computed function can be described by finitely many polynomial equalities and inequalities. In this work, we introduce Semialgebraic Neural Networks (SANNs), a neural network architecture capable of representing any bounded semialgebraic function, and computing such functions up to the accuracy of a numerical ODE solver chosen by the programmer. Conceptually, we encode the graph of the learned function as the kernel of a piecewise polynomial selected from a class of functions whose roots can be evaluated using a particular homotopy continuation method. We show by construction that the SANN architecture is able to execute this continuation method, thus evaluating the learned semialgebraic function. Furthermore, the architecture can exactly represent even discontinuous semialgebraic functions by executing a continuation method on each connected component of the target function. Lastly, we provide example applications of these networks and show they can be trained with traditional deep-learning techniques.

cs.LG↗

Stroke classification using Virtual Hybrid Edge Detection from in silico electrical impedance tomography data

Electrical impedance tomography (EIT) is a non-invasive imaging method for recovering the internal conductivity of a physical body from electric boundary measurements. EIT combined with machine learning has shown promise for the classification of strokes. However, most previous works have used raw EIT voltage data as network inputs. We build upon a recent development which suggested the use of special noise-robust Virtual Hybrid Edge Detection (VHED) functions as network inputs, although that work used only highly simplified and mathematically ideal models. In this work we strengthen the case for the use of EIT, and VHED functions especially, for stroke classification. We design models with high detail and mathematical realism to test the use of VHED functions as inputs. Virtual patients are created using a physically detailed 2D head model which includes features known to create challenges in real-world imaging scenarios. Conductivity values are drawn from statistically realistic distributions, and phantoms are afflicted with either hemorrhagic or ischemic strokes of various shapes and sizes. Simulated noisy EIT electrode data, generated using the realistic Complete Electrode Model (CEM) as opposed to the mathematically ideal continuum model, is processed to obtain VHED functions. We compare the use of VHED functions as inputs against the alternative paradigm of using raw EIT voltages. Our results show that (i) stroke classification can be performed with high accuracy using 2D EIT data from physically detailed and mathematically realistic models, and (ii) in the presence of noise, VHED functions outperform raw data as network inputs.

math.AP↗

Inverse scattering problems for non-linear wave equations on Lorentzian manifolds

We show that an inverse scattering problem for a semilinear wave equation can be solved on a manifold having an asymptotically Minkowskian infinity, that is, scattering functionals determine the topology, differentiable structure, and the conformal type of the manifold. Moreover, the metric and the coefficient of the non-linearity are determined up to a multiplicative transformation. The manifold on which the inverse problem is considered is allowed to be an open, globally hyperbolic manifold which may have non-trivial topology or several infinities (i.e., ends) of which at least one has to be of the asymptotically Minkowskian type. To formulate the inverse problems we define a new type of data, non-linear scattering functionals, which are defined also in the cases where the classically defined scattering operators are not well-defined. This makes it possible to solve inverse problems also in cases where some of the incoming waves lead to a blow-up of the scattered solution. We use non-linear interaction of waves as a beneficial tool that helps to solve the inverse problem. The corresponding inverse problem for the linear wave equation still remains unsolved.

math.AP↗

Can neural operators always be continuously discretized?

We consider the problem of discretization of neural operators between Hilbert spaces in a general framework including skip connections. We focus on bijective neural operators through the lens of diffeomorphisms in infinite dimensions. Framed using category theory, we give a no-go theorem that shows that diffeomorphisms between Hilbert spaces or Hilbert manifolds may not admit any continuous approximations by diffeomorphisms on finite-dimensional spaces, even if the approximations are nonlinear. The natural way out is the introduction of strongly monotone diffeomorphisms and layerwise strongly monotone neural operators which have continuous approximations by strongly monotone diffeomorphisms on finite-dimensional spaces. For these, one can guarantee discretization invariance, while ensuring that finite-dimensional approximations converge not only as sequences of functions, but that their representations converge in a suitable sense as well. Finally, we show that bilipschitz neural operators may always be written in the form of an alternating composition of strongly monotone neural operators, plus a simple isometry. Thus we realize a rigorous platform for discretization of a generalization of a neural operator. We also show that neural operators of this type may be approximated through the composition of finite-rank residual neural operators, where each block is strongly monotone, and may be inverted locally via iteration. We conclude by providing a quantitative approximation result for the discretization of general bilipschitz neural operators.

cs.LG↗

Lipschitz Stability of Travel Time Data

We prove that the reconstruction of a certain type of length spaces from their travel time data on a closed subset is Lipschitz stable. The travel time data is the set of distance functions from the entire space, measured on the chosen closed subset. The case of a Riemannian manifold with boundary with the boundary as the measurement set appears is a classical geometric inverse problem arising from Gel'fand's inverse boundary spectral problem. Examples of spaces satisfying our assumptions include some non-simple Riemannian manifolds, Euclidean domains with non-trivial topology, and metric trees.

math.MG↗

Coefficient Determination for Non-Linear Schrödinger Equations on manifolds

We consider an inverse problem of recovering the unknown coefficients $β(t,x)$ and $V(t,x)$ appearing in a time-dependent nonlinear Schrödinger equation $ (\mathrm{i} \partial_t +Δ+V)u + βu^2=0$ in $(0,T) \times M$, on Euclidean geometry as well as on Riemannian geometry. We consider measurements in $Ω\subset M$ that is a neighborhood of the boundary of $M$ and the source-to-solution map $ L_{β, V}$ that maps a source $f$ supported in $ Ω\times (0,T) $ to the restriction of the solution $u$ in $ Ω\times (0,T) $. We show that the map $L_{β, V}$ uniquely determines the time-dependent potential and the coefficient of the non-linearity, for the above non-linear Schrödinger equation and for the Gross-Pitaevskii equation, with a cubic non-linear term $β|u|^2 \, u$, that is encountered in quantum physics.

math.AP↗