Lower bounds for quantized matrix completion.
Mary WoottersYaniv PlanMark A. DavenportEwout van den BergPublished in: ISIT (2013)
Keyphrases
- matrix completion
- lower bound
- low rank
- upper bound
- singular values
- matrix factorization
- objective function
- rank aggregation
- worst case
- optimal solution
- np hard
- collaborative filtering
- incomplete data
- missing data
- convex optimization
- kernel matrix
- convex relaxation
- optimization methods
- data sets
- small number
- theoretical guarantees
- social networks