Year: 2017
Type: conference-paper
Abstract: We consider tensor factorizations using a generative model and a Bayesian approach. We compute rigorously the mutual information, the Minimal Mean Square Error (MMSE), and unveil information-theoretic phase transitions. In addition, we study the performance of Approximate Message Passing (AMP) and show that it achieves the MMSE for a large set of parameters, and that factorization is algorithmically “easy” in a much wider region than previously believed. It exists, however, a “hard” region where AMP fails to reach the MMSE and we conjecture that no polynomial algorithm will improve on AMP.
Authors: Thibault Lesieur, Leo Miolane, Marc Lelarge, Florent Krzakala, Lenka Zdeborova
Language: English
Subfield: Computational Mathematics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2585411378
