Column Subset Selection, Matrix Factorization, and Eigenvalue Optimization

被引:0
|
作者
Tropp, Joel A. [1 ]
机构
[1] CALTECH, Pasadena, CA 91125 USA
来源
PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS | 2009年
关键词
ALGORITHMS; SPACES;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Given a fixed matrix, the problem of column subset selection requests a column submatrix that has favorable spectral properties. Most research from the algorithms and numerical linear algebra communities focuses on a variant called rank-revealing QR, which seeks a well-conditioned collection of columns that spans the (numerical) range of the matrix. The functional analysis literature contains another strand of work on column selection whose algorithmic implications have not been explored. In particular, a celebrated result of Bourgain and Tzafriri demonstrates that each matrix with normalized columns contains a large column submatrix that is exceptionally well conditioned. Unfortunately, standard proofs of this result cannot be regarded as algorithmic. This paper presents a randomized, polynomial-time algorithm that produces the submatrix promised by Bourgain and Tzafriri. The method involves random sampling of columns, followed by a matrix factorization that exposes the well-conditioned subset of columns. This factorization, which is due to Grothendieck, is regarded as a central tool in modern functional analysis. The primary novelty in this work is an algorithm, based on eigenvalue minimization, for constructing the Grothendieck factorization. These ideas also result in an approximation algorithm for the (infinity, 1) norm of a matrix, which is generally NP-hard to compute exactly. As an added bonus, this work reveals a surprising connection between matrix factorization and the famous MAXCUT semidefinite program.
引用
收藏
页码:978 / 986
页数:9
相关论文
共 50 条
  • [1] An Empirical Comparison of Sampling Techniques for Matrix Column Subset Selection
    Wang, Yining
    Singh, Aarti
    2015 53RD ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2015, : 1069 - 1074
  • [2] Iterative column subset selection
    Bruno Ordozgoiti
    Sandra Gómez Canaval
    Alberto Mozo
    Knowledge and Information Systems, 2018, 54 : 65 - 94
  • [3] Iterative column subset selection
    Ordozgoiti, Bruno
    Gomez Canaval, Sandra
    Mozo, Alberto
    KNOWLEDGE AND INFORMATION SYSTEMS, 2018, 54 (01) : 65 - 94
  • [4] A Note on Column Subset Selection
    Youssef, Pierre
    INTERNATIONAL MATHEMATICS RESEARCH NOTICES, 2014, 2014 (23) : 6431 - 6447
  • [5] Provably Correct Algorithms for Matrix Column Subset Selection with Selectively Sampled Data
    Wang, Yining
    Singh, Aarti
    JOURNAL OF MACHINE LEARNING RESEARCH, 2018, 18 : 1 - 42
  • [6] The Column-Row Factorization of a Matrix
    Strang, Gilbert
    JOURNAL OF CONVEX ANALYSIS, 2021, 28 (02) : 725 - 728
  • [7] Regularized greedy column subset selection
    Ordozgoiti, Bruno
    Mozo, Alberto
    Garcia Lopez de Lacalle, Jesus
    INFORMATION SCIENCES, 2019, 486 : 393 - 418
  • [8] Distributed Column Subset Selection on MapReduce
    Farahat, Ahmed K.
    Elgohary, Ahmed
    Ghodsi, Ali
    Kamel, Mohamed S.
    2013 IEEE 13TH INTERNATIONAL CONFERENCE ON DATA MINING (ICDM), 2013, : 171 - 180
  • [9] Joint Eigenvalue Decomposition Using Polar Matrix Factorization
    Luciani, Xavier
    Albera, Laurent
    LATENT VARIABLE ANALYSIS AND SIGNAL SEPARATION, 2010, 6365 : 555 - 562
  • [10] A Comparison of Column Subset Selection Methods for Unsupervised Band Subset Selection in Hyperspectral Imagery
    Aldeghlawi, Maher
    Velez-Reyes, Miguel
    2018 IEEE SOUTHWEST SYMPOSIUM ON IMAGE ANALYSIS AND INTERPRETATION (SSIAI), 2018, : 57 - 60