A recommendation system suggests products to users based on data about user preferences. It is typically modeled by a problem of completing an m n matrix of small rank k . We give the first classical algorithm to produce a recommendation in O ( poly ( k ) polylog ( m n )) time, which is an exponential improvement on previous algorithms that run in time linear in m and n . Our strategy is inspired by a quantum algorithm by Kerenidis and Prakash: like the quantum algorithm, instead of reconstructing a user's full list of preferences, we only seek a randomized sample from the user's preferences. Our main result is an algorithm that samples high-weight entries from a low-rank approximation of the input matrix in time independent of m and n , given natural sampling assumptions on that input matrix. As a consequence, we show that Kerenidis and Prakash's quantum machine learning (QML) algorithm, one of the strongest candidates for provably exponential speedups in QML, does not in fact give an exponential speedup over classical algorithms.
展开▼
