In this paper 1 , we study matrix scaling and balancing, which are fundamental problems in scientific computing, with a long line of work on them that dates back to the 1960s. We provide algorithms for both these problems that, ignoring logarithmic factors involving the dimension of the input matrix and the size of its entries, both run in time O m log κ log 2 (1/ε) where ε is the amount of error we are willing to tolerate. Here, κ represents the ratio between the largest and the smallest entries of the optimal scalings. This implies that our algorithms run in nearly-linear time whenever κ is quasi-polynomial, which includes, in particular, the case of strictly positive matrices. We complement our results by providing a separate algorithm that uses an interior-point method and runs in time O(m 3/2 log(1/ε)). In order to establish these results, we develop a new secondorder optimization framework that enables us to treat both problems in a unified and principled manner. This framework identifies a certain generalization of linear system solving that we can use to efficiently minimize a broad class of functions, which we call second-order robust. We then show that in the context of the specific functions capturing matrix scaling and balancing, we can leverage and generalize the work on Laplacian system solving to make the algorithms obtained via this framework very efficient.
Cohen, Madry, Tsipras and Vladu REF obtain an algorithm for matrix scaling with running time O (m log κ log 2 (1/ϵ )), where m is the number of nonzeros in the input matrix, κ is the ratio between the largest and the smallest entries in the optimal scaling solution, and ϵ is the error parameter of the output.
Matrix Scaling and Balancing via Box Constrained Newton's Method and Interior Point Methods
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
Computer Science Mathematics