Coboundary Expansion and Locally Testable Codes @SimonsInstitute
Coboundary Expansion and Locally Testable Codes  @SimonsInstitute
Uploaded September 2026 | Updated September 2026, 2 weeks ago
Siqi Liu (Duke University)
https://simons.berkeley.edu/talks/siqi-liu-duke-university-2026-09-03
Joint Boot Camp: Spectral Theory Beyond Graphs + Pseudorandomness and High-Dimensional Expansion

In this series of talks, we introduce coboundary expansion, a generalization of graph expansion to higher-dimensional complexes. Coboundary expansion can be understood both as a high-dimensional isoperimetric inequality and as a local testability property of codes arising from these complexes. We will first present the coding-theoretic definition of coboundary expansion. We will then introduce Gromov’s cone method, a fundamental technique for proving coboundary expansion. Finally, we will dive into an application of coboundary expansion: the Evra–Kaufman result that local spectral expanders with coboundary-expanding links give rise to locally testable codes.
Coboundary Expansion and Locally Testable CodesTalk by Max Hopkins (Institute for Advanced Study)Symbiotic Relations between Decoupled Training, Optimization, and Federated LearningSparse Random Graphs and Random Matrix StatisticsNatural behavior is learned through dopamine-mediated reinforcementRandom hyperbolic surfacesFrom the Ball-proximal (Broximal) Point Method to Efficient Training of LLMPrivacy of Decentralized Machine LearningLightning Talks!Tutorial: Federated Optimization, Part IResearch on sensitive dataTutorial: Federated Optimization, Part II
Simons Institute for the Theory of Computing |

Coboundary Expansion and Locally Testable Codes

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER