For a bounded linear operator acting between Banach spaces, its metric generalized inverse is the analog to the prominent Moore-Penrose inverse for operators acting between Hilbert spaces. This generalized inverse is well-defined for Banach spaces that are strictly convex and reflexive. Previous studies had been restricted to closed range situations, where the metric generalized inverse constitutes a continuous homogeneous mapping. The focus of the present study is on the ill-posed situation in the sense of Nashed, when the governing operator has a non-closed range. We define and analyze iterative schemes as the Landweber and the Schulz-Newton method, as well as parametric schemes with focus on a specific Tikhonov method. Both types are called regularizations aimed at approximating the metric generalized inverse. As a fundamental feature of such schemes we observe a dichotomy. This emphasizes that these schemes, when applied to elements of the domain of the metric generalized inverse, approximate the corresponding best approximate solutions well, whereas the resulting approximations will be asymptotically unbounded if they are applied to elements that do not belong to the domain of the metric generalized inverse.

The difficulty for solving ill-posed linear operator equations in Hilbert space is reflected by the strength of ill-posedness of the governing operator, and the inherent solution smoothness. In this study we focus on the ill-posedness of the operator, and we propose a partial ordering for the class of all bounded linear operators which lead to ill-posed operator equations. For compact linear operators, there is a simple characterization in terms of the decay rates of the singular values. In the context of the validity of the spectral theorem the partial ordering can also be understood. We highlight that range inclusions yield partial ordering, and we discuss cases when compositions of compact and non-compact operators occur. Several examples complement the theoretical results.

Spectral Barron spaces, which quantify the absolute value of weighted Fourier coefficients of a function, have gained considerable attention due to their capability for universal approximation across certain function classes. By establishing a connection between these spaces and a specific positive linear operator, we investigate the interpolation and scaling relationships among diverse spectral Barron spaces. Furthermore, we introduce a link condition by relating the spectral Barron space to inverse problems, illustrating this with three exemplary cases. We revisit the notion of universal approximation within the context of spectral Barron spaces and validate an error bound for Tikhonov regularization, penalized by the spectral Barron norm.

In recent years error bounds for Tikhonov regularization of linear and non-linear ill-posed problems with oversmoothing penalty received attention. Here, oversmoothing means, that the exact solution does not admit a finite value for the used penalty. This problem was initiated by F. Natterer in "Error bounds for Tikhonov regularization in Hilbert scales". Applicable Anal., 18(1-2):29-37, 1984. In this note we discuss the application of distance functions to derive order optimal error bounds. We specify these bounds in case that the smoothness is given in terms of source conditions.

We introduce a notion of tractability for ill-posed operator equations in Hilbert space. For such operator equations the asymptotics of the best possible rate of reconstruction in terms of the underlying noise level is known in many cases. However, the relevant question is, which level of discretization, again driven by the noise level, is required in order to achieve this best possible accuracy. The proposed concept adapts the one from Information-based Complexity. Several examples indicate the relevance of this concept in the light of the curse of dimensionality.

We study linear ill-posed inverse problems with noisy data in the framework of statistical learning. The corresponding linear operator equation is assumed to fit a given Hilbert scale, generated by some unbounded self-adjoint operator. Approximate reconstructions from random noisy data are obtained with general regularization schemes in such a way that these belong to the domain of the generator. The analysis has thus to distinguish two cases, the regular one, when the true solution also belongs to the domain of the generator, and the 'oversmoothing' one, when this is not the case. Rates of convergence for the regularized solutions will be expressed in terms of certain distance functions. For solutions with smoothness given in terms of source conditions with respect to the scale generating operator, then the error bounds can then be made explicit in terms of the sample size.

We investigate the use of two-layer networks with the rectified power unit, which is called the ReLU^k activation function, for function and derivative approximation. By extending and calibrating the corresponding Barron space, we show that two-layer networks with the ReLU^k activation function are well-designed to simultaneously approximate an unknown function and its derivatives. When the measurement is noisy, we propose a Tikhonov type regularization method, and provide error bounds when the regularization parameter is chosen appropriately. Several numerical examples support the efficiency of the proposed approach.

