2.5k citations · 10k across the 171 of their papers we have counts for
6 papers · 1 filter
Spectral algorithms for tensor completion
Andrea Montanari, Nike Sun
In the tensor completion problem, one seeks to estimate a low-rank tensor based on a random sample of revealed entries. In terms of the required sample size, earlier work revealed…
How Well Do Local Algorithms Solve Semidefinite Programs?
Zhou Fan, Andrea Montanari
Several probabilistic models from high-dimensional statistics and machine learning reveal an intriguing --and yet poorly understood-- dichotomy. Either simple local algorithms succ…
The Landscape of Empirical Risk for Non-convex Losses
Song Mei, Yu Bai, Andrea Montanari
Most high-dimensional estimation and prediction methods propose to minimize a cost function (empirical risk) that is written as a sum of losses associated to each data point. In th…
Performance of a community detection algorithm based on semidefinite programming
Adel Javanmard, Andrea Montanari, Federico Ricci-Tersenghi
The problem of detecting communities in a graph is maybe one the most studied inference problems, given its simplicity and widespread diffusion among several disciplines. A very co…
A Grothendieck-type inequality for local maxima
Andrea Montanari
A large number of problems in optimization, machine learning, signal processing can be effectively addressed by suitable semidefinite programming (SDP) relaxations. Unfortunately,…
Online Rules for Control of False Discovery Rate and False Discovery Exceedance
Adel Javanmard, Andrea Montanari
Multiple hypothesis testing is a core problem in statistical inference and arises in almost every scientific field. Given a set of null hypotheses $\mathcal{H}(n) = (H_1,\dotsc, H_…