Skip to main content
Article thumbnail
Location of Repository

Rank, trace-norm and max-norm

By Nathan Srebro and Adi Shraibman

Abstract

Abstract. We study the rank, trace-norm and max-norm as complexity measures of matrices, focusing on the problem of fitting a matrix with matrices having low complexity. We present generalization error bounds for predicting unobserved entries that are based on these measures. We also consider the possible relations between these measures. We show gaps between them, and bounds on the extent of such gaps.

Publisher: Springer-Verlag
Year: 2005
OAI identifier: oai:CiteSeerX.psu:10.1.1.133.916
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://people.csail.mit.edu/~n... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.