arXiv Statistics ML
Learning Operators by Regularized Stochastic Gradient Descent with Operator-valued Kernels
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
Related stories
arXiv Machine Learning
Sep 15
Stochastic Gradient Descent for Operator Learning in Hilbert Spaces: Convergence Rates and Minimax Lower Bounds
arXiv:2402.04691v5 Announce Type: replace-cross Abstract: This study investigates the use of stochastic gradient descent (SGD) to learn operators between general Hilbert spaces. We study weak and str...
arXiv Machine Learning
Jul 9
Statistical inverse learning and $\ell^1$-regularization
arXiv:2607. 07468v1 Announce Type: cross Abstract: We study the recovery of sparse functions from finite, noisy, and indirect observations in the framework of statistical inverse learning.
Hugging Face Trending Papers
Jun 22
Generalized nonparametric regression in reproducing kernel Hilbert spaces: Consistency and rates of convergence
We develop a comprehensive theory for regularized M-estimation in reproducing kernel Hilbert spaces. Under mild conditions on the loss we establish existence and measurability of the estimator, covering a wide range of convex and non-convex losses, including bounded robust losses.
arXiv Machine Learning
Aug 26
Sequential operator learning under dependent data
The paper presents time‑uniform self‑normalized concentration bounds for stochastic processes in Hilbert spaces with vector‑valued noise, enabling regression‑error guarantees for both linear and nonlinear parametric operators. These results apply to possibly infinite‑dimensional inputs and outputs without requiring independence or mixing assumptions, and are derived in the context of sequentially collected, dependent data such as adaptive experimental design and dynamical‑system modelling.
arXiv Machine Learning
Jul 10
Statistical inverse learning problems with random observations
arXiv:2312. 15341v1 Announce Type: cross Abstract: We provide an overview of recent progress in statistical inverse problems with random experimental design, covering both linear and nonlinear inverse problems.
arXiv Machine Learning
Sep 7
The Sample Complexity of Learning Lipschitz Operators with respect to Gaussian Measures
The paper investigates how many linear samples are needed to learn Lipschitz operators under Gaussian measures. It establishes both lower and upper bounds on the Hermite polynomial approximation error and shows that the minimal worst‑case error cannot converge algebraically with the number of samples. However, if the covariance operator of the Gaussian measure decays rapidly, convergence rates arbitrarily close to any algebraic rate can be achieved.