Shai Ben-David

Professor

School of Computer Science
Universitys of Waterloo
200 University Avenue West
Waterloo, Ontario, Canada, N2L 3G1
Email: shai@cs.uwaterloo.ca
Phone: +1 519 888 4567 ext. 7523
Fax: +1 519 885-1208

Home

 

Recent Invited Talks

 

“Subjective Measures for Distributions Similarity” NIPS07 workshop on Representation and Inference on Probability Distributions, Whistler, BC, December 2007

“Lost in Translation” NIPS07 workshop on Principles of Learning Problem Design, Whistler, BC, December 2007

“The Computational Complexity of Biclustering ” The Analysis of Patterns workshop, Bertinoro, Italy, October 2007.


”Theoretical Foundations of Clustering”  The Analysis of Patters workshop, Bertinoro, Italy, October 2007.

”Formal analysis of clustering stability”  Workshop on Stability and Resampling Methods for Clustering, Tubingen, Germany, July 2007

“Theoretical Foundations of Clustering – Progress and Challenges”

20th Canadian AI conference, Montreal, May 2007.

“The non-stationary data generation learning challenge”  The 31st Annual Conference of the German Classification Society, Freiburg, Germany, March 2007.

”Alternative Measures of Computational Complexity for Learning”  BIRS Workshop on Mathematical Programming in Data Mining and Machine Learning, Banff, Alberta, January, 2007.

 
"New Measure for Computational Complexity of Optimization Tasks" ,  TAMC'06  Beijing, China, May 2006

Can Clustering be Axiomatized? Rethinking Kleinberg's Impossibility Theoretical Foundations of Clustering workshop, NIPS'05

Formal Framework for Multi-Task Learning with Provable Generalization Bounds Invited talk at the NIPS'05 Inductive Transfer Workshop

A Notion of Stability for Sample Based Clustering Invited talk at the PASCAL Workshop on Clustering (July 2005)

What Computers can't do and what can we gain from their shortcomings? CS4Uday for high school students (Nov. '05)

Can the P vs NP question be independent of the axioms of mathematical reasoning? Theory Seminar, U of Toronto (Nov. '05)

Other Invited Talks

·         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.

Publications

Talks

Professional Activities

Teaching