We consider compact composite linear operators in Hilbert space, where the composition is given by some compact operator followed by some non-compact one possessing a non-closed range. Focus is on the impact of the non-compact factor on the overall behaviour of the decay rates of the singular values of the composition. Specifically, the composition of the compact integration operator with the non-compact Hausdorff moment operator is considered. We show that the singular values of the composition decay faster than the ones of the integration operator, providing a first example of this kind. However, there is a gap between available lower bounds for the decay rate and the obtained result. Therefore we conclude with a discussion.

We investigate stochastic gradient decent (SGD) for solving full infinite dimensional ill-posed problems in Hilbert spaces. We allow for batchsize versions of SGD where the randomly chosen batches incur noise fluctuations. Based on the corresponding bias-variance decomposition we provide bounds for the root mean squared error. These bounds take into account the discretization levels, the decay of the step-size, which is more flexible than in existing results, and the underlying smoothness in terms of general source conditions. This allows to apply SGD to severely ill-posed problems. The obtained error bounds exhibit three stages of the performance of SGD. In particular, the pre-asymptotic behavior can be well seen. Some numerical studies verify the theoretical predictions.

We study regularization of ill-posed equations involving multiplication operators when the multiplier function is positive almost everywhere and zero is an accumulation point of the range of this function. Such equations naturally arise from equations based on non-compact self-adjoint operators in Hilbert space, after applying unitary transformations arising out of the spectral theorem. For classical regularization theory, when noisy observations are given and the noise is deterministic and bounded, then non-compactness of the ill-posed equations is a minor issue. However, for statistical ill-posed equations with non-compact operators less is known if the data are blurred by white noise. We develop a regularization theory with emphasis on this case. In this context, we highlight several aspects, in particular we discuss the intrinsic degree of ill-posedness in terms of rearrangements of the multiplier function. Moreover, we address the required modifications of classical regularization schemes in order to be used for non-compact statistical problems, and we also introduce the concept of the effective ill-posedness of the operator equation under white noise. This study is concluded with prototypical examples for such equations, as these are deconvolution equations and certain final value problems in evolution equations.

The Bayesian approach to inverse problems with functional unknowns, has received significant attention in recent years. An important component of the developing theory is the study of the asymptotic performance of the posterior distribution in the frequentist setting. The present paper contributes to the area of Bayesian inverse problems by formulating a posterior contraction theory for linear inverse problems, with truncated Gaussian series priors, and under general smoothness assumptions. Emphasis is on the intrinsic role of the truncation point both for the direct as well as for the inverse problem, which are related through the modulus of continuity as this was recently highlighted by Knapik and Salomond (2018).

Variational source conditions are known to be a versatile tool for establishing error bounds, and these recently attract much attention. We establish sufficient conditions for general spectral regularization methods which yield convergence rates under variational source conditions. Specifically, we revisit the asymptotical regularization, Runge-Kutta integrators, and verify that these methods satisfy the proposed conditions. Numerical examples confirm the theoretical findings.

We develop a 16-band k center dot p model for the description of wurtzite GaAs, together with a scheme to determine electronic structure parameters for multiband k center dot p models. Our approach uses low-discrepancy sequences to fit k center dot p band structures beyond the eight-band scheme to most recent ab initio data, obtained within the framework for hybrid-functional density functional theory with a screened-exchange hybrid functional. We report structural parameters, elastic constants, band structures along high-symmetry lines, and deformation potentials at the Gamma point. Based on this, we compute the bulk electronic properties (Gamma point energies, effective masses, Luttinger-like parameters, and optical matrix parameters) for a ten-band and a sixteen-band k center dot p model for wurtzite GaAs. Our fitting scheme can assign priorities to both selected bands and k points that are of particular interest for specific applications. Finally, ellipticity conditions can be taken into account within our fitting scheme in order to make the resulting parameter sets robust against spurious solutions.

The authors consider a randomized solution to ill-posed operator equations in Hilbert spaces. In contrast to statistical inverse problems, where randomness appears in the noise, here randomness arises in the low-rank matrix approximation of the forward operator, which results in using a Monte Carlo method to solve the inverse problems. In particular, this approach follows the paradigm of the study N. Halkoet al2011SIAM Rev.53217-288, and hence regularization is performed based on the low-rank matrix approximation. Error bounds for the mean error are obtained which take into account solution smoothness and the inherent noise level. Based on the structure of the error decomposition the authors propose a novel algorithm which guarantees (on the mean) a prescribed error tolerance. Numerical simulations confirm the theoretical findings.

We study Tikhonov regularization for certain classes of non-linear ill-posed operator equations in Hilbert space. Emphasis is on the case where the solution smoothness fails to have a finite penalty value, as in the preceding study 'Tikhonov regularization with oversmoothing penalty for non-linear ill-posed problems in Hilbert scales'. Inverse Problems 34(1), 2018, by the same authors. Optimal order convergence rates are established for the specific a priori parameter choice, as used for the corresponding linear equations.

We study a non-linear statistical inverse learning problem, where we observe the noisy image of a quantity through a non-linear operator at some random design points. We consider the widely used Tikhonov regularization (or method of regularization, MOR) approach to reconstruct the estimator of the quantity for the non-linear ill-posed inverse problem. The estimator is defined as the minimizer of a Tikhonov functional, which is the sum of a data misfit term and a quadratic penalty term. We develop a theoretical analysis for the minimizer of the Tikhonov regularization scheme using the ansatz of reproducing kernel Hilbert spaces. We discuss optimal rates of convergence for the proposed scheme, uniformly over classes of admissible solutions, defined through appropriate source conditions.

The analysis of Tikhonov regularization for nonlinear ill-posed equations with smoothness promoting penalties is an important topic in inverse problem theory. With focus on Hilbert scale models, the case of oversmoothing penalties, i.e., when the penalty takes an infinite value at the true solution gained increasing interest. The considered nonlinearity structure is as in the study B. Hofmann and P. Mathé. Tikhonov regularization with oversmoothing penalty for non-linear ill-posed problems in Hilbert scales. Inverse Problems, 2018. Such analysis can address two fundamental questions. When is it possible to achieve order optimal reconstruction? How to select the regularization parameter? The present study complements previous ones by two main facets. First, an error decomposition into a smoothness dependent and a (smoothness independent) noise propagation term is derived, covering a large range of smoothness conditions. Secondly, parameter selection by balancing principles is presented. A detailed discussion, covering some history and variations of the parameter choice by balancing shows under which conditions such balancing principles yield order optimal reconstruction. A numerical case study, based on some exponential growth model, provides additional insights.

We develop a 16-band k · p model for the description of wurtzite GaAs, together with a scheme to determine electronic structure parameters for multiband k · p models. Our approach uses low-discrepancy sequences to fit k · p band structures beyond the eight-band scheme to most recent ab initio data, obtained within the framework for hybrid-functional density functional theory with a screened-exchange hybrid functional. We report structural parameters, elastic constants, band structures along high-symmetry lines, and deformation potentials at the (cid:2) point. Based on this, we compute the bulk electronic properties ( (cid:2) point energies, effective masses, Luttinger-like parameters, and optical matrix parameters) for a ten-band and a sixteen-band k · p model for wurtzite GaAs. Our fitting scheme can assign priorities to both selected bands and k points that are of particular interest for specific applications. Finally, ellipticity conditions can be taken into account within our fitting scheme in order to make the resulting parameter sets robust against spurious solutions.

The Bayesian approach to ill-posed operator equations in Hilbert space recently gained attraction. In this context, and when the prior distribution is Gaussian, then two operators play a significant role, the one which governs the operator equation, and the one which describes the prior covariance. Typically it is assumed that these operators commute. Here we extend this analysis to non-commuting operators, replacing the commutativity assumption by a link condition. We discuss its relation to the commuting case, and we indicate that this allows us to use interpolation type results to obtain tight bounds for the contraction of the posterior Gaussian distribution towards the data generating element.

In the setting of supervised learning using reproducing kernel methods, we propose a data-dependent regularization parameter selection rule that is adaptive to the unknown regularity of the target function and is optimal both for the least-square (prediction) error and for the reproducing kernel Hilbert space (reconstruction) norm error. It is based on a modified Lepskii balancing principle using a varying family of norms.