Home
Welcome to COLT: Computational Learning Theory
"Learning Has Just Started" - an interview with Prof. Vladimir Vapnik PDF Print E-mail
Written by Ran Gilad-Bachrach   
Sunday, 02 March 2008 00:00

As a part of the renovation of the learningTheory.org web site, we are launching a series of interviews with leading researchers in learning theory and related fields. We are proud that Prof. Vladimir Vapnik accepted our invitation to be the first to be interviewed.

    Prof. Vapnik has been working on learning theory related problems for more than four decades. Together with Alexey Chervonenkis he studied the problem of uniform convergence of empirical means and developed the VC theory. He also developed the large margin principles and the Support Vector Machines algorithm.

Last Updated ( Wednesday, 09 April 2008 04:37 )
Read more...
 
What is COLT? PDF Print E-mail

Computational Learning Theory (COLT) is a research field devoted to studying the design and analysis of adaptive algorithms. This includes algorithms that make predictions about the future based on past observations, algorithms that learn from a teacher, and algorithms that learn by interacting with the world around them. The emphasis in COLT is on rigorous mathematical analysis. As a field with roots in theoretical computer science, COLT is largely concerned with computational and data efficiency. Much of the work in COLT can be traced to Valiant's seminal paper on "A theory of the learnable" (1984) as well as Gold's "Language identification in the limit" (1967). The annual Conference on Computational Learning Theory began in 1988; the European Conference on Computational Learning Theory and the Workshop on Algorithmic Learning Theory were formed soon after. COLT has strongly encouraged interaction with other fields that work on problems of prediction such as applied machine learning, statistics, information theory, pattern recognition and statistical physics, as well as other areas of computer science such as artificial intelligence, complexity theory and cryptography.

Freund and Schapire