The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Convergence Rates of General Regularization Methods for Statistical Inverse Problems and Applications
Abstract
Previously, the convergence analysis for linear statistical inverse problems has mainly focused on spectral cut-off and Tikhonov-type estimators. Spectral cut-off estimators achieve minimax rates for a broad range of smoothness classes and operators, but their practical usefulness is limited by the fact that they require a complete spectral decomposition of the operator. Tikhonov estimators are simpler to compute but still involve the inversion of an operator and achieve minimax rates only in restricted smoothness classes. In this paper we introduce a unifying technique to study the mean square error of a large class of regularization methods (spectral methods) including the aforementioned estimators as well as many iterative methods, such as $\nu$-methods and the Landweber iteration. The latter estimators converge at the same rate as spectral cut-off but require only matrix-vector products. Our results are applied to various problems; in particular we obtain precise convergence rates for satellite gradiometry, $L^2$-boosting, and errors in variable problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
Statistical Estimation and Optimal Recovery
Donoho, D. L. (1994) · The Annals of Statistics · doi:10.1214/aos/1176325367 · Cited by 263
Cited by
Boosting Algorithms: Regularization, Prediction and Model Fitting
Bühlmann, P., & Hothorn, T. (2007) · Statistical Science · doi:10.1214/07-sts242 · Cited by 726
Solving inverse problems using data-driven models
Arridge, S., Maass, P., Öktem, O., & Schönlieb, C.-B. (2019) · Acta Numerica · doi:10.1017/s0962492919000059 · Cited by 686
Modern regularization methods for inverse problems
Benning, M., & Burger, M. (2018) · Acta Numerica · doi:10.1017/s0962492918000016 · Cited by 412
Handbook of Mathematical Methods in Imaging
(2011) · Springer eBooks · doi:10.1007/978-0-387-92920-0 · Cited by 334
On regularization algorithms in learning theory
Bauer, F., Pereverzev, S., & Rosasco, L. (2007) · Journal of Complexity · doi:10.1016/j.jco.2006.07.001 · Cited by 262
Metadata
- Authors
- Bissantz, N., Hohage, T., Munk, A., & Ruymgaart, F.
- Venue
- SIAM Journal on Numerical Analysis
- Published
- 2007-01
- Volume
- 45
- Issue
- 6
- Pages
- 2610-2636
- ISSN
- 0036-1429 (ISSN-L)
- 1095-7170
- OpenAlex
- W2091178361
- Cited by
- 219
- References
- 2
- FWCI
- 28.60
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Convergence Rates of General Regularization Methods for Statistical Inverse Problems and Applications. https://app.cochat.ai/papers/10.1137/060651884
- The paper
- Bissantz, N., Hohage, T., Munk, A., & Ruymgaart, F. (2007). Convergence Rates of General Regularization Methods for Statistical Inverse Problems and Applications. SIAM Journal on Numerical Analysis. https://doi.org/10.1137/060651884
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.