Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Physical Sciences and Mathematics
Variations On U-Shaped Learning, Lorenzo Carlucci, Sanjay Jain, Efim Kinber, Frank Stephen
Variations On U-Shaped Learning, Lorenzo Carlucci, Sanjay Jain, Efim Kinber, Frank Stephen
School of Computer Science & Engineering Faculty Publications
The paper deals with the following problem: is returning to wrong conjectures necessary to achieve full power of algorithmic learning? Returning to wrong conjectures complements the paradigm of U-shaped learning when a learner returns to old correct conjectures. We explore our problem for classical models of learning in the limit from positive data: explanatory learning (when a learner stabilizes in the limit on a correct grammar) and behaviourally correct learning (when a learner stabilizes in the limit on a sequence of correct grammars representing the target concept). In both cases we show that returning to wrong conjectures is necessary to …
Good/Fast/Cheap: Contexts, Relationships And Professional Responsibility During Software Development, Marty J. Wolf, Frances S. Grodzinsky,
Good/Fast/Cheap: Contexts, Relationships And Professional Responsibility During Software Development, Marty J. Wolf, Frances S. Grodzinsky,
School of Computer Science & Engineering Faculty Publications
Engineering requires tradeoffs [23]. When engineering computer applications, software engineers should consider the costs and benefits to humans as an integral part of the software development process. In this paper we focus on reliability, a central aspect of software quality, and the influence of relationships and various software development contexts on the software developer.
Learning Languages From Positive Data And A Finite Number Of Queries, Sanjay Jain, Efim Kinber
Learning Languages From Positive Data And A Finite Number Of Queries, Sanjay Jain, Efim Kinber
School of Computer Science & Engineering Faculty Publications
A computational model for learning languages in the limit from full positive data and a bounded number of queries to the teacher (oracle) is introduced and explored. Equivalence, superset, and subset queries are considered (for the latter one we consider also a variant when the learner tests every conjecture, but the number of negative answers is uniformly bounded). If the answer is negative, the teacher may provide a counterexample. We consider several types of counterexamples: arbitrary, least counterexamples, the ones whose size is bounded by the size of positive data seen so far, and no counterexamples. A number of hierarchies …