NIPS2001 Workshop on Kernel Learning, Whistler Resort, Canada, December 2001. Position paper :" A Priori Generalization Bounds for kernel Based Learning".
Workshop in Honor of Alan Borodin, Fields Institute, Toronto, May 2001.
and Cornell University, CS Department Colloquium , October 2001. " Computational Learning Theory; The Tradeoff between Computational Complexity and Statistical Soundness.
Alpine Workshop on Computational Aspects of Learning, Sestriere, Italy, March 2001.
Invited Tutorial on Generalization VS Computational Complexity of Learning.
Foundations of Statistical Inference, Shoresh Resoret, Israel, December 2000. The Computational Complexity of Searching for Predictive Hypothesis .
13th Annual Conference on Computational Learning Theory COLT 2000 , Stanford University, July 2000.
Invited Tutorial on The
Computational Complexity of Learning with Neural Networks.
" The Computational
Complexity of Learning with Neural Networks"
Workshop on
Computational Learning and Bioinformatics, Bonn, 2000.
"Efficient Agnostic Learning
of Linear Perceptrons",
New Perspectives in the Theory of Neural
Networks, Graz, Austria, 2000.
Keynote talk:
"Computational Efficiency of Linear Perceptrons" Second Bar-Ilan
workshop on Knowledge Discovery and Learning,
Israel, 2000.
"On the Existence of Optimal
Proof Systems"
Workshop on Complexity Lower
Bounds, the Fields
Institute, Toronto, Canada, 1998.
"Models of Online
Learning"
ACNN'98 - The Ninth Australian Conference on Neural
Networks, Brisbane, Australia, 1998.
Keynote talk:
"VC-dimension, Sample Compression Schemes and Learning."
ICMS
Workshop on the Vapnik-Chervonenkis Dimension, Edinburgh, 1996.
Keynote talk:
"On Computational Learning Theory."12th Israeli Symposium on
Artificial Intelligence, Computer Vision and Neural Networks,
Tel-Aviv, 1996.
Keynote talk:
"Learning Changing Concepts by Exploiting the Structure of
Change." NEUROCOLT - Second Annual Meeting, France, 1996.
"On pairwise-independent
sets with applications to VC-dimension theory". 2nd Weizmann
workshop on randomness and computation, Rehovot, 1995.
Invited Tutorial:
"The Theory of PAC Learning." Dagstuhl Seminar on Theory and
Praxis of Machine Learning, Dagstuhl, Germany, June 1994.
"Combinatorial
characterizations of learnability." Israel Mathematical Union
Annual Meeting, Jerusalem, May 1992.
"Applications of Banach-Spaces-Theory
to Computational Learnability" Eighth International Conference on
Probability in Banach Spaces, Brunswick, Main, July 1991.
"Theories of
Average-Case-Complexity" The Israeli Theoretical Computer Science
Seminar, Tel-Aviv, March 1988.
"Reflecting all Possible
Stationary Sets" 77th Ontario Mathematical Conference, Peterborough,
Canada, October 1986.
"A Laver-Type
Indistructability for Accessible Cardinals" Logic Colloquium '86,
Hull, UK, July 1986.
"A Hierarchy of Principles for Successors of
Singular Cardinals" Mid-Atlantic Mathematical Logic Seminar, Princeton
University, Princeton, NJ, USA, December 1985.
"Relative Consistency
Strength of L-like Properties" Oberwolfach Set-Theory Seminar, Oberwolfach,
Germany, January 1985.
"The Resurrection of
Super-Compactness Technique". New England Set Theory Seminar, Amherst,
NH, USA, November 1985.
"Souslin Trees Above Super
Compact Cardinals". 7th International Congress on Logic,
Methodology and Philosophy of Science, Salzburg, Austria, July 1983.
Keynote talk:
"Metrizability of Moore Spaces in Constructible Universe." Oklahoma
Topology Conference, Oklahoma City, Oklahoma, USA, March 1978.