One-bit matrix completion (Neyman Seminar)

One-bit matrix completion (Neyman Seminar)

Neyman Seminar
Nov 21, 2012, 04:00 PM - 05:00 PM | 1011 Evans Hall | Happening As Scheduled
Yaniv Plan, Department of Mathematics, University of Michigan
The problem of recovering a matrix from an incomplete sampling of its entries—also known as matrix completion—arises in a wide variety of practical situations. In many of these settings, however, the observations are not only incomplete, but also highly quantized, often even to a single bit. Thus we ask, “Given just the signs of a subset of noisy entries of an unknown matrix, can the unknown...