Increasing the accuracy of solving discrete ill-posed problems by the random projection method
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3551792 (Why is no real title available?)
- scientific article; zbMATH DE number 1392848 (Why is no real title available?)
- A Random Matrix-Theoretic Approach to Handling Singular Covariance Estimates
- A note on functional averages over Gaussian ensembles
- A randomized method for solving discrete ill-posed problems
- Analytical study of error components for solving discrete ill-posed problems using random projections
- Generalization bounds for function approximation from scattered noisy data
- Matrix pseudoinversion in the problem of design of associative memory
- Model selection criteria for a linear model to solve discrete ill-posed problems on the basis of singular decomposition and random projection
- Properties of numeric codes for the scheme of random subspaces RSC
- Random projections as regularizers: learning a linear discriminant from fewer observations than dimensions
- Randomized projective methods for the construction of binary sparse vector representations
- Rank-Deficient and Discrete Ill-Posed Problems
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Sketching as a tool for numerical linear algebra
Cited in
(2)
This page was built for publication: Increasing the accuracy of solving discrete ill-posed problems by the random projection method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1711397)