Non-adaptive learning of a hidden hypergraph

Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 nonadaptive learning algorithm for learning hypergraph that asks an almost optimal number of queries.

Original languageEnglish
Title of host publicationAlgorithmic Learning Theory - 26th International Conference, ALT 2015
EditorsClaudio Gentile, Sandra Zilles, Kamalika Chaudhuri
Pages89-101
Number of pages13
DOIs
StatePublished - 2015
Event26th International Conference on Algorithmic Learning Theory, ALT 2015 - Banff, Canada
Duration: 4 Oct 20156 Oct 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9355

Conference

Conference26th International Conference on Algorithmic Learning Theory, ALT 2015
Country/TerritoryCanada
CityBanff
Period4/10/156/10/15

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Cite this