Analytical low-rank compression via proxy point selection
Xin Ye, Jianlin Xia, Lexing Ying

TL;DR
This paper provides a rigorous theoretical foundation and practical criteria for proxy point-based low-rank approximation of kernel matrices, enhancing the efficiency and reliability of analytical compression methods.
Contribution
It offers a clear algebraic understanding, error analysis, and optimal proxy point selection criteria for the proxy point method in low-rank kernel matrix approximation.
Findings
Provides error bounds for low-rank approximations.
Develops criteria for selecting nearly optimal proxy points.
Bridges the gap between potential theory and numerical linear algebra.
Abstract
It has been known in potential theory that, for some kernels matrices corresponding to well-separated point sets, fast analytical low-rank approximation can be achieved via the use of proxy points. This proxy point method gives a surprisingly convenient way of explicitly writing out approximate basis matrices for a kernel matrix. However, this elegant strategy is rarely known or used in the numerical linear algebra community. It still needs clear algebraic understanding of the theoretical background. Moreover, rigorous quantifications of the approximation errors and reliable criteria for the selection of the proxy points are still missing. In this work, we use contour integration to clearly justify the idea in terms of a class of important kernels. We further provide comprehensive accuracy analysis for the analytical compression and show how to choose nearly optimal proxy points. The…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Statistical and numerical algorithms · Tensor decomposition and applications
