Agreement theorems for high dimensional expanders in the small soundness regime: the role of covers
Yotam Dikstein, Irit Dinur

TL;DR
This paper investigates agreement theorems for high-dimensional expanders, revealing that their small soundness behavior is governed by topological covers, leading to new conditions for agreement and lift-decoding based on cover connectivity.
Contribution
It introduces a novel analysis of agreement theorems in high-dimensional expanders using topological covers, establishing conditions under which agreement and lift-decoding hold or fail.
Findings
If no connected covers exist, agreement theorems hold under expansion conditions.
Presence of a connected cover causes agreement theorems to fail.
Lift-decoding is possible when a connected cover exists and expansion conditions are met.
Abstract
Given a family of subsets of and an ensemble of local functions , an agreement test is a randomized property tester that is supposed to test whether there is some global function such that for many sets . A "classical" small-soundness agreement theorem is a list-decoding statement, saying that \[\tag{} Agree(\{f_s\}) > \varepsilon \quad \Longrightarrow \quad \exists G^1,\dots, G^\ell,\quad P_s[f_s\overset{0.99}{\approx}G^i|_s]\geq poly(\varepsilon),\;i=1,\dots,\ell. \] Such a statement is motivated by PCP questions and has been shown in the case where , or where is a collection of low dimensional subspaces of a vector space. In this work we study small the case of on high dimensional expanders . It has been an open challenge to analyze their small soundness behavior.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Complexity and Algorithms in Graphs · semigroups and automata theory
