Vladimir Vapnik

Vladimir N. Vapnik
Born (1936-12-06) December 6, 1936
Soviet Union
Fields Machine Learning
Statistics
Institutions Facebook AI Research Group
NEC Laboratories America
Adaptive Systems Research Department, AT&T Bell Laboratories
Royal Holloway, University of London
Columbia University
Alma mater Institute of Control Sciences, Russian Academy of Sciences
Uzbek State University
Doctoral advisor Aleksandr Lerner
Known for Vapnik–Chervonenkis theory
Vapnik–Chervonenkis dimension
Support Vector Machine
Statistical Learning Theory
Structural risk minimization
Notable awards Kampé de Fériet Award (2014)
C&C Prize (2013)
Benjamin Franklin Medal (2012)
IEEE Frank Rosenblatt Award (2012)
IEEE Neural Networks Pioneer Award (2010)
Paris Kanellakis Award (2008)
Fellow of the U.S. National Academy of Engineering (2006)
Gabor Award, International Neural Network Society (2005)
Alexander Humboldt Research Award (2003)

Vladimir Naumovich Vapnik (Russian: Владимир Наумович Вапник; born 6 December 1936) is one of the main developers of the Vapnik–Chervonenkis theory of statistical learning, and the co-inventor of the Support Vector Machine method.

Early life and education

Vladimir Vapnik was born in the Soviet Union. He received his master's degree in mathematics at the Uzbek State University, Samarkand, Uzbek SSR in 1958 and Ph.D in statistics at the Institute of Control Sciences, Moscow in 1964. He worked at this institute from 1961 to 1990 and became Head of the Computer Science Research Department.[1]

Academic career

At the end of 1990, Vladimir Vapnik moved to the USA and joined the Adaptive Systems Research Department at AT&T Bell Labs in Holmdel, New Jersey. While at AT&T, Vapnik and his colleagues developed the theory of the support vector machine. They demonstrated its performance on a number of problems of interest to the machine learning community, including handwriting recognition. The group later became the Image Processing Research Department of AT&T Laboratories when AT&T spun off Lucent Technologies in 1996. Vapnik left AT&T in 2002 and joined NEC Laboratories in Princeton, New Jersey, where he worked in the Machine Learning group. He also holds a Professor of Computer Science and Statistics position at Royal Holloway, University of London since 1995, as well as a position as Professor of Computer Science at Columbia University, New York City since 2003.[2] As of November 2015, he has an h-index of 105 and, overall, his publications have been cited close to 157,000 times.[3] His book on "Statistical Learning Theory" alone has been cited close to 60,000 times.

On November 25, 2014, Vapnik joined Facebook AI Research, where he is working alongside his longtime collaborators Jason Weston, Ronan Collobert, and Yann LeCun.[4]

Honors and Awards

Vladimir Vapnik was inducted into the U.S. National Academy of Engineering in 2006. He received the 2005 Gabor Award,[5] the 2008 Paris Kanellakis Award, the 2010 Neural Networks Pioneer Award,[6] the 2012 IEEE Frank Rosenblatt Award, the 2012 Benjamin Franklin Medal in Computer and Cognitive Science from the Franklin Institute,[1] the 2013 C&C Prize from the NEC C&C Foundation,[7] and the 2014 Kampé de Fériet Award.

Selected publications

See also

Notes

  1. 1 2 "Benjamin Franklin Medal in Computer and Cognitive Science". Franklin Institute. 2012. Retrieved April 6, 2013.
  2. Scholkopf, Bernhard et al (eds) (2013). "Preface". Empirical Inference: Festschrift in Honor of Vladimir N. Vapnik. Springer. ISBN 978-3-642-41136-6.
  3. "Google Scholar Record of Vapnik".
  4. "Facebook’s AI team hires Vladimir Vapnik, father of the popular support vector machine algorithm". VentureBeat. 2014. Retrieved November 28, 2014.
  5. "INNS awards recipients". International Neural Network Society. 2005. Retrieved November 28, 2014.
  6. IEEE Computational Intelligence Society.
  7. "NEC C&C Foundation Awards 2013 C&C Prize". NEC. 2013. Retrieved December 3, 2013.

External links

This article is issued from Wikipedia - version of the Monday, February 01, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.