John Langford (computer scientist)

John Langford (born January 2, 1975) is a computer scientist working in machine learning and learning theory, a field that he says, "is shifting from an academic discipline to an industrial tool".[1]

For other people named John Langford, see John Langford (disambiguation).

He is well known for work on the Isomap embedding algorithm, CAPTCHA challenges, Cover Trees for nearest neighbor search, Contextual Bandits (which he coined[2]) for reinforcement learning applications,[3] and learning reductions.[4]

John is the author of the blog hunch.net and the principal developer of Vowpal Wabbit. He works at Microsoft Research New York, of which he was one of the founding members, and was previously affiliated with Yahoo! Research,[1] Toyota Technological Institute at Chicago, and IBM's Watson Research Center. He studied Physics and Computer Science at the California Institute of Technology, earning a double bachelor's degree in 1997, and he received his Ph.D. in Computer Science from Carnegie Mellon University in 2002.

John was the program co-chair for the 2012 International Conference on Machine Learning (ICML),[5] general chair for the 2016 ICML,[6] and is the President of ICML[7] from 2019 to 2021.

References
  1. Knies, Rob (May 2, 2012). "Microsoft Research Debuts N.Y.C. Lab". Retrieved July 18, 2012.
  2. Langford, John; Zhang, Tong (December 3, 2007). "The Epoch-Greedy Algorithm for ContextualMulti-armed Bandits" (PDF).
  3. Li, Lihong; Chu, Wei; Langford, John; Schapire, Robert E. (April 26, 2010). "A contextual-bandit approach to personalized news article recommendation". Proceedings of the 19th international conference on World wide web - WWW '10. p. 661. arXiv:1003.0146. doi:10.1145/1772690.1772758. ISBN 9781605587998. S2CID 207178795.
  4. Langford, John (February 7, 2005). "The State of the Reduction".
  5. Francesco, Figari (2012). "ICML 2012 program committee".
  6. Mary, Jérémie (2016). "ICML 2016 organizing committee".
  7. Campbell, Lee (2019). "ICML 2020 Board".


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.