On the impact of forgetting on learning machines

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On the impact of forgetting on learning machines

Full text

Pdf (1.13 MB)

Source

Annual Workshop on Computational Learning Theory archive
Proceedings of the sixth annual conference on Computational learning theory table of contents

Santa Cruz, California, United States

Pages: 165 - 174

Year of Publication: 1993

ISBN:0-89791-611-5

Authors

Rūsiņš Freivalds
Efim Kinber
Carl H. Smith

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 13, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/168304.168326 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	AS83	Dana Angluin , Carl H. Smith, Inductive Inference: Theory and Methods, ACM Computing Surveys (CSUR), v.15 n.3, p.237-269, Sept. 1983 [doi>10.1145/356914.356918]
	AS87	D. Angluin and C. H. Smith. Inductive inference. In S. Shapiro, editor, Encyclopedia of Artificial Intelligence, pages 409-418. John Wiley and Sons Inc., 1987.
	Bar74	J. Barzdins. Two theorems on the limiting synthesis of functions. In Barzdins, editor, Theory of Algorithms and Programs, volume 1, pages 82-88. Latvian State University, Riga, U.S.S.R., 1974.
	BB75	L. Blum and M. Blum. Toward a mathematical theory of inductive inference. Information and Control, 28:125-155, 1975.
	BHPS51	V. Bar-Hillel, M. Perles, and E. Shamir. On formal properties of simple phrase structured grammars. Zeitschriift f6r Phonetzk, Sprachwissenschft, und Kommunikaiionsforschung, 14:143-172, 1951.
	Bra71	M.D.S. Braine. On two types of models of the internalization of grammars. In D. I. Slobin, editor, The Ontogenesis of Grammar, pages 153-186. Academic Press, 1971.
	BS88	Stéphane Boucheron , Jean Sallantin, Some remarks about space-complexity of learning, and circuit complexity of recognizing, Proceedings of the first annual workshop on Computational learning theory, p.125-138, August 03-05, 1988, MIT, Cambridge, Massachusetts, United States
	Cas74	J. Case. Periodicity in generations of automata. Mathematical Systems Theory, 8:15-32, 1974.
	CM83	F. Crick and G. Mitchison. The function of dream sleep. Nature, 304(14):111-114, 1983.
	CN	J. Case and S. NgoManguelle. Refinements of inductive inference by popperian machines. Kybernetika. To appear.
	COL92	Proceedings of the 1992 Workshop on Computational Learning Theory. ACM Press, New York, NY., 1992.
	CS83	J. Case and C. Smith. Comparison of identification criteria for machine inductive inference. Theoretical Computer Science, 25(2):193-220, 1983.
	FC90	Proceedings of the third annual workshop on Computational learning theory, July 1990
	Flo89	Sally Floyd, Space-bounded learning and the Vapnik-Chervonenkis dimension, Proceedings of the second annual workshop on Computational learning theory, p.349-364, December 1989, Santa Cruz, California, United States
	FS93	Rūsiņš Freivalds , Carl H. Smith, On the role of procrastination in machine learning, Information and Computation, v.107 n.2, p.237-271, Dec. 1993 [doi>10.1006/inco.1993.1068]
	Gol67	E.M. Gold. Language identification in the limit. Information and Control, 10:447-474, 1967.
	Hau85	D. Haussler. Space efficient learning algorithms. Technical report, University of California at Santa Cruz, 1985. UCSC-CLR-88- 2.
	HFP83	J.J. Hopfield, D. I. Feinstein, and R. G. Palmer. 'unlearning' has a stabilizing effect in collective memories. Nature, 304(14):158- 159, 1983.
	HKK+90	D. Heath, S. Kasif, R. Kosaraju, S. Salzberg, and G. Sullivan. Learning Nested Concept Classes with Limited Storage. Computer Science Department, Johns Hopkins University, Baltimore MD., 1990.
	HP88	D. Haussler and L. Pitt. Proceedings of the 1988 Workshop on Computatwnal Learning Theory. Morgan Kaufmann Publishers, Palo Alto, CA., 1988.
	HR67	Hartley Rogers, Jr., Theory of recursive functions and effective computability, MIT Press, Cambridge, MA, 1987
	HSW89	David Helmbold , Robert Sloan , Manfred K. Warmuth, Learning nested differences of intersection-closed concept classes, Proceedings of the second annual workshop on Computational learning theory, p.41-56, December 1989, Santa Cruz, California, United States
	JB81	K.P. Jantke and H. R. Beick. Combining postulates of naturalness in inductive inference. Electronische Informationsverabeitung und Kybernetik, 17:465-484, 1981.
	Kle38	S. Kleene. On notation for ordinal numbers. Journal of Symbohc Logzc, 3:150-155, 1938.
	LP81	Harry R. Lewis , Christos H. Papadimitriou , Christos Papadimitriou, Elements of the Theory of Computation, Prentice Hall PTR, Upper Saddle River, NJ, 1997
	MCM83	R. Michalski, J. Carbonell, and T. Mitchell. Machine Learning. Tioga Publishing Co., Palo Alto, CA, 1983.
	Miy87	T. Miyahara. Inductive inference by iteratively working and consistent strategies with anomalies. Bulletin of Informatzcs and Cybernetics, 22:171-177, 1987.
	Miy89	T. Miyahara. A note on iteratively working strategies in inductive inference. In Proceedings of the Fujitsu IIAS-SIS Workshop on Computational Learning Theory, page 6 pgs, Numazu, Japan, 1989.
	MY78	Michael Machtey , Paul Young, An Introduction to the General Theory of Algorithms, Elsevier Science Inc., New York, NY, 1978
	OSW86	D. Osherson, M. Stob, and S. Weinstein. Systems that Learn. MIT Press, Cambridge, Mass., 1986.
	Pop68	K. Popper. The Logic of Scientific Dzscovery. Harper Torch Books, N.Y., 1968.
	RHW89	Proceedings of the second annual workshop on Computational learning theory, December 1989
	Sch90	Robert E. Schapire, The Strength of Weak Learnability, Machine Learning, v.5 n.2, p.197-227, Jun. 1990 [doi>10.1023/A:1022648800760]
	Sha87	Stuart C. Shapiro, Encyclopedia of artificial intelligence; vols. 1 and 2, Wiley-Interscience, New York, NY, 1987
	Smu61	R. Smullyan. Theory of Formal Systems, Annals of Mathematical Studies, volume 47. Princeton University Press, Princeton, New Jersey, 1961.
	SS92	Hava T. Siegelmann , Eduardo D. Sontag, On the computational power of neural nets, Proceedings of the fifth annual workshop on Computational learning theory, p.440-449, July 27-29, 1992, Pittsburgh, Pennsylvania, United States [doi>10.1145/130385.130432]
	Val84	L. G. Valiant, A theory of the learnable, Communications of the ACM, v.27 n.11, p.1134-1142, Nov. 1984 [doi>10.1145/1968.1972]
	WC80	K. Wexler and P. W. Culicover. Formal Prmczples of Language Acquisition. The MIT Press, 1980.
	Wie76	R. Wiehagen. Limes-erkennung rekursiver funktionen durch spezielle strategien. Elektronische Informationsverarbeitung und Kybernetik, 12:93-99, 1976.
	WV91	Proceedings of the fourth annual workshop on Computational learning theory, August 1991

CITED BY 4

	Efim Kinber , Frank Stephan, Language learning from texts (extended abstract): mind changes, limited memory and monotonicity, Proceedings of the eighth annual conference on Computational learning theory, p.182-189, July 05-08, 1995, Santa Cruz, California, United States
	Rūsiņš Freivalds , Efim Kinber , Carl H. Smith, On the impact of forgetting on learning machines, Journal of the ACM (JACM), v.42 n.6, p.1146-1168, Nov. 1995
	Susanne Kaufmann , Frank Stephan, Resource bounded next value and explanatory identification: learning automata, patterns and polynomials on-line, Proceedings of the tenth annual conference on Computational learning theory, p.263-274, July 06-09, 1997, Nashville, Tennessee, United States
	Mark Burgin , Allen Klinger, Experience, generations, and limits in machine learning, Theoretical Computer Science, v.317 n.1-3, p.71-91, June 4, 2004