Article

Free access

Capabilities of probabilistic learners with bounded mind changes

Authors:

Robert Daley,

Bala KalyanasundaramAuthors Info & Claims

COLT '93: Proceedings of the sixth annual conference on Computational learning theory

Pages 182 - 191

https://doi.org/10.1145/168304.168329

Published: 01 August 1993 Publication History

PDF eReader

References

[1]

R. Daley, and B. Kalyanasundaram, Probabilistic and Pluralistic Learners with Mind Changes, In Proceedings of the 199~ Conference on Mathematical Foundations of Computer Sczence, 218-226, 1992.

Digital Library

Google Scholar

[2]

R. Daley, B. Kalyanasundaram, and M. Velauthapillai, Breaking the Probability ~ Barrier in FIN-Type Learning, In Proceedings of the 1992 Workshop on Computatzonal Learning Theory, 203- 217, 1992.

Digital Library

Google Scholar

[3]

R. Daley, B. Kalyanasundaram, and M. Velauthapillai, The Power of Probabilism in Popperian FINite Learning, In Proceedings of the 1992 Workshop on Analogzcal and Inductive Inference, 151- 169, 1992.

Digital Library

Google Scholar

[4]

R. Daley, L. Pitt, M. Velauthapillai, and T. 'Will, Relations between probabilistic and team one-.shot learners, In Proceedings of the 1991 Workshop on Computatzonal Learmng Theory, 228-239, 1991.

Digital Library

Google Scholar

[5]

R.V. Freivalds, Finite Identification of General Recursive Functions by Probabilistic Strategies, Akademie Verlag, Berlin, 1979.

Google Scholar

[6]

E. M. Gold, Language identification in the limit, Informatzon and Control, 10:447-474, 1967.

Crossref

Google Scholar

[7]

M. Krikis, and R.V. Freivalds, Inductive Inference of Total Recursive Functions by Probabilistic and Deterministic Strategies, technical report, YALEU/DCS/TR-936, Nov. 1992.

Google Scholar

[8]

S. Jain, and A. Sharma, Finite learning by a team, In Proceedings of the 1990 Workshop on Computatwnal Learning Theory, 163-177, 1990.

Digital Library

Google Scholar

[9]

L. Pitt, Probabilistic inductive inference, J. ACM, 36(2):383-433, 1989.

Digital Library

Google Scholar

[10]

L. Pitt, and C. Smith, Probability and plurality for aggregations of learning machines, Information and Computatzon, 77(1):77-92, 1988.

Digital Library

Google Scholar

[11]

C. H. Smith, The power of pluralism for automatic program synthesis, J. ACM, 29:1144-1165, 198'.2.

Digital Library

Google Scholar

[12]

M. Velauthapillai, Inductive inference with a bounded number of mind changes, In Proceedings of the 1989 Workshop on Computational Learnzng Theory, 200-213, 1989.

Digital Library

Google Scholar

[13]

R. Wiehagen, R. Freivalds, and E. Kinber, On the power of probabilistic strategies in inductive inference, Theoretical Computer $czence, 111-113, 1984.

Google Scholar

Cited By

View all

Kalyanasundaram BVelauthapillai M(2013)Learning Behaviors of Functions with TeamsFundamenta Informaticae10.5555/2594908.2594909124:3(251-270)Online publication date: 1-Jul-2013
https://dl.acm.org/doi/10.5555/2594908.2594909
Kalyanasundaram BVelauthapillai M(2010)Learning Behaviors of FunctionsFundamenta Informaticae10.5555/1803682.180368598:2-3(183-198)Online publication date: 1-Apr-2010
https://dl.acm.org/doi/10.5555/1803682.1803685
Kalyanasundaram BVelauthapillai M(2008)Taming teams with mind changesJournal of Computer and System Sciences10.1016/j.jcss.2007.06.00874:4(513-526)Online publication date: 1-Jun-2008
https://dl.acm.org/doi/10.1016/j.jcss.2007.06.008
Show More Cited By

Index Terms

Capabilities of probabilistic learners with bounded mind changes

Recommendations

