Non-Adaptive Learning a Hidden Hipergraph
Machine Learning
2015-02-17 v1
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.
Cite
@article{arxiv.1502.04137,
title = {Non-Adaptive Learning a Hidden Hipergraph},
author = {Hasan Abasi and Nader H. Bshouty and Hanna Mazzawi},
journal= {arXiv preprint arXiv:1502.04137},
year = {2015}
}