Search Results for author: Dimitris S. Papailiopoulos

Found 2 papers, 0 papers with code

The Sparse Principal Component of a Constant-rank Matrix

no code implementations20 Dec 2013 Megasthenis Asteris, Dimitris S. Papailiopoulos, George N. Karystinos

In this work, we prove that, if the matrix is positive semidefinite and its rank is constant, then its sparse principal component is polynomially computable.

Sparse PCA through Low-rank Approximations

no code implementations3 Mar 2013 Dimitris S. Papailiopoulos, Alexandros G. Dimakis, Stavros Korokythakis

A key algorithmic component of our scheme is a combinatorial feature elimination step that is provably safe and in practice significantly reduces the running complexity of our algorithm.

Cannot find the paper you are looking for? You can Submit a new open access paper.