Computational Limits in Statistical Inference: Hidden Cliques and Sum of Squares

About this video

Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Explores computational complexity limits in statistical inference, focusing on hidden clique detection. Theoretical analysis connecting information-theoretic and algorithmic barriers.

A 64-minute video from Microsoft Research: “Computational Limits in Statistical Inference: Hidden Cliques and Sum of Squares”.

Video by Microsoft Research, played through YouTube's embedded player.