The search session has expired. Please query the service again.

Adaptive hard-thresholding for linear inverse problems

Paul Rochet

ESAIM: Probability and Statistics (2013)

  • Volume: 17, page 485-499
  • ISSN: 1292-8100

Abstract

top
A number of regularization methods for discrete inverse problems consist in considering weighted versions of the usual least square solution. These filter methods are generally restricted to monotonic transformations, e.g. the Tikhonov regularization or the spectral cut-off. However, in several cases, non-monotonic sequences of filters may appear more appropriate. In this paper, we study a hard-thresholding regularization method that extends the spectral cut-off procedure to non-monotonic sequences. We provide several oracle inequalities, showing the method to be nearly optimal under mild assumptions. Contrary to similar methods discussed in the literature, we use here a non-linear threshold that appears to be adaptive to all degrees of irregularity, whether the problem is mildly or severely ill-posed. Finally, we extend the method to inverse problems with noisy operator and provide efficiency results in a conditional framework.

How to cite

top

Rochet, Paul. "Adaptive hard-thresholding for linear inverse problems." ESAIM: Probability and Statistics 17 (2013): 485-499. <http://eudml.org/doc/273626>.

@article{Rochet2013,
abstract = {A number of regularization methods for discrete inverse problems consist in considering weighted versions of the usual least square solution. These filter methods are generally restricted to monotonic transformations, e.g. the Tikhonov regularization or the spectral cut-off. However, in several cases, non-monotonic sequences of filters may appear more appropriate. In this paper, we study a hard-thresholding regularization method that extends the spectral cut-off procedure to non-monotonic sequences. We provide several oracle inequalities, showing the method to be nearly optimal under mild assumptions. Contrary to similar methods discussed in the literature, we use here a non-linear threshold that appears to be adaptive to all degrees of irregularity, whether the problem is mildly or severely ill-posed. Finally, we extend the method to inverse problems with noisy operator and provide efficiency results in a conditional framework.},
author = {Rochet, Paul},
journal = {ESAIM: Probability and Statistics},
keywords = {inverse problems; singular value decomposition; hard-thresholding},
language = {eng},
pages = {485-499},
publisher = {EDP-Sciences},
title = {Adaptive hard-thresholding for linear inverse problems},
url = {http://eudml.org/doc/273626},
volume = {17},
year = {2013},
}

TY - JOUR
AU - Rochet, Paul
TI - Adaptive hard-thresholding for linear inverse problems
JO - ESAIM: Probability and Statistics
PY - 2013
PB - EDP-Sciences
VL - 17
SP - 485
EP - 499
AB - A number of regularization methods for discrete inverse problems consist in considering weighted versions of the usual least square solution. These filter methods are generally restricted to monotonic transformations, e.g. the Tikhonov regularization or the spectral cut-off. However, in several cases, non-monotonic sequences of filters may appear more appropriate. In this paper, we study a hard-thresholding regularization method that extends the spectral cut-off procedure to non-monotonic sequences. We provide several oracle inequalities, showing the method to be nearly optimal under mild assumptions. Contrary to similar methods discussed in the literature, we use here a non-linear threshold that appears to be adaptive to all degrees of irregularity, whether the problem is mildly or severely ill-posed. Finally, we extend the method to inverse problems with noisy operator and provide efficiency results in a conditional framework.
LA - eng
KW - inverse problems; singular value decomposition; hard-thresholding
UR - http://eudml.org/doc/273626
ER -

References

top
  1. [1] F. Abramovich and B.W. Silverman, Wavelet decomposition approaches to statistical inverse problems. Biometrika85 (1998) 115–129. Zbl0908.62095MR1627226
  2. [2] N. Bissantz, T. Hohage, A. Munk and F. Ruymgaart, Convergence rates of general regularization methods for statistical inverse problems and applications. SIAM J. Numer. Anal. 45 (2007) 2610–2636 (electronic). Zbl1234.62062MR2361904
  3. [3] L. Cavalier, Nonparametric statistical inverse problems. Inverse Problems 24 (2008) 034004. Zbl1137.62323MR2421941
  4. [4] L. Cavalier and G.K. Golubev, Risk hull method and regularization by projections of ill-posed inverse problems. Ann. Statist.34 (2006) 1653–1677. Zbl1246.62082MR2283712
  5. [5] L. Cavalier and N.W. Hengartner, Adaptive estimation for inverse problems with noisy operators. Inverse Problems21 (2005) 1345–1361. Zbl1074.62053MR2158113
  6. [6] L. Cavalier, G.K. Golubev, D. Picard and A.B. Tsybakov, Oracle inequalities for inverse problems. Ann. Statist.30 (2000) 843–874. Zbl1029.62032MR1922543
  7. [7] S. Efromovich and V. Koltchinskii, On inverse problems with unknown operators. IEEE Trans. Inform. Theory47 (2001) 2876–2894. Zbl1017.94508MR1872847
  8. [8] H.W. Engl, M. Hanke and A. Neubauer, Regularization of inverse problems, Math. Appl., vol. 375. Kluwer Academic Publishers Group, Dordrecht (1996). Zbl0859.65054MR1408680
  9. [9] P.C. Hansen, The truncated SVD as a method for regularization. BIT27 (1987) 534–553. Zbl0633.65041MR916729
  10. [10] P.C. Hansen and D.P. O’Leary. The use of the L-curve in the regularization of discrete ill-posed problems. SIAM J. Sci. Comput.14 (1993) 1487–1503. Zbl0789.65030MR1241596
  11. [11] M. Hoffmann and M. Reiss, Nonlinear estimation for linear inverse problems with error in the operator. Ann. Statist.36 (2008) 310–336. Zbl1134.65038MR2387973
  12. [12] J.M. Loubes, l1 penalty for ill-posed inverse problems. Comm. Statist. Theory Methods 37 (2008) 1399–1411. Zbl1196.62035MR2440445
  13. [13] J.M. Loubes and C. Ludeña, Adaptive complexity regularization for linear inverse problems. Electron. J. Stat.2 (2008) 661–677. Zbl1320.62075MR2426106
  14. [14] J.M. Loubes and C. Ludeña, Penalized estimators for non linear inverse problems. ESAIM: PS 14 (2010) 173–191. Zbl1213.62066MR2741964
  15. [15] F. Natterer, The mathematics of computerized tomography, Class. Appl. Math., vol. 32. SIAM, Philadelphia, PA (2001). Reprint of the 1986 original. Zbl0973.92020MR1847845
  16. [16] J.A. Scales and A. Gersztenkorn, Robust methods in inverse theory. Inverse Problems4 (1988) 1071–1091. Zbl0672.65019MR966773
  17. [17] C.M. Stein, Estimation of the mean of a multivariate normal distribution. Ann. Statist.9 (1981) 1135–1151. Zbl0476.62035MR630098
  18. [18] A.N. Tikhonov and V.Y. Arsenin, Solutions of ill-posed problems. V.H. Winston & Sons, Washington, D.C.: John Wiley & Sons, New York (1977). Translated from the Russian, Preface by translation editor Fritz John, Scripta Series in Mathematics. Zbl0354.65028MR455365
  19. [19] J.M. Varah, On the numerical solution of ill-conditioned linear systems with applications to ill-posed problems. SIAM J. Numer. Anal. 10 (1973) 257–267. Collection of articles dedicated to the memory of George E. Forsythe. Zbl0261.65034MR334486
  20. [20] J.M. Varah, A practical examination of some numerical methods for linear discrete ill-posed problems. SIAM Rev.21 (1979) 100–111. Zbl0406.65015MR516385

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.