Sketching Sparse Low-Rank Matrices With Near-Optimal Sample- and Time-Complexity Using Message Passing.
Xiaoqi LiuRamji VenkataramananPublished in: IEEE Trans. Inf. Theory (2023)
Keyphrases
- message passing
- low rank matrices
- belief propagation
- distributed systems
- low rank
- approximate inference
- singular value decomposition
- markov random field
- graphical models
- low rank matrix
- image sequences
- matrix completion
- computer vision
- model selection
- data sets
- matrix factorization
- objective function
- low rank approximation