Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions.
Nathan HalkoPer-Gunnar MartinssonJoel A. TroppPublished in: SIAM Rev. (2011)
Keyphrases
- linear algebra
- learning algorithm
- orders of magnitude
- exact and approximate
- computationally efficient
- genetic algorithm
- bayesian networks
- computational complexity
- significant improvement
- computational cost
- machine learning
- relational databases
- hierarchical structure
- singular value decomposition
- approximate solutions
- perturbation theory