中俄数学研究生讨论班——The Algorithmic Phase Transition for Correlated Spiked Models
报告人：李章颂(伊人直播
）
时间：2025-12-05 17:00-18:00
地点：智华楼四元厅
Abstract: Modern multi-modal learning often relies on the premise that jointly analyzing multiple, related datasets can yield more powerful inferences than processing each one in isolation. We study this through the lens of a pair of spiked random matrices with correlated spikes. By proposing a novel subgraph counts algorithm, we show that the correlation between the spikes can be exploited for inference even in certain regimes where inference in each individual matrix is believed to be computationally intractable. Furthermore, we provide evidence for a matching computational lower bound based on the low-degree polynomial framework, suggesting our algorithm is optimal. Our results thus establish a new computational phase transition in correlated spiked models, delineating the boundary between what is efficiently possible and what is not. Based on arXiv:2511.06040.
Online link: //meeting.tencent.com/dm/4TGPAsgr42lx
