Abstract
This paper is concerned with the algorithmic learning where the learner is allowed to make finite but bounded number of mind changes. Briefly, in our learning paradigm, a learner is given examples from a recursive function, which the learner attempts to learn by producing programs to compute that function. We say that a team is successful if at least one member of the team learns the target function. The problem, given two teams with bounded number of learners and mind changes whether one team can provably learn more than the other team has been open for the last fifteen years. This paper makes significant progress toward a complete solution of this problem. In the case of error-free learning, this paper solves the open problem. Finally, in the case of EX learning our result shows that there is no team with a≥0 mind changes whose learning power is exactly equal to a single learner with bounded b(≠ a) number of mind changes. In the case of PEX learning we have a positive answer.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Angluin, D., and Smith, C.H. (1983), Inductive inference: Theory and Methods, Computing Surveys, 15, 237–269.
Angluin, D., and Smith, C.H. (1987), Inductive inference, in Encyclopedia of Artificial Intelligence (S. Shapiro), pp. 409–418, Wiley, New York.
Barzdin, J.A.(1974), Two theorems on the limiting synthesis of functions, in Theory of Algorithms and Programs (Barzdin, Ed.), Vol. 1, 82–88, Latvian State University, Riga, USSR.
Barzdin, J.A., and Freivalds, R.V. (1972), On the prediction of general recursive functions, Soviet Math. Dokl., 13, 1224–1228.
Blum, L., and Blum, M., (1975), Toward a mathematical theory of inductive inference, Information and Control, 28, 125–155.
Case, J., and Smith, C.H. (1983), Comparison of identification criteria for machine inductive inference, Theoretical Computer Science, 25, 193–220.
R. Daley, and B. Kalyanasundaram, Capabilities of Probabilistic Learners with Bounded Mind Changes, In Proceedings of the 1993 Workshop on Computational Learning Theory, 1993, 182–191.
R. Daley, and B. Kalyanasundaram, Use of reduction arguments in determining Popperian FINite learning capabilities, In Proceedings of Algorithmic Learning Theory, 1993, 173–186.
R. Daley, and B. Kalyanasundaram, Probabilistic and Pluralistic Learners with Mind Changes, In Proceedings of Mathematical Foundations of Computer Science, 1992, 218–226.
R. Daley, B. Kalyanasundaram, and M. Velauthapillai, Breaking the probability 1/2 barrier in FIN-type learning, In Proceedings of the 1992 Workshop on Computational Learning Theory, 1992, 203–217.
R. Daley, L. Pitt, M. Velauthapillai, and T. Will, Relations between probabilistic and team one-shot learners, In Proceedings of the 1991 Workshop on Computational Learning Theory, 1991, 228–239.
Daley, R.P., and Smith, C.H. (1986), On the complexity of inductive inference, Information and Control. 69, 12–40.
R.V. Freivalds, Finite Identification of General Recursive Functions by Probabilistic Strategies, Akademie Verlag, Berlin, 1979.
R.V. Freivalds, C.H. Smith, and M. Velauthapillai, Trade-off among Parameters Affecting Inductive Inference, Information and Computation (1989), 82, 323–349.
Gold, E. M., Learning Identification in the Limit, Information and Control, vol 10, 1967, pp. 447–474.
Jantke, K. P. and Beick, H. R. (1981), Combining postulates of naturalness in inductive inference, Electron. Inform. Kebernet. 17, 465–484.
S. Jain, and A. Sharma, Finite learning by a team, In Proceedings of the 1990 Workshop on Computational Learning Theory, 1990, 163–177.
Machtey, M., and Young, P. (1978), An Introduction to General Theory of Algorithms, North-Holland, New York.
L. Pitt, Probabilistic inductive inference, J. ACM 36(2), 1989, 383–433.
L. Pitt, and C. Smith, Probability and plurality for aggregations of learning machines, Information and Computation 77(1), 1988, 77–92.
C. H. Smith, The Power of Pluralism for Automatic Program Synthesis, Journal of the Association for Computing Machinery, vol 29, 1982, pp. 1144–1165.
L. G. Valiant, A theory of Learnable, Communications of the ACM, vol 27, 1987, pp.1134–1142.
R. Wiehagen, R. Freivalds, and E. Kinber, On the power of probabilistic strategies in inductive inference. Theoretical Computer Science, 1984, 111–113.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kalyanasundaram, B., Velauthapillai, M. (1995). Simulating teams with many conjectures. In: Jantke, K.P., Shinohara, T., Zeugmann, T. (eds) Algorithmic Learning Theory. ALT 1995. Lecture Notes in Computer Science, vol 997. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60454-5_39
Download citation
DOI: https://doi.org/10.1007/3-540-60454-5_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60454-9
Online ISBN: 978-3-540-47470-8
eBook Packages: Springer Book Archive