solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看250次
‘China’s Google’ releases its first AI chip
来源于:MIT Technology
Approximate message passing algorithm enjoyed considerable attention in the
last decade. In this paper we introduce a variant of the AMP algorithm that
takes into account glassy nature of the system under consideration. We coin
this algorithm as the approximate survey propagation (ASP) and derive it for a
class of low-rank matrix estimation problems. We derive the state evolution for
the ASP algorithm and prove that it reproduces the one-step replica symmetry
breaking (1RSB) fixed-point equations, well-known in physics of disordered
systems. Our derivation thus gives a concrete algorithmic meaning to the 1RSB
equations that is of independent interest. We characterize the performance of
ASP in terms of convergence and mean-squared error as a function of the free
Parisi parameter s. We conclude that when there is a model mismatch between the
true generative model and the inference model, the performance of AMP rapidly
degrades both in terms of MSE and of convergence, while ASP converges 查看全文>>