We show that the class of all circuits is exactly learnable in randomized expected polynomial time using weak subset and weak superset queries. This is a consequence of the following result which we consider to be of independent interest: circuits are exactly learnable in randomized expected polynomial time with equivalence queries and the aid of an NP oracle. We also show that circuits are exactly learnable in deterministic polynomial time with equivalence queries and a Sigma-3 oracle. The paper also contains results on: learning of DNF formulas, learning with membership queries, and an application to Structural Complexity Theory.
CitationBhousty, N., Cleve, R., Gavaldà, R., Kannan, S., Tamon, C. "Oracles and queries that are sufficient for exact learning". 1994.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: firstname.lastname@example.org