activity
19972026
most citedMessage Passing Algorithms for Compressed Sensing

2.5k citations · 10k across the 171 of their papers we have counts for

collaborators
Showing 2012Show all

6 papers · 1 filter

math.PR2012

State Evolution for General Approximate Message Passing Algorithms, with Applications to Spatial Coupling

Adel Javanmard, Andrea Montanari

We consider a class of approximated message passing (AMP) algorithms and characterize their high-dimensional behavior in terms of a suitable state evolution recursion. Our proof ap…

math.OC2012

Accelerated Time-of-Flight Mass Spectrometry

Morteza Ibrahimi, Andrea Montanari, George S Moore

We study a simple modification to the conventional time of flight mass spectrometry (TOFMS) where a \emph{variable} and (pseudo)-\emph{random} pulsing rate is used which allows for…

cs.LG2012★ 45 cited

Guess Who Rated This Movie: Identifying Users Through Subspace Clustering

Amy Zhang, Nadia Fawaz, Stratis Ioannidis +1

It is often the case that, within an online recommender system, multiple users share a common account. Can such shared accounts be identified solely on the basis of the user- provi…

cs.IR2012

Identifying Users From Their Rating Patterns

José Bento, Nadia Fawaz, Andrea Montanari +1

This paper reports on our analysis of the 2011 CAMRa Challenge dataset (Track 2) for context-aware movie recommendation systems. The train dataset comprises 4,536,891 ratings provi…

math.PR2012★ 221 cited

Universality in polytope phase transitions and message passing algorithms

Mohsen Bayati, Marc Lelarge, Andrea Montanari

We consider a class of nonlinear mappings in indexed by symmetric random matrices with independent entries. Within sp…

cs.IT2012

Subsampling at Information Theoretically Optimal Rates

Adel Javanmard, Andrea Montanari

We study the problem of sampling a random signal with sparse support in frequency domain. Shannon famously considered a scheme that instantaneously samples the signal at equispaced…