Skip to main content

Certificate Complexity and Exact Learning

  • Living reference work entry
  • First Online:
Book cover Encyclopedia of Algorithms
  • 212 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Recommended Reading

  1. Alekhnovich M, Braverman M, Feldman V, Klivans AR, Pitassi T (2004) Learnability and automatizability. In: Proceedings of the 45th annual IEEE symposium on foundations of computer science (FOCS ’04), Rome. IEEE Computer Society, Washington, DC, pp 621–630

    Google Scholar 

  2. Angluin D (1987) Queries and concept learning. Mach Learn 2(4):319–342

    Google Scholar 

  3. Angluin D (2004) Queries revisited. Theor Comput Sci 313(2):175–194

    Article  MATH  MathSciNet  Google Scholar 

  4. Balcan N, Hanneke S (2012) Robust interactive learning. In: Proceedings of the twenty fifth annual conference on learning theory (COLT ’12), Edinburgh, pp 20.1–20.34

    Google Scholar 

  5. Balcázar JL, Castro J, Guijarro D, Köbler J, Lindner W (2007) A general dimension for query learning. J Comput Syst Sci 73(6):924–940

    Article  MATH  Google Scholar 

  6. Balcázar JL, Castro J, Guijarro D, Simon H-U (2002) The consistency dimension and distribution-dependent learning from queries. Theor Comput Sci 288(2):197–215

    Article  MATH  Google Scholar 

  7. Feldman V (2006) Hardness of approximate two-level logic minimization and PAC learning with membership queries. In: Proceedings of the 38th annual ACM symposium on the theory of computing (STOC ’06), Seattle. ACM, New York, pp 363–372

    Google Scholar 

  8. Hegedüs T (1995) Generalized teaching dimensions and the query complexity of learning. In: Proceedings of the 8th annual conference on computational learning theory (COLT ’95), Santa Cruz, pp 108–117

    Google Scholar 

  9. Hellerstein L, Raghavan V (2005) Exact learning of DNF formulas using DNF hypotheses. J Comput Syst Sci 70(4):435–470

    Article  MATH  MathSciNet  Google Scholar 

  10. Hellerstein L, Pillaipakkamnatt K, Raghavan V, Wilkins D (1996) How many queries are needed to learn? J ACM 43(5):840–862

    Article  MATH  MathSciNet  Google Scholar 

  11. Hellerstein L, Kletenik D, Sellie L, Servedio R (2012) Tight bounds on proper equivalence query learning of DNF. In: Proceedings of the 25th annual conference on learning theory (COLT ’12), Edinburgh, pp 31.1—31.18

    Google Scholar 

  12. Köbler J, Lindner W (2000) Oracles in \(\Sigma ^{\mathrm{p}}_{2}\) are sufficient for exact learning. Int J Found Comput Sci 11(4):615–632

    Article  Google Scholar 

  13. Moshkov MY (1983) Conditional tests. Probl Kibern (in Russian) 40:131–170

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lisa Hellerstein .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer Science+Business Media New York

About this entry

Cite this entry

Hellerstein, L. (2015). Certificate Complexity and Exact Learning. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-3-642-27848-8_66-2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27848-8_66-2

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, Boston, MA

  • Online ISBN: 978-3-642-27848-8

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics