The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Practical Approximate Solutions to Linear Operator Equations When the Data are Noisy
Abstract
We consider approximate solutions $f_{n,\lambda } $ to linear operator equations $\mathcal{K}f = g$, of the form: $f_{n,\lambda } $ is the minimizer in $\mathcal{H}$ of $({1 / n})\sum _{j = 1}^n {[(\mathcal{K}h)(t_j ) - y(t_j )]} ^2 + \lambda \| h \|^2 $, where $\mathcal{H}$ is a Hilbert space, and the data $\{ {y(t_j )} \}$ satisfy $y(t_j ) = g(t_j ) + \varepsilon (t_j )$, the $\{ {\varepsilon (t_j )} \}$ being measurement errors. $f_{n,\lambda } $ is the so-called regularized solution, and $\lambda > 0$ is the regularization parameter, to be chosen. It is important to choose $\lambda $ correctly. The purpose of this paper is to propose the method of weighted cross-validation for choosing $\lambda $from the data. We suppose that g is very smooth and the errors are white noise. It is shown that the weighted cross-validation estimate $\hat \lambda $ estimates the value of $\lambda $ which minimizes $({1 / n})E\sum\nolimits_{j = 1}^n {[(\mathcal{K}f_{n,\lambda } )(t_j ) - (\mathcal{K}f)(t_j )]} ^2 $ . Results related to the convergence of $\| {f - f_{n,\hat \lambda } } \|$, including rates, are obtained.
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
A new look at the statistical model identification
Akaike, H. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100705 · Cited by 51,879
Cross validatory choice and assessment of statistical predictions
Stone, M. (1974) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1974.tb00994.x · Cited by 10,881
Aronszajn, N. (1950) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1950-0051437-7 · Cited by 5,380
Reinsch, C. H. (1967) · Numerische Mathematik · doi:10.1007/bf02162161 · Cited by 2,236
A Technique for the Numerical Solution of Certain Integral Equations of the First Kind
Phillips, D. L. (1962) · Journal of the ACM · doi:10.1145/321105.321114 · Cited by 1,985
Smoothing noisy data with spline functions
Wahba, G. (1975) · Numerische Mathematik · doi:10.1007/bf01437407 · Cited by 1,443
Self-citationTwomey, S. (1963) · Journal of the ACM · doi:10.1145/321150.321157 · Cited by 936
REGULARIZATION OF INCORRECTLY POSED PROBLEMS
Tikhonov, A. N. (1963) · Cited by 876
Lanczos, C. (1964) · Journal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis · doi:10.1137/0701007 · Cited by 396
A completely automatic french curve: fitting spline functions by cross validation
Wahba, G., & Wold, S. (1975) · Communications in Statistics · doi:10.1080/03610927508827223 · Cited by 366
Self-citation
Cited by
Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
Golub, G. H., Heath, M., & Wahba, G. (1979) · Technometrics · doi:10.1080/00401706.1979.10489751 · Cited by 3,934
Self-citationA survey of cross-validation procedures for model selection
Arlot, S., & Celisse, A. (2010) · Statistics Surveys · doi:10.1214/09-ss054 · Cited by 3,522
Craven, P., & Wahba, G. (1978) · Numerische Mathematik · doi:10.1007/bf01404567 · Cited by 3,388
Self-citationNetworks for approximation and learning
Poggio, T., & Girosi, F. (1990) · Proceedings of the IEEE · doi:10.1109/5.58326 · Cited by 3,252
Wold, S., Ruhe, A., Wold, H., & Dunn, III (1984) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0905052 · Cited by 2,529
Robust Optimization of Large-Scale Systems
Mulvey, J. M., Vanderbei, R. J., & Zenios, S. A. (1995) · Operations Research · doi:10.1287/opre.43.2.264 · Cited by 1,944
Smoothing noisy data with spline functions
Wahba, G. (1975) · Numerische Mathematik · doi:10.1007/bf01437407 · Cited by 1,443
Self-citationThe multivariate calibration problem in chemistry solved by the PLS method
Wold, S., Martens, H., & Wold, H. (1983) · Lecture notes in mathematics · doi:10.1007/bfb0062108 · Cited by 1,185
Schneider, T. (2001) · Journal of Climate · doi:10.1175/1520-0442(2001)014<0853:aoicde>2.0.co;2 · Cited by 759
Ill-posed problems in early vision
Bertero, M., Poggio, T. A., & Torre, V. (1988) · Proceedings of the IEEE · doi:10.1109/5.5962 · Cited by 723
Bayesian “Confidence Intervals” for the Cross-Validated Smoothing Spline
Wahba, G. (1983) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1983.tb01239.x · Cited by 637
Self-citationExponential analysis in physical phenomena
Istratov, A. A., & Vyvenko, O. F. (1999) · Review of Scientific Instruments · doi:10.1063/1.1149581 · Cited by 615
Yang, Z., Albrow-Owen, T., Cui, H., Alexander-Webber, J., Gu, F., Wang, X., Wu, T.-C., Zhuge, M., Williams, C., Wang, P., et al. (2019) · Science · doi:10.1126/science.aax8814 · Cited by 608
Wahba, G. (1985) · The Annals of Statistics · doi:10.1214/aos/1176349743 · Cited by 523
Self-citationHo, T.-S., & Rabitz, H. (1996) · The Journal of Chemical Physics · doi:10.1063/1.470984 · Cited by 497
A new kernel-based approach for linear system identification
Pillonetto, G., & De Nicolao, G. (2010) · Automatica · doi:10.1016/j.automatica.2009.10.031 · Cited by 479
Iterative methods for image deblurring
Biemond, J., Lagendijk, R. L., & Mersereau, R. M. (1990) · Proceedings of the IEEE · doi:10.1109/5.53403 · Cited by 460
Numerical tools for analysis and solution of Fredholm integral equations of the first kind
Hansen, P. C. (1992) · Inverse Problems · doi:10.1088/0266-5611/8/6/005 · Cited by 449
Parallel and deterministic algorithms from MRFs: surface reconstruction
Geiger, D., & Girosi, F. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.134040 · Cited by 447
Modern regularization methods for inverse problems
Benning, M., & Burger, M. (2018) · Acta Numerica · doi:10.1017/s0962492918000016 · Cited by 412
Wegman, E. J., & Wright, I. W. (1983) · Journal of the American Statistical Association · doi:10.1080/01621459.1983.10477977 · Cited by 332
Linear Inverse and III-Posed Problems
Bertero, M. (1989) · Advances in Electronics and Electron Physics · doi:10.1016/s0065-2539(08)60946-4 · Cited by 330
Fractional Splines and Wavelets
Unser, M., & Blu, T. (2000) · SIAM Review · doi:10.1137/s0036144598349435 · Cited by 328
Microwave imaging-complex permittivity reconstruction with a Levenberg-Marquardt method
Franchois, A., & Pichot, C. (1997) · IEEE Transactions on Antennas and Propagation · doi:10.1109/8.560338 · Cited by 312
On the Estimation of a Probability Density Function by the Maximum Penalized Likelihood Method
Silverman, B. W. (1982) · The Annals of Statistics · doi:10.1214/aos/1176345872 · Cited by 305
Low-field permanent magnets for industrial process and quality control
Mitchell, J., Gladden, L. F., Chandrasekera, T. C., & Fordham, E. J. (2014) · Progress in Nuclear Magnetic Resonance Spectroscopy · doi:10.1016/j.pnmrs.2013.09.001 · Cited by 300
Non-convergence of the L-curve regularization parameter selection method
Vogel, C. R. (1996) · Inverse Problems · doi:10.1088/0266-5611/12/4/013 · Cited by 293
Comparingparameter choice methods for regularization of ill-posed problems
Bauer, F., & Lukas, M. A. (2011) · Mathematics and Computers in Simulation · doi:10.1016/j.matcom.2011.01.016 · Cited by 293
Regularized iterative image restoration with ringing reduction
Lagendijk, R. L., Biemond, J., & Boekee, D. E. (1988) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.9032 · Cited by 289
Parallel imaging reconstruction using automatic regularization
Lin, F., Kwong, K. K., Belliveau, J. W., & Wald, L. L. (2004) · Magnetic Resonance in Medicine · doi:10.1002/mrm.10718 · Cited by 266
A Regularization Parameter in Discrete Ill-Posed Problems
Regińska, T. (1996) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827593252672 · Cited by 262
Linear inverse problems in imaging
Ribes, A., & Schmitt, F. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2008.923099 · Cited by 154
Lessons Learned During the Conduct of Clinical Studies in The Dental PBRN
Gilbert, G. H., Richman, J. S., Gordan, V. V., Rindal, D. B., Fellows, J. L., Benjamin, P. L., Wallace‐Dawson, M., Williams, O. D., & for The DPBRN Collaborative Group (2011) · Journal of Dental Education · doi:10.1002/j.0022-0337.2011.75.4.tb05069.x · Cited by 59
Metadata
- Authors
- Wahba, G.
- Venue
- SIAM Journal on Numerical Analysis
- Published
- 1977-09
- Volume
- 14
- Issue
- 4
- Pages
- 651-667
- ISSN
- 0036-1429 (ISSN-L)
- 1095-7170
- OpenAlex
- W2137645797
- Cited by
- 798
- References
- 16
- FWCI
- 11.74
- 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
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.