# Approximation Algorithms for $\ell_0$-Low Rank Approximation

neural information processing systems, pp. 6648-6659, 2017.

Cited by: 0|Views5

Abstract:

We study the $ell_0$-Low Rank Approximation Problem, where the goal is, given an $m times n$ matrix $A$, to output a rank-$k$ matrix $Au0027$ for which $|Au0027-A|_0$ is minimized. Here, for a matrix $B$, $|B|_0$ denotes the number of its non-zero entries. This NP-hard variant of low rank approximation is natural for problems with no unde...More

Code:

Data:

Get fulltext within 24h
Bibtex

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.

?

for 5 coins

Wechat's Red Packet
?

for 280 coins

Wechat's Red Packet
?

for 1200 coins

Wechat's Red Packet
?

for 3000 coins

Wechat's Red Packet
?