Metraipolis › archive › dc_579708cb24fc

Regularization of Statistical Inverse Problems on Non-Reflexive Banach Spaces — arXiv:2608.17533

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.17533
License (as archived)
CC0-1.0
Archived
2026-10-18T14:59:23.782Z
SHA-256 of the archived text
47bb4b4a3c80e44ab66660a4166c7f785d97917fcc3e3b2d58d997d977ddc478
Stable URL of this page
https://metraipolis.com/documento/dc_579708cb24fc

How to cite

Regularization of Statistical Inverse Problems on Non-Reflexive Banach Spaces — arXiv:2608.17533 — arXiv (en), https://arxiv.org/abs/2608.17533 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_579708cb24fc (Metraipolis archive dc_579708cb24fc, sha256 47bb4b4a3c80e44ab66660a4166c7f785d97917fcc3e3b2d58d997d977ddc478)
BibTeX
@misc{dc579708cb24fc,
  title = {Regularization of Statistical Inverse Problems on Non-Reflexive Banach Spaces — arXiv:2608.17533},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.17533},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_579708cb24fc; sha256 47bb4b4a3c80e44ab66660a4166c7f785d97917fcc3e3b2d58d997d977ddc478},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.17533. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Inverse learning within a statistical framework has a wide range of applications. It has garnered significant attention in machine learning, artificial intelligence, and related fields, where the goal is to infer unknown parameters from indirect and noisy observations. This work investigates the stable approximation of $u^{\dagger}$ which solves the equation $Au=g$, with $A$ being a linear operator between appropriate vector spaces. We will consider the domain to be a non-reflexive Banach Space and the co-domain to be a space of real-valued functions on a metric space $X$. The function $g$ is characterized by a finite number of independently and identically distributed data points, which are assumed to follow some unknown probability measure $\rho$. We employ Tikhonov regularization with an arbitrary convex functional to obtain the regularized solution corresponding to the given data point. The convergence analysis is carried out with respect to the Bregman distance, and an upper bound for the error is derived in probability terms. The theoretical findings are then supported by numerical experiments.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-19 in math.ST).
Categorie arXiv: Numerical Analysis (math.NA) ; Functional Analysis (math.FA); Statistics Theory (math.ST); Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2608.17533 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T14:58:56.465Z dalla pagina https://arxiv.org/catchup/math.ST/2026-08-19?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).