On the power of learning robustly

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On the power of learning robustly

Full text

Pdf (1.46 MB)

Source

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

Madison, Wisconsin, United States

Pages: 187 - 197

Year of Publication: 1998

ISBN:1-58113-057-0

Authors

Sanjay Jain	Department of ISCS, National University of Singapore, Singapore 119260
Carl Smith	Department of Computer Science, University of Maryland, College Park, MD
Rolf Wiehagen	Department of Computer Science, University of Kaiserslautern, D-67653 Kaiserslautern, Germany

Sponsors

University of Wisconsin : University of Wisconsin
UC @ Santa Cruz : UC @ Santa Cruz
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): 4, Downloads (12 Months): 12, Citation Count: 2

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/279943.279982 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.

	AF96	Andris Ambainis , Rusins Freivalds, Transformations that Preserve Learnability, Proceedings of the 7th International Workshop on Algorithmic Learning Theory, p.299-311, October 23-25, 1996
	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]
	Bar71	J. B~rzdir/~. Complexity and Frequency Solution of Some Algorithmically Unsolvable Problems. PhD thesis, Novosibirsk State University, 1971. In Russian.
	Bar74	J. Barzdi0~. Two theorems on the limiting synthesis of functions. In Theory of Algorithms and Programs, vol. 1, pages 82-88. Latvian State University, 1974. In Russian.
	BB75	L. Blum and M. Blum. Toward a mathematical theory of inductive inference. Information and Control, 28:125-155, 1975.
	CS83	J. Case and C. Smith. Comparison of identification criteria for machine inductive inference. Theoretical Computer Science, 25:193- 220, 1983.
	Fre91	Rusins Freivalds, Inductive Inference of Recursive Functions: Qualitative Theory, Baltic Computer Science, Selected Papers, p.77-110, January 1991
	Ful90	M. Fulk. Robust separations in inductive inference. 31st Annual IEEE Symposium on Foundations of Computer Science, pages 405- 410, 1990.
	Gol67	E.M. Gold. Language identification in the limit. Information and Control, 10:447-474, 1967.
	JW97	S. Jain and R. Wiehagen. On the power of learning robustly. Technical Report LSA-97- 06E, Centre for Learning Systems and Applications, Department of Computer Science, University of Kaiserslautern, Germany, 1997.
	KS89	Stuart A. Kurtz , Carl H. Smith, On the role of search for learning, Proceedings of the second annual workshop on Computational learning theory, p.303-311, December 1989, Santa Cruz, California, United States
	KSW98	S. Kurtz, C. Smith, and R. Wiehagen. On the role of search for learning from examples. Journal of Experimental and Theoretical Artificial Intelligence, 1998. To appear.
	KW80	R. Klette and R. Wiehagen. Research in the theory of inductive inference by GDR mathematicians - A survey. Information Sciences, 22:149-169, 1980.
	OSW86	Daniel N. Osherson , Michael Stob , Scott Weinstein, Systems that learn: an introduction to learning theory for cognitive and computer scientists, MIT Press, Cambridge, MA, 1986
	Rog67	Hartley Rogers, Jr., Theory of recursive functions and effective computability, MIT Press, Cambridge, MA, 1987
	Smi82	Carl H. Smith, The Power of Pluralism for Automatic Program Synthesis, Journal of the ACM (JACM), v.29 n.4, p.1144-1165, Oct. 1982 [doi>10.1145/322344.322356]
	Wey52	H. Weyl. Symmetry. Princeton University Press, 1952.
	WZ95	Rolf Wiehagen , Thomas Zeugmann, Learning and Consistency, Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, p.1-24, January 1995
	Zeu86	Thomas Zeugmann, On Barzdin's conjecture, International Workshop All '86 on Analogical and inductive inference, p.220-227, January 1987, Wendisch-Rietz, Germany

CITED BY 2

	Matthias Ott , Frank Stephan, Avoiding coding tricks by hyperrobust learning, Theoretical Computer Science, v.284 n.1, p.161-180, 6 July 2002
	John Case , Sanjay Jain , Matthias Ott , Arun Sharma , Frank Stephan, Robust learning aided by context, Proceedings of the eleventh annual conference on Computational learning theory, p.44-55, July 24-26, 1998, Madison, Wisconsin, United States