A Randomized Algorithm for Preconditioner Selection

Abstract

The task of choosing a preconditioner M to use when solving a linear system Ax = b with iterative methods is difficult. For instance, even if one has access to a collection M 1 , M 2 , . . . , M n of candidate preconditioners, it is currently unclear how to practically choose the M i which minimizes the number of iterations of an iterative algorithm to achieve a suitable approximation to x. This paper makes progress on this sub-problem by showing that the preconditioner stability I − M −1 A F , known to forecast preconditioner quality, can be computed in the time it takes to run a constant number of iterations of conjugate gradients through use of sketching methods. This is in spite of folklore which suggests the quantity is impractical to compute, and a proof we give that ensures the quantity could not possibly be approximated in a useful amount of time by a deterministic algorithm. Using our estimator, we provide a method which can provably select the minimal stability preconditioner among n candidates using floating point operations commensurate with running on the order of n log n steps of the conjugate gradients algorithm. Our method can also advise the practitioner to use no preconditioner at all if none of the candidates appears useful. The algorithm is extremely easy to implement and trivially parallelizable. In one of our experiments, we use our preconditioner selection algorithm to create to the best of our knowledge the first preconditioned method for kernel regression reported to never use more iterations than the non-preconditioned analog in standard tests.