A randomized method for solving discrete ill-posed problems

Cybernetics and Systems Analysis

Volumn 48, Issue 4, 2012, Pages 621-635

  Rachkovskij, D A ^a   Revunova, E G ^a  

^a INSTITUTE OF HYDROBIOLOGY   (Ukraine)

Author keywords

Discrete ill posed problem; Random projection; Regularization

Indexed keywords

EULER EQUATIONS; SYSTEMS ANALYSIS;

COMPUTER ENGINEERING; DIMENSION REDUCTION; ILL POSED PROBLEM; ILL-CONDITIONED MATRICES; RANDOM PROJECTIONS; REGULARIZATION; REGULARIZATION PARAMETERS; TIKHONOV REGULARIZATION;

PROBLEM SOLVING;

EID: 85027956005     PISSN: 10600396     EISSN: 15738337     Source Type: Journal    
DOI: 10.1007/s10559-012-9443-6     Document Type: Article

References (32)

1. P. C. Hansen, Rank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion, SIAM, Philadelphia (1998).
2. Yu. L. Zabulonov, Yu. M. Korostil, and E. G. Revunova, "Optimization of inverse problem solution to obtain the distribution density function for surface contaminations," Modeling and Information Technologies, 39, 77-83 (2006).
3. A. N. Tikhonov and V. Y. Arsenin, Methods for Solving Ill-Posed Problems [in Russian], Nauka, Moscow (1979).
4. V. A. Morozov, Regular Methods for Solving Ill-Posed Problems [in Russian], Nauka, Moscow (1987).
5. H. W. Engl, M. Hanke, and A. Neubaer, Regularization of Inverse Problems, Kluwer, Dordrecht (2000).
6. I. S. Misuno, D. A. Rachkovskij, and S. V. Slipchenko, "Vector and distributed representations reflecting semantic relatedness of words," Math. Machy i Systemy, No. 3, 50-67 (2005).
7. D. A. Rachkovskij, I. S. Misuno, and S. V. Slipchenko, "Randomized projective methods for the construction of binary sparse vector representations," Cybernetics and Systems Analysis, Vol. 48, No. 1, 140-150 (2012).
8. E. G. Revunova and D. A. Rachkovskij, "Increasing the accuracy of solving an inverse problem using random projections," in: 15th Intern. Conf. "Knowledge-Dialogue-Solution" (2009), pp. 95-102.
9. E. G. Revunova, "Study of error components for solving inverse problems using random projections," Mat. Mashiny i Sistemy, No. 4, 33-42 (2010).
10. P. Drineas, M. W. Mahoney, S. Muthukrishnan, and T. Sarlos, "Faster least squares approximation," Tech. Rep., arXiv: 0710.1435 (2007).
11. P. C. Hansen and D. P. O'Leary, "The use of L-curve in the regularization of discrete ill-posed problems," SIAM J. Sci. Comput., 14, 1487-1503 (1993).
12. G. H. Golub, M. Heath, and G. Wahba, "Generalized cross-validation as a method for choosing a good ridge parameter," Technometrics, Vol. 21, No. 2, 215-223 (1979).
13. N. Halko, P. G. Martinsson, and J. A. Tropp, "Finding structure with randomness: Stochastic algorithms for constructing approximate matrix decompositions," ACM Rep. Caltech, No. 5, 1-82 (2009).
14. C. Boutsidis, P. Drineas, and M. W. Mahoney, "An improved approximation algorithm for the column subset selection problem," in: Proc. 41st Ann. ACM Symp. on Theory of Computing (STOC'09) (2009), pp. 968-977.
15. P. Drineas, M. W. Mahoney, and S. Muthukrishnan, "Sampling algorithms for L2 regression and applications," in: Proc. 17th ACM-SIAM Symp. on Discrete Algorithms (SODA) (2006), pp. 1127-1136.
16. W. B. Johnson and J. Lindenstrauss, "Extensions of Lipschitz mappings into a Hilbert space," Contemporary Mathematics, No. 26, 189-206 (1984).
17. C. H. Papadimitriou, P. Raghavan, H. Tamaki, and S. Vempala, "Latent semantic indexing: A probabilistic analysis," J. Comput. System Sci., Vol. 61, No. 2, 217-235 (2000).
18. D. Achlioptas, "Database-friendly random projections: Johnson-Lindenstrauss with binary coins," J. Comput. System Sci., 66, No. 4, 671-687 (2003).
19. P. Li, T. J. Hastie, and K. W. Church, "Very sparse random projections," in: 12th ACM SIGKDD Intern. Conf. on Knowledge Discovery and Data Mining, ACM Press, Philadelphia (2006), pp. 287-296.
20. T. Sarlos, "Improved approximation algorithms for large matrices via random projections," in: Proc. 47th Annual IEEE Symp. on Foundations of Computer Sci. (2006), pp. 143-152.
21. V. Rokhlin and M. Tygert, "A fast randomized algorithm for overdetermined linear least-squares regression," PNAS, 105(36), 13212-13217 (2008).
22. M. Tygert, "A fast algorithm for computing minimal-norm solutions to underdetermined systems of linear equations," Tech. Rep. N09-48, arXiv: 0905.4745, May 2009 (2009).
23. P. Niyogi and F. Girosi, "On the relationship between generalization error, hypothesis complexity, and sample complexity for radial basis functions," Neural Comput., 8, 819-842 (1996).
24. P. C. Hansen, "Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems," Numer. Algorithms, 6, 1-35 (1994).
25. H. Akaike, "A new look at the statistical model identification, " IEEE Trans. Automatic Control, Vol. 19, No. 6, 716-723 (1974).
26. C. L. Mallows, "Some comments on C p, " Technometrics, 15, No. 4, 661-675 (1973).
27. M. Hansen and B. Yu, "Model selection and minimum description length principle," J. Amer. Statist. Assoc., 96, 746-774 (2001).
28. M. Sugiyama and H. Ogawa, "Subspace information criterion for model selection," Neural Comput., Vol. 13, No. 8, 1863-1889 (2001).
29. J. Rissanen, Lectures on Statistical Modeling Theory, Univ. of Technology, Tampere (2002), http://www.cs.tut.fi/~rissanen/.
30. D. A. Rachkovskij and E. G. Revunova, "Intelligent gamma-ray data processing for environmental monitoring," in: Intelligent Data Processing in Global Monitoring for Environment and Security, ITHEA, Kiev-Sofia (2011), pp. 136-157.
31. Y. L. Zabulonov, G. V. Lisichenko, and E. G. Revunova, "Stochastic regularization of the inverse problem of recovering parameters of the radioactivity field according to aerial gamma-ray survey data," in: Collected Scientific Papers of IMEE of NAS of Ukraine "Problems of Modeling in Energy Engineering," No. 52, 89-96 (2009).
32. M. Belge, M. E. Kilmer, and E. L. Miller, "Efficient determination of multiple regularization parameters in a generalized L-curve framework," Inverse Problems, 18, 1161-1183 (2002).