A simple message-passing algorithm for compressed sensing by Chandar, Venkat B., Shah, Devavrat, Wornell, Gregory W.

“…We establish that when A corresponds to the adjacency matrix of a bipartite graph with sufficient expansion, a simple message-passing algorithm produces an estimate x^ of x satisfying ∥x-x^∥[subscript 1] ≤ O(n/k) ∥x-x[superscript(k)]∥1, where x[superscript(k)] is the best k-sparse approximation of x. …”
Get full text
Get full text
Get full text

Efficient crowdsourcing for multi-class labeling by Karger, David R, Oh, Sewoong, Shah, Devavrat

“…Technically, the algorithm is based on low-rank approximation of weighted adjacency matrix for a random regular bipartite graph, weighted according to the answers provided by the workers.…”
Get full text

Efficient crowdsourcing for multi-class labeling by Karger, David R, Oh, Sewoong, Shah, Devavrat

“…Technically, the algorithm is based on low-rank approximation of weighted adjacency matrix for a random regular bipartite graph, weighted according to the answers provided by the workers.…”
Get full text

Efficient crowdsourcing for multi-class labeling by Karger, David R., Oh, Sewoong, Shah, Devavrat

“…Technically, the algorithm is based on low-rank approximation of weighted adjacency matrix for a random regular bipartite graph, weighted according to the answers provided by the workers.…”
Get full text
Get full text