Information recovery from pairwise measurements

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2014, Pages 2012-2016

  Chen, Yuxin ^a   Goldsmith, Andrea J ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; RECOVERY;

COMBINATORIAL ALGORITHM; CRITICAL THRESHOLD; INFORMATION RECOVERY; MEASUREMENT GRAPH; RANDOM GEOMETRIC GRAPHS; RANDOM GRAPH MODELS; SEMIDEFINITE PROGRAMS; SMALL WORLD GRAPHS;

GRAPH THEORY;

EID: 84906534114     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2014.6875186     Document Type: Conference Paper

References (17)

1. E. Abbe and A. Montanari, "The mutual information of a class of graphical channels, " in Allerton, Oct 2013, pp. 20-25.
2. E. Abbe and A. Montanari, "Conditional random fields, planted constraint satisfaction and entropy concentration, " in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013, pp. 332-346.
3. Q. Huang and L. Guibas, "Consistent shape maps via semidefinite programming, " in SGP, vol. 32, no. 5, 2013, pp. 177-186.
4. Y. Chen, L. Guibas, and Q. Huang, "Near-optimal joint object matching via convex relaxation, " International Conference on Machine Learning (ICML), June 2014. [Online]. Available: http://arxiv.org/abs/1402.1473.
5. D. Pachauri, R. Kondor, and V. Singh, "Solving the multi-way matching problem by permutation synchronization, " NIPS, December 2013.
6. D. Crandall, A. Owens, N. Snavely, and D. Huttenlocher, "SfM with MRFs: discrete-continuous optimization for large-scale structure from motion, " IEEE CVPR, pp. 3001-3008, 2011.
7. M. Cucuringu, A. Singer, and D. Cowburn, "Eigenvector synchronization, graph rigidity and the molecule problem, " Information and Inference, vol. 1, no. 1, pp. 21-67, 2012.
8. A. Bandeira, M. Charikar, A. Singer, and A. Zhu, "Multireference alignment using semidefinite programming, " ITCS, pp. 459-470, 2014.
9. E. J. Candès, X. Li, Y. Ma, and J. Wright, "Robust principal component analysis?" Journal of ACM, vol. 58, no. 3, pp. 11:1-11:37, Jun 2011.
10. A. Ganesh, J. Wright, X. Li, E. J. Candes, and Y. Ma, "Dense error correction for low-rank matrices via principal component pursuit, " in IEEE ISIT. IEEE, 2010, pp. 1513-1517.
11. Y. Chen, A. Jalali, S. Sanghavi, and C. Caramanis, "Low-rank matrix recovery from errors and erasures, " IEEE Trans on Info Theory, vol. 59, no. 7, pp. 4324-4337, 2013.
12. L. Wang and A. Singer, "Exact and stable recovery of rotations for robust synchronization, " arXiv preprint arXiv:1211.2441, 2012.
13. Z. Ma and Y. Wu, "Computational barriers in minimax submatrix detection, " arXiv preprint arXiv:1309.5914, 2013.
14. M. Kolar, S. Balakrishnan, A. Rinaldo, and A. Singh, "Minimax localization of structural information in large noisy matrices, " in Advances in Neural Information Processing Systems, 2011, pp. 909-917.
15. D. Shah, Gossip algorithms. Now Publishers Inc, 2009.
16. S. Verdu et al., "Generalizing the Fano inequality, " IEEE Transactions on Information Theory, vol. 40, no. 4, pp. 1247-1251, 1994.
17. Y. Chen and A. J. Goldsmith, "Joint information recovery from graphbased measurements, " in preparation, 2014.