Skip to main content
Springer Nature Link
Log in

Disjunctions of negated counting functions are efficiently learnable with equivalence queries

  • Session 6A: Parallel Alg./Learning
  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 959))

Included in the following conference series:

  • 142 Accesses

Abstract

One open problem regarding learning counting functions is whether disjunctions of negated counting functions with a constant prime modulus p are efficiently learnable with equivalence queries. We give a positive solution to this problem by showing that for any constant prime p, conjunctions of counting functions with modulus p over the domain Z np is efficiently learnable with at most (n+1)p−1+1 equivalence queries. We further prove that any disjunctions of counting functions and negated counting functions with a constant prime modulus p over the domain Z np are also efficiently learnable with at most (n+1)p−1+1 equivalence queries.

The author was supported by NSF grants CCR-9103055 and CCR-9400229.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Angluin, “Queries and concept learning”, Machine Learning, 2, 1988, pages 319–342.

    Google Scholar 

  2. A. Bertoni, N. Cesa-Bianchi, G. Fiorino, “Efficient learning with equivalence queries of conjunctions of modulo functions”, submitted to Information Processing Letters, 1995.

    Google Scholar 

  3. A. Blum, Personal Communication, 1994.

    Google Scholar 

  4. A. Blum, P. Chalasani, J. Jackson, “On learning embedded symmetric concepts”, Proc. of the 6th ACM Annual Conference on Computational Learning Theory, pages 337–346, 1993.

    Google Scholar 

  5. N. Bshouty, Z, Chen, S. Decatur, S. Homer, “On the learnability of Z N-DNF formulas”, Proc. of the 8th ACM Annual Conference on Computational Learning Theory, 1995.

    Google Scholar 

  6. Z. Chen, S. Homer, “On learning counting functions with queries” Proc. of the 7th ACM Annual Conference on Computational Learning Theory, pages 218–227, 1994.

    Google Scholar 

  7. D. Helmbold, R. Sloan, M. Warmuth, “Learning integer lattices”, SIAM J. Comput., 1992, pages 240–266.

    Google Scholar 

  8. R. Rivest, Personal Communication, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Boston University, 02215, Boston, MA, USA

    Zhixiang Chen

Authors
  1. Zhixiang Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ding-Zhu Du Ming Li

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, Z. (1995). Disjunctions of negated counting functions are efficiently learnable with equivalence queries. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030849

Download citation

  • DOI: https://doi.org/10.1007/BFb0030849

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60216-3

  • Online ISBN: 978-3-540-44733-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics