Article

Free access

On the role of procrastination for machine learning

Authors:

Rūsiņš Freivalds,

Carl H. SmithAuthors Info & Claims

COLT '92: Proceedings of the fifth annual workshop on Computational learning theory

Pages 363 - 376

https://doi.org/10.1145/130385.130426

Published: 01 July 1992 Publication History

PDF eReader

References

[1]

ANGLUIN, D. AND SMITH, C. H. Inductive inference: theory and methods. Computing Surveys 15 (1983), 237-269.

Digital Library

Google Scholar

[2]

BARZDINS, J. Two theorems on the limiting synthesis of functions. In Theory of Algorithms and Programs, Barzdins, Ed., 1, Latvian State University, Riga, U.S.S.R., 1974.

Google Scholar

[3]

BLUM, L. AND BLUM, M. Toward a mathematical theory of inductive inference. Information and Control 28 (1975), 125-155.

Crossref

Google Scholar

[4]

CASE, J. AND NGOMANGUELLE, S. Refinements of inductive inference by popperian machines. Kybernetika (1977). to appear.

Google Scholar

[5]

CASE, J. AND SMITH, C. Comparison of identification criteria for machine inductive inference. TheoreticM Computer Science 25, 2 (1983), 193- 220.

Crossref

Google Scholar

[6]

CHURCH, A. The constructive second number class. Bulliten of the AMS 44 (1938), 224-232.

Crossref

Google Scholar

[7]

CHURCH, A. AND KLEENE, S. Formal definitions in the theory of ordinal numbers. Fundamenta Mathematicae 28 (1937), 11-21.

Google Scholar

[8]

DALEY, 1%. On the error correcting power of pluralism in BC-type inductive inference. Theoretical Computer Science 24, 1 (1983), 95-104.

Crossref

Google Scholar

[9]

DALEY, R. P. ANn SMITH, C. H. On the complexity of inductive inference. Information and Control 69 (1986), 12-40.

Digital Library

Google Scholar

[10]

FREIVALDS, R. Inductive inference of recursive functions: qualitative theory. Manuscript.

Google Scholar

[11]

FREIVALDS, R., SMITH, C., AND VELAUTHAPILLAI, M. Trade-offs amongst parameters effecting the inductive inferribility of classes of recursive functions. Information and Computation 82, 3 (1989), 323-349.

Digital Library

Google Scholar

[12]

FREIVALDS, R. AND VIKSNA, J. Inductive inference up to immune sets. In Proccedings of the InternationM Workshop on Analogical and Inductive Infernece, K. Jantke, Ed., 397, Springer Verlag Lecture Notes in Artificial Intelligence, 1989.

Digital Library

Google Scholar

[13]

FRSIVALDS, R. V. ANn KINBER, E. B. Identification in the limit of minimal GSdel numbers. In Theory Of Algorithms and Programs, Barzdins, Ed., Latvian State University, Riga, U.S.S.R., 1977. Russian.

Google Scholar

[14]

GASAaCH, W., SITARAMAN, R., SMITH, C., AND VE} M. Learning programs with an easy to calculate set of errors. In Proceedings of the 1988 Workshop on Computational Learning Theory, L. Pitt, Ed., Morgan Kaufmann, San Mateo, CA., 1988.

Digital Library

Google Scholar

[15]

GOLD, E. M. Language identification in the limit. Information and Control 10 (1967), 447- 474.

Crossref

Google Scholar

[16]

KINBER, E. On some problems of identification of functions. In Machine methods of regulating discovery, Riga Polytechnical Institute, 1981. (Russian).

Google Scholar

[17]

KINBER, E. AND FREIVALDS, R. A distinction criterion for types of limiting synthesis. In Proceedings USSIt National Conference on Synthesis, Testing, Verification and Debugging of Programs, University of Latvia, Riga, USSR, 1981. (Russian).

Google Scholar

[18]

KLEENE, S. On notation for ordinal numbers. Journal of Symbolic Logic 3 (1938), 150-155.

Crossref

Google Scholar

[19]

MACHTEY, M. AND YOUNG, P. An Introduction to the General Theory of Algorithms. North- Holland, New York, 1978.

Digital Library

Google Scholar

[20]

MINICOZZI, E. Some natural properties of strongidentification in inductive inference. Theoretical Computer Science 2 (1976), 345-360.

Crossref

Google Scholar

[21]

OSHERSON, D., STOB, M., AND WEINSTEIN, S. Systems that Learn. MIT Press, Cambridge, Mass., 1986.

Google Scholar

[22]

ROGERS, H. JR. GSdel numberings of partial recursive functions. Journal of Symbolic Logic 23 (1958), 331-341.

Crossref

Google Scholar

[23]

ROGERS, H. Jl~. Theory of Recursive Functions and Effective Computability. McGraw Hill, New York, 1967.

Digital Library

Google Scholar

[24]

ROYER, J. S. Inductive inference of approximations. Information and Control 70, 2/3 (1986), 156-178.

Digital Library

Google Scholar

[25]

SMITH, C. H. The power of pluralism for automatic program synthesis. Journal of the ACM 29, 4 (1982), 1144-1165.

Digital Library

Google Scholar

[26]

SMITH, C. H. AND VELAUTHAPILLAI, M. On the inference of approximate explanations. Theoretical Computer Science 77 (1990), 249-266.

Digital Library

Google Scholar

Cited By

View all

Jain SSharma ABlum AKearns M(1996)Elementary formal systems, intrinsic complexity, and procrastinationProceedings of the ninth annual conference on Computational learning theory10.1145/238061.238093(181-192)Online publication date: 1-Jan-1996
https://dl.acm.org/doi/10.1145/238061.238093

Index Terms

On the role of procrastination for machine learning
1. Computing methodologies
  1. Artificial intelligence
    1. Knowledge representation and reasoning
      1. Logic programming and answer set programming
  2. Machine learning
2. Theory of computation
  1. Logic
  2. Models of computation
    1. Computability
      1. Recursive functions

Recommendations

Lifelong Machine Learning
Lifelong Machine Learning
Machine Learning: The State of the Art

The two fundamental problems in machine learning (ML) are statistical analysis and algorithm design. The former tells us the principles of the mathematical models that we establish from the observation data. The latter defines the conditions on which ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

COLT '92: Proceedings of the fifth annual workshop on Computational learning theory

July 1992

452 pages

ISBN:089791497X

DOI:10.1145/130385

Chairman:
David Haussler

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1992

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

COLT92

Sponsor:

COLT92: 5th Annual Workshop on Computational Learning Theory

July 27 - 29, 1992

Pennsylvania, Pittsburgh, USA

Acceptance Rates

Overall Acceptance Rate 35 of 71 submissions, 49%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
284
Total Downloads

Downloads (Last 12 months)108
Downloads (Last 6 weeks)19

Reflects downloads up to 17 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Jain SSharma ABlum AKearns M(1996)Elementary formal systems, intrinsic complexity, and procrastinationProceedings of the ninth annual conference on Computational learning theory10.1145/238061.238093(181-192)Online publication date: 1-Jan-1996
https://dl.acm.org/doi/10.1145/238061.238093

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Lifelong Machine Learning

Lifelong Machine Learning

Machine Learning: The State of the Art