Inference in Sparse Graphs with Pairwise Measurements and Side Information

AISTATS, 2018.

Cited by: 5|Views29
EI

Abstract:

We consider the statistical problem of recovering a hidden binary labeling for the vertices of a graph up to low Hamming error from noisy edge and vertex measurements. We present new algorithms and a sharp finite-sample analysis for this problem on trees and sparse graphs with poor expansion properties such as hypergrids and ring lattic...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments