Overview and Objectives
An emerging research thread in statistics and machine learning deals with finding latent structures from data represented by graphs or matrices.
This course will provide an introduction to mathematical and algorithmic tools for studying such problems.
We will discuss information-theoretic methods for determining the fundamental limits, as well as methodologies for attaining these limits,
including spectral methods, semidefinite programming relaxations, Linear/quadratic programming relaxations, message passing (belief propagation) algorithms, etc.
Specific topics will include spectral clustering, planted clique and partition problem, community detection on stochastic block models, hidden Hamiltonian cycle problem,
planted bipartite graph matching problem, noisy graph isomorphism, and statistical-computational tradeoffs.
Prerequisites: Maturity with probability theory and linear algebra.
Familiarity with statistical theory, optimization, and algorithms.
Instructor: Prof. Jiaming Xu, Fuqua W313, firstname.lastname@example.org , Office Hours: By appointment
Credit: 3 hours
Meeting times: Wed and Fri, 3:05PM - 4:20PM
Meeting location: Seminar Room G, Fuqua