An upper bound for permanents of nonnegative matrices.
Alex SamorodnitskyPublished in: J. Comb. Theory, Ser. A (2008)
Keyphrases
- upper bound
- lower bound
- data matrix
- nonnegative matrix factorization
- matrix approximation
- worst case
- upper and lower bounds
- factor matrices
- singular value decomposition
- branch and bound
- objective function
- lower and upper bounds
- branch and bound algorithm
- low rank matrix approximation
- linear programming
- least squares
- matrix factorization
- sample complexity
- tensor factorization
- matrix decomposition
- pairwise comparison
- matrix completion
- matrix factorisation
- projection matrices
- single item
- high dimensional
- matrix representation
- constant factor
- coefficient matrix
- singular values
- error probability
- covariance matrices
- generalization error
- search algorithm