• DocumentCode
    3065910
  • Title

    Information theoretic bounds for low-rank matrix completion

  • Author

    Vishwanath, Sriram

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Univ. of Texas at Austin, Austin, TX, USA
  • fYear
    2010
  • fDate
    13-18 June 2010
  • Firstpage
    1508
  • Lastpage
    1512
  • Abstract
    This paper studies the low-rank matrix completion problem from an information theoretic perspective. The completion problem is rephrased as a communication problem of an (uncoded) low-rank matrix source over an erasure channel. The paper then uses achievability and converse arguments to present order-wise optimal bounds for the completion problem.
  • Keywords
    information theory; matrix algebra; erasure channel; information theoretic bounds; low-rank matrix completion problem; order-wise optimal bounds; Algorithm design and analysis; Channel coding; Codes; Communication channels; Concrete; Quantization; Rate-distortion; The Netflix prize;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on
  • Conference_Location
    Austin, TX
  • Print_ISBN
    978-1-4244-7890-3
  • Electronic_ISBN
    978-1-4244-7891-0
  • Type

    conf

  • DOI
    10.1109/ISIT.2010.5513545
  • Filename
    5513545
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3065910