Skip to main content
SpringerLink
Log in

Hardness of Proper Learning

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Algorithms

  • 137 Accesses

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Alekhnovich M, Braverman M, Feldman V, Klivans A, Pitassi T (2008) The complexity of properly learning simple classes. J Comput Syst Sci 74(1):16–34

    Article  MathSciNet  MATH  Google Scholar 

  2. Ben-David S, Eiron N, Long PM (2003) On the difficulty of approximately maximizing agreements. J Comput Syst Sci 66(3):496–514

    Article  MathSciNet  MATH  Google Scholar 

  3. Blum AL, Rivest RL (1992) Training a 3-node neural network is NP-complete. Neural Netw 5(1):117–127

    Article  Google Scholar 

  4. Blumer A, Ehrenfeucht A, Haussler D, Warmuth M (1989) Learnability and the Vapnik-Chervonenkis dimension. J ACM 36(4):929–965

    Article  MathSciNet  MATH  Google Scholar 

  5. Bshouty N (1995) Exact learning via the monotone theory. Inform Comput 123(1):146–153

    Article  MathSciNet  MATH  Google Scholar 

  6. Feldman V, Gopalan P, Khot S, Ponuswami A (2009) On agnostic learning of parities, monomials and halfspaces. SIAM J Comput 39(2):606–645

    Article  MathSciNet  MATH  Google Scholar 

  7. Feldman V (2009) Hardness of approximate two-level logic minimization and pac learning with membership queries. J Comput Syst Sci 75(1):13–26

    Article  MathSciNet  MATH  Google Scholar 

  8. Feldman V, Guruswami V, Raghavendra P, Wu Y (2012) Agnostic learning of monomials by halfspaces is hard. SIAM J Comput 41(6):1558–1590

    Article  MathSciNet  MATH  Google Scholar 

  9. Garey M, Johnson DS (1979) Computers and intractability. W.H. Freeman, San Francisco

    MATH  Google Scholar 

  10. Guruswami V, Raghavendra P (2009) Hardness of learning halfspaces with noise. SIAM J Comput 39(2):742–765

    Article  MathSciNet  MATH  Google Scholar 

  11. Hancock T, Jiang T, Li M, Tromp J (1995) Lower bounds on learning decision lists and trees. In: Mayr EW, Puech C (eds) STACS 95: 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, pp 527–538. Springer, Berlin/Heidelberg

    Chapter  Google Scholar 

  12. Haussler D (1992) Decision theoretic generalizations of the PAC model for neural net and other learning applications. Inform Comput 100(1):78–150

    Article  MathSciNet  MATH  Google Scholar 

  13. Jackson J (1997) An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. J Comput Syst Sci 55:414–440

    Article  MATH  Google Scholar 

  14. Kearns M, Schapire R, Sellie L (1994) Toward efficient agnostic learning. Mach Learn 17(2–3):115–141

    MATH  Google Scholar 

  15. Kearns M, Valiant L (1994) Cryptographic limitations on learning boolean formulae and finite automata. J ACM 41(1):67–95

    Article  MathSciNet  MATH  Google Scholar 

  16. Kearns M, Vazirani U (1994) An introduction to computational learning theory. MIT, Cambridge

    Google Scholar 

  17. Khot S, Saket R (2011) On the hardness of learning intersections of two halfspaces. J Comput Syst Sci 77(1):129–141

    Article  MathSciNet  MATH  Google Scholar 

  18. Pitt L, Valiant L (1988) Computational limitations on learning from examples. J ACM 35(4):965–984

    Article  MathSciNet  MATH  Google Scholar 

  19. Valiant LG (1984) A theory of the learnable. Commun ACM 27(11):1134–1142

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Research – Almaden, San Jose, CA, USA

    Vitaly Feldman

Authors
  1. Vitaly Feldman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vitaly Feldman .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Feldman, V. (2016). Hardness of Proper Learning. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_177

Download citation

Publish with us

Policies and ethics

Search

Navigation