منابع مشابه
A Fast Greedy Algorithm for Generalized Column Subset Selection
This paper defines a generalized column subset selection problem which is concerned with the selection of a few columns from a source matrix A that best approximate the span of a target matrix B. The paper then proposes a fast greedy algorithm for solving this problem and draws connections to different problems that can be efficiently solved using the proposed algorithm. 1 Generalized Column Su...
متن کاملGreedy Column Subset Selection: New Bounds and Distributed Algorithms
The problem of column subset selection has recently attracted a large body of research, with feature selection serving as one obvious and important application. Among the techniques that have been applied to solve this problem, the greedy algorithm has been shown to be quite effective in practice. However, theoretical guarantees on its performance have not been explored thoroughly, especially i...
متن کاملTransfer Learning Through Greedy Subset Selection
We study the binary transfer learning problem, focusing on how to select sources from a large pool and how to combine them to yield a good performance on a target task. In particular, we consider the transfer learning setting where one does not have direct access to the source data, but rather employs the source hypotheses trained from them. Building on the literature on the best subset selecti...
متن کاملRegularized Focuss for Subset Selection in Noise
This paper considers subset selection in the presence of noise via algorithms that minimize diversity measures. This leads to iterative procedures like regularized FOCUSS in which each iteration involves the solution to a regularized least squares problem. Several di erent methods for choosing the regularization parameter such as the discrepancy principle and the L-curve technique are evaluated...
متن کاملColumn subset selection is NP-complete
Let M be a real r × c matrix and let k be a positive integer. In the column subset selection problem (CSSP), we need to minimize the quantity M − SA, where A can be an arbitrary k × c matrix, and S runs over all r × k submatrices of M. This problem and its applications in numerical linear algebra are being discussed for several decades, but its algorithmic complexity remained an open issue. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2019
ISSN: 0020-0255
DOI: 10.1016/j.ins.2019.02.039