Teaching learners with restricted mind changes
ALT'05: Proceedings of the 16th international conference on Algorithmic Learning Theory

Within learning theory teaching has been studied in various ways. In a common variant the teacher has to teach all learners that are restricted to output only consistent hypotheses. The complexity of teaching is then measured by the maximum number of ...
Massive online teaching to bounded learners
ITCS '13: Proceedings of the 4th conference on Innovations in Theoretical Computer Science

We consider a model of teaching in which the learners are consistent and have bounded state, but are otherwise arbitrary. The teacher is non-interactive and "massively open": the teacher broadcasts a sequence of examples of an arbitrary target concept, ...
Taming teams with mind changes

This paper is concerned with the algorithmic learning where the learner is allowed to make a 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 ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

COLT '93: Proceedings of the sixth annual conference on Computational learning theory

August 1993

463 pages

ISBN:0897916115

DOI:10.1145/168304

Editor:
Lenny Pitt
Univ. of Illinois, Urbana

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 August 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

6COLT93

Sponsor:

6COLT93: 6th Annual Conference on Computational Learning Theory

July 26 - 28, 1993

California, Santa Cruz, USA

Acceptance Rates

Overall Acceptance Rate 35 of 71 submissions, 49%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
183
Total Downloads

Downloads (Last 12 months)31
Downloads (Last 6 weeks)5

Reflects downloads up to 16 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kalyanasundaram BVelauthapillai M(2013)Learning Behaviors of Functions with TeamsFundamenta Informaticae10.5555/2594908.2594909124:3(251-270)Online publication date: 1-Jul-2013
https://dl.acm.org/doi/10.5555/2594908.2594909
Kalyanasundaram BVelauthapillai M(2010)Learning Behaviors of FunctionsFundamenta Informaticae10.5555/1803682.180368598:2-3(183-198)Online publication date: 1-Apr-2010
https://dl.acm.org/doi/10.5555/1803682.1803685
Kalyanasundaram BVelauthapillai M(2008)Taming teams with mind changesJournal of Computer and System Sciences10.1016/j.jcss.2007.06.00874:4(513-526)Online publication date: 1-Jun-2008
https://dl.acm.org/doi/10.1016/j.jcss.2007.06.008
Kalyanasundaram BVelauthapillai M(2006)Capabilities of Thoughtful MachinesFundamenta Informaticae10.5555/2369456.236946374:2,3(329-340)Online publication date: 1-Aug-2006
https://dl.acm.org/doi/10.5555/2369456.2369463
Kalyanasundaram BVelauthapillai M(2006)Capabilities of Thoughtful MachinesFundamenta Informaticae10.5555/1231207.123121474:2,3(329-340)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.5555/1231207.1231214
Kalyanasundaram BVelauthapillai M(2005)Simulating teams with many conjecturesAlgorithmic Learning Theory10.1007/3-540-60454-5_39(201-214)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-60454-5_39
Daley RKalyanasundaram B(2005)Towards reduction arguments for FINite learningAlgorithmic Learning for Knowledge-Based Systems10.1007/3-540-60217-8_4(63-75)Online publication date: 30-May-2005
https://doi.org/10.1007/3-540-60217-8_4
Daley RKalyanasundaram B(2005)Use of reduction arguments in determining Popperian FIN-type learning capabilitiesAlgorithmic Learning Theory10.1007/3-540-57370-4_46(173-186)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-57370-4_46
Daley RKalyansundaram BVelauthapillai M(1995)Breaking the Probability 12 Barrier in FIN-Type LearningJournal of Computer and System Sciences10.1006/jcss.1995.104550:3(574-599)Online publication date: 1-Jun-1995
https://dl.acm.org/doi/10.1006/jcss.1995.1045
Daley RKalyanasundaram BVelauthapillai M(1993)Capabilities of fallible FINite learningProceedings of the sixth annual conference on Computational learning theory10.1145/168304.168332(199-208)Online publication date: 1-Aug-1993
https://dl.acm.org/doi/10.1145/168304.168332

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

Teaching learners with restricted mind changes

Massive online teaching to bounded learners

Taming teams with mind changes