Increasing the accuracy of solving discrete ill-posed problems by the random projection method

DOI10.1007/s10559-018-0086-0OpenAlexW2892990381MaRDI QIDQ1711397

E. G. Revunova

Publication date: 17 January 2019

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-018-0086-0

zbMATH Keywords

random projectiondiscrete ill-posed problemaveraging over random matrices

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Related Items (1)

A linear system output transformation for sparse approximation

Uses Software

• Regularization tools
• UTV

Cites Work

• Unnamed Item
• Unnamed Item
• Analytical study of error components for solving discrete ill-posed problems using random projections
• Model selection criteria for a linear model to solve discrete ill-posed problems on the basis of singular decomposition and random projection
• A note on functional averages over Gaussian ensembles
• Randomized projective methods for the construction of binary sparse vector representations
• Generalization bounds for function approximation from scattered noisy data
• Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
• Matrix pseudoinversion in the problem of design of associative memory
• A randomized method for solving discrete ill-posed problems
• Random projections as regularizers: learning a linear discriminant from fewer observations than dimensions
• Properties of numeric codes for the scheme of random subspaces RSC
• Computational Advertising: Techniques for Targeting Relevant Ads
• Rank-Deficient and Discrete Ill-Posed Problems
• A Random Matrix-Theoretic Approach to Handling Singular Covariance Estimates

This page was built for publication: Increasing the accuracy of solving discrete ill-posed problems by the random projection method