Exact Learning Nader H. Bshouty Richard Cleve Ricard Gavald`a Sampath Kannan...  Home/Search
Context
Related
| pages.cpsc.ucalgar...s_queries_learn.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: pages.cpsc.ucalgary.ca/~cleve/... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show that the class of all circuits is exactly learnable in randomized expected polynomial time using subset and 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... (Update)
Similar documents (at the sentence level):
73.2%: Oracles and Queries that are Sufficient for Exact.. - Bshouty, Cleve.. (1996) (Correct)
Active bibliography (related documents): More All
0.4: How Many Queries are Needed to Learn? - Lisa Hellerstein Eecs (1996) (Correct)
0.2: A General Dimension for Query Learning - Jos'e Balc'azar Jorge (Correct)
0.1: Attribute-Efficient Learning in Query and Mistake-Bound Models - Bshouty, al. (1996) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ nader-oracles,
author = "Exact Learning Nader",
title = "Oracles and Queries that are Sufficient for",
url = "citeseer.ist.psu.edu/765297.html" }
Citations (may not include all citations):493 Communications of the ACM (context) - Valiant, of et al. - 1984
441 Queries and Concept Learning (context) - Angluin - 1988
317 Learning Quickly When Irrelevant Attributes Abound: A New Li.. (context) - Littlestone - 1988
145 Random Generation of Combinatorial Structures from a Uniform.. (context) - Jerrum, Valiant et al. - 1986
144 Computational Limitations on Learning from Examples (context) - Pitt, Valiant - 1988
128 A Complexity Theoretic Approach to Randomness (context) - Sipser - 1983
116 Some Connections Between Nonuniform and Uniform Complexity C.. (context) - Karp, Lipton - 1980
96 Learning Decision Trees using the Fourier Spectrum - Kushilevitz, Mansour - 1991
74 Exact Learning via the Monotone Theory (context) - Bshouty - 1993
44 Short Monotone Formulae for the Majority Function (context) - Valiant - 1984
25 Reliable Circuits Using Less Reliable Relays (context) - Moore, Shannon - 1956
18 Amplification of Probabilistic Boolean Formulas (context) - Boppana - 1989
18 Learning Binary Relations and Total Orders - Goldman, Rivest et al. - 1993
17 the Exact Learning of Formulas in Parallel (context) - Bshouty, Cleve - 1992
11 On Approximation Algorithms for #P (context) - Stockmeyer - 1985
11 Personal communication (context) - Watanabe - 1994
9 the Query Complexity of Learning (context) - Kannan - 1993
4 the Power of Equivalence Queries - Gavalda - 1993
2 Negative Results for Equivalence Queries Machine Learning (context) - Angluin - 1990
Documents on the same site (http://pages.cpsc.ucalgary.ca/~cleve/pubs/): More
The query complexity of order-finding - Richard Cleve Department (Correct)
quant-ph/9802049 - Sep Quantum Lower (Correct)
Fast parallel circuits for the quantum Fourier transform - Richard Cleve John (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC