no code implementations • 21 Feb 2022 • Eric Balkanski, Oussama Hanguir, Shatian Wang
To the best of our knowledge, these are the first algorithms with poly$(n, m)$ query complexity for learning non-trivial families of hypergraphs that have a super-constant number of edges of super-constant size.
