Skip to main content
SpringerLink
Log in

Learning via finitely many queries

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

This work introduces a new query inference model that can access data and communicate with the teacher by asking finitely many Boolean queries in a language L. In this model the parameters of interest are the number of queries used and the expressive power of L. We study how the learning power varies with these parameters. Results suggest that this model may help studying query inference in a resource bounded environment.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Angluin, Learning regular sets from queries and counterexamples, Information and Computation 75(2) (1987) 87–106.

    Article  Google Scholar 

  2. D. Angluin, Queries and concept learning, Machine Learning 2(2) (1988) 319–342.

    Google Scholar 

  3. D. Angluin, Queries revisited, in: Proc. of the 12th International Conference on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence, Vol. 2225 (Springer, Berlin, 2001) pp. 12–31.

    Google Scholar 

  4. D. Angluin and C. Smith, Inductive inference: Theory and methods, Computing Surveys 15 (1983) 237–269.

    Article  Google Scholar 

  5. J. Case, S. Jain, S. Lange and T. Zeugmann, Incremental concept learning for bounded data mining, Information and Computation 152 (1999) 74–110.

    Article  Google Scholar 

  6. J. Case, S. Jain, F. Montagna, G. Simi and A. Sorbi, On learning to coordinate: Random bits help, insightful normal forms, and competency isomorphisms, in: Proc. of the Sixteenth Annual Conference on Learning Theory (COLT) and Seventh Annual Workshop on Kernel Machines, Heidelberg, eds.B. Schoelkopf and M. Warmuth, Lecture Notes in Computer Science, Vol. 2777 (Springer, New York, 2003) pp. 699–713.

    Google Scholar 

  7. J. Case and C. Smith, Comparison of identification criteria for machine inductive inference, Theoretical Computer Science 25 (1983) 193–220.

    Article  Google Scholar 

  8. C. Elgot and M.O. Rabin, Decidability and undecidability of extensions of second (first) order theory of (generalized) successor, Journal of Symbolic Logic 31 (1966) 169–181.

    Google Scholar 

  9. H.B. Enderton, A Mathematical Introduction to Logic (Academic Press, New York, 1972).

    Google Scholar 

  10. R. Freivalds, E. Kinber and C. Smith, On the impact of forgetting on learning machines, Journal of ACM 42 (1995) 1146–1168.

    Article  Google Scholar 

  11. M. Fulk, S. Jain and D. Osherson, Open problems in systems that learn, Journal of Computer and System Sciences 49(3) (1994) 589–604.

    Article  Google Scholar 

  12. W. Gasarch and A.C. Lee, Inferring answers to queries, in: Proc. of the 10th Annual ACM Conference on Computational Learning Theory (1997) pp. 275–284; a more up-to-date version can be found at http://www.louisiana.edu/~cxl9999/research/inferAnswer.pdf.

  13. W. Gasarch and C. Smith, Learning via queries, Journal of ACM 39 (1992) 649–676.

    Article  Google Scholar 

  14. W. Gasarch and C.H. Smith, A survey of inductive inference with an emphasis on queries, in: Complexity, Logic, and Recursion Theory, ed. A. Sorbi, Lecture Notes in Pure and Applied Mathematics, Vol. 187 (Marcel Dekker, New York, 1997).

    Google Scholar 

  15. W.I. Gasarch and G.H. Hird, Automata techniques for query inference machines, Annals of Pure and Applied Logic 117 (2002) 169–201.

    Article  Google Scholar 

  16. W.I. Gasarch and C.H. Smith, Recursion theoretic models of learning: Some results and intuitions, Annals of Mathematics and Artificial Intelligence 15(2) (1995) 155–166.

    Google Scholar 

  17. E. Gold, Language identification in the limit, Information and Control 10 (1967) 447–474.

    Article  Google Scholar 

  18. S. Jain, D. Osherson, J. Royer and A. Sharma, Systems that Learn: An Introduction to Learning Theory, 2nd ed. (MIT Press, Cambridge, MA, 1999).

    Google Scholar 

  19. Y.V. Matiyasevich, Hilbert’s Tenth Problem, Foundations of Computing Series (MIT Press, Cambridge, MA, 1993) (Translated from the 1993 Russian original by the author, with a foreword by Martin Davis).

    Google Scholar 

  20. H. Rogers, Jr., Gödel numberings of partial recursive functions, Journal of Symbolic Logic 23 (1958) 331–341.

    Google Scholar 

  21. H. Rogers, Jr., Theory of Recursive Functions and Effective Computability (McGraw-Hill, New York, 1967).

    Google Scholar 

  22. C. Smith, The power of pluralism for automatic program synthesis, Journal of ACM 29(4) (1982) 1144–1165.

    Article  Google Scholar 

  23. C.H. Smith, Three decades of team learning, in: Proc. of the 5th International Workshop on Algorithmic Learning Theory (1994) pp. 211–228.

  24. R. Soare, Recursively Enumerable Sets and Degrees, Omega Series (Springer, Berlin, 1987).

    Google Scholar 

  25. W. Thomas, Automata on infinite objects, in: Handbook of Theoretical Computer Science, Vol. 2, ed. J.V. Leeuwen (Elsevier, Amsterdam, 1990) chapter 4, pp. 135–191.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Louisiana at Lafayette, Lafayette, LA, 70504-1771, USA

    Andrew C. Lee

Authors
  1. Andrew C. Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrew C. Lee.

Additional information

AMS subject classification

68Q05, 68Q32, 68T05, 03D10, 03D80

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lee, A.C. Learning via finitely many queries. Ann Math Artif Intell 44, 401–418 (2005). https://doi.org/10.1007/s10472-005-7035-0

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10472-005-7035-0

Keywords

Search

Navigation