Non-Adaptive Learning a Hidden Hipergraph

TL;DR

This paper introduces a polynomial-time non-adaptive algorithm for learning hidden hypergraphs efficiently with near-optimal query complexity, improving over previous exponential-time methods.

Contribution

It presents the first polynomial-time non-adaptive learning algorithm for hidden hypergraphs with near-optimal query complexity.

Findings

Algorithm runs in polynomial time

Achieves near-optimal number of queries

Outperforms previous exponential-time algorithms

Abstract

We give a new deterministic algorithm that non-adaptively learns a hidden hypergraph from edge-detecting queries. All previous non-adaptive algorithms either run in exponential time or have non-optimal query complexity. We give the first polynomial time non-adaptive learning algorithm for learning hypergraph that asks almost optimal number of queries.