Blessing of scalability: a tractable l-0 approach for large graph estimation
主 题: Blessing of scalability: a tractable l-0 approach for large graph estimation
报告人: Mengdi Wang (Princeton University)
时 间: 2015-01-07 14:00-15:00
地 点: Room 77201 at #78 courtyard, BICMR（主持人：文再文）
Estimating the topology of graphical models has been a critical problem in high-dimensional statistics. In large-scale graphs, the prior knowledge can be formulated as a total sparsity budget constraints. This induces a nonconvex optimization problem involving l-0 constraint. An interesting observation is: as the graph size increases, the associated optimization problem becomes increasingly convex. This motives the use of the dual decomposition method for finding estimating the graph topology. Through analyzing the duality gap, we can prove that the estimator has nice scalable statistical properties.
