Convergence Analysis of Statistical Inverse Problems on Reproducing Kernel Banach Spaces

Statistical inverse problems have garnered significant attention in recent years due to the growing importance of statistical learning theory and functional analytic approaches in the fields of machine learning and artificial intelligence. In this paper, we investigate the stable approximation of the element u^{\dagger} that satisfies the equation Au = g, where A is a linear operator that maps a Banach space into an appropriate function space. The function g is observed only through independently and identically distributed data points that are corrupted by noise and assumed to follow an unknown distribution ρ. We employ the Tikhonov regularization scheme, leveraging statistical learning techniques and the framework of reproducing kernel Banach spaces to estimate the solution. We establish convergence and derive the convergence rate of the estimated solution with respect to the true solution as the number of data points increases, with the rate expressed in probabilistic terms. The theoretical findings are further supported by numerical experiments that demonstrate the effectiveness of the proposed approach.