Learning a Latent Simplex in Input-Sparsity Time

Ainesh Bakshi, Chiranjib Bhattacharyya, Ravi Kannan +2

We consider the problem of learning a latent $k$-vertex simplex $K\subset {\mathbb{R}}^d$, given access to $A\in {\mathbb{R}}^{d\times n}$, which can be viewed as a data matrix with $n$…