Linearly Convergent Randomized Iterative Methods for Computing the Pseudoinverse
arXiv:1612.06255
Abstract
We develop the first stochastic incremental method for calculating the Moore-Penrose pseudoinverse of a real matrix. By leveraging three alternative characterizations of pseudoinverse matrices, we design three methods for calculating the pseudoinverse: two general purpose methods and one specialized to symmetric matrices. The two general purpose methods are proven to converge linearly to the pseudoinverse of any given matrix. For calculating the pseudoinverse of full rank matrices we present two additional specialized methods which enjoy a faster convergence rate than the general purpose methods. We also indicate how to develop randomized methods for calculating approximate range space projections, a much needed tool in inexact Newton type methods or quadratic solvers when linear constraints are present. Finally, we present numerical experiments of our general purpose methods for calculating pseudoinverses and show that our methods greatly outperform the Newton-Schulz method on large dimensional matrices.
28 pages, 11 figures
References in corpus (2)
Cited by in corpus (9)
- Privacy Preserving Randomized Gossip Algorithms
- Adaptive Sketch-and-Project Methods for Solving Linear Systems
- Fast Linear Convergence of Randomized BFGS
- A Sketched Finite Element Method for Elliptic Models
- Randomized Iterative Methods for Linear Systems: Momentum, Inexactness and Gossip
- Heavy Ball Momentum Induced Sampling Kaczmarz Motzkin Methods for Linear Feasibility Problems
- A row-sampling-based randomised finite element method for elliptic partial differential equations
- Sampling Kaczmarz Motzkin Method for Linear Feasibility Problems: Generalization & Acceleration
- Optimization for Supervised Machine Learning: Randomized Algorithms for Data and Parameters