Jump to content

Leslie Valiant

From Wikipedia, the free encyclopedia
(Redirected from Leslie G. Valiant)
"Les Valiant" redirects here. Not to be confused with Valiant (disambiguation).

Leslie Valiant
FRS
Valiant in 2012
Born
Leslie Gabriel Valiant

(1949-03-28) 28 March 1949 (age 75)
Budapest, Hungarian Republic
NationalityBritish
Alma mater
Known for
Awards
Scientific career
FieldsMathematics
Theoretical computer science
Computational learning theory
Theoretical neuroscience
Institutions
ThesisDecision Procedures for Families of Deterministic Pushdown Automata (1974)
Doctoral advisorMike Paterson[1]
Doctoral students
Websitepeople.seas.harvard.edu/~valiant

Leslie Gabriel Valiant FRS[4][5] (born 28 March 1949) is a British American[6] computer scientist and computational theorist.[7][8] He was born to a chemical engineer father and a translator mother.[9] He is currently the T. Jefferson Coolidge Professor of Computer Science and Applied Mathematics at Harvard University.[10][11][12][13] Valiant was awarded the Turing Award in 2010, having been described by the A.C.M. as a heroic figure in theoretical computer science and a role model for his courage and creativity in addressing some of the deepest unsolved problems in science; in particular for his "striking combination of depth and breadth".[6]

Education

[edit]

Valiant was educated at King's College, Cambridge,[14][6] Imperial College London,[14][6] and the University of Warwick where he received a PhD in computer science in 1974.[15][1]

Research and career

[edit]

Valiant is world-renowned for his work in Theoretical Computer Science. Among his many contributions to Complexity Theory, he introduced the notion of #P-completeness ("Sharp-P completeness") to explain why enumeration and reliability problems are intractable. He created the Probably Approximately Correct or PAC model of learning that introduced the field of Computational Learning Theory and became a theoretical basis for the development of Machine Learning. He also introduced the concept of Holographic Algorithms inspired by the Quantum Computation model. In computer systems, he is most well-known for introducing the Bulk Synchronous Parallel processing model. Analogous to the von Neumann model for a single computer architecture, BSP has been an influential model for parallel and distributed computing architectures. Recent examples are Google adopting it for computation at large scale via MapReduce, MillWheel,[16] Pregel[17] and Dataflow, and Facebook creating a graph analytics system capable of processing over 1 trillion edges.[18][19] There have also been active open-source projects to add explicit BSP programming as well as other high-performance parallel programming models derived from BSP. Popular examples are Hadoop, Spark, Giraph, Hama, Beam and Dask. His earlier work in Automata Theory includes an algorithm for context-free parsing, which is still the asymptotically fastest known. He also works in Computational Neuroscience focusing on understanding memory and learning.

Valiant's 2013 book is Probably Approximately Correct: Nature's Algorithms for Learning and Prospering in a Complex World.[20] In it he argues, among other things, that evolutionary biology does not explain the rate at which evolution occurs, writing, for example, "The evidence for Darwin's general schema for evolution being essentially correct is convincing to the great majority of biologists. This author has been to enough natural history museums to be convinced himself. All this, however, does not mean the current theory of evolution is adequately explanatory. At present the theory of evolution can offer no account of the rate at which evolution progresses to develop complex mechanisms or to maintain them in changing environments."

Valiant started teaching at Harvard University in 1982 and is currently the T. Jefferson Coolidge Professor of Computer Science and Applied Mathematics in the Harvard School of Engineering and Applied Sciences. Prior to 1982 he taught at Carnegie Mellon University, the University of Leeds, and the University of Edinburgh.

Awards and honors

[edit]

Valiant received the Nevanlinna Prize in 1986, the Knuth Prize in 1997, the EATCS Award in 2008,[21] and the Turing Award in 2010.[22][23] He was elected a Fellow of the Royal Society (FRS) in 1991,[4] a Fellow of the Association for the Advancement of Artificial Intelligence (AAAI) in 1992,[24] and a member of the United States National Academy of Sciences in 2001.[25] Valiant's nomination for the Royal Society reads:

Leslie Valiant has contributed in a decisive way to the growth of theoretical computer science. His work is concerned mainly with quantifying mathematically the resource costs of solving problems on a computer. In early work (1975), he found the asymptotically fastest algorithm known for recognising context-free languages. At the same time, he pioneered the use of communication properties of graphs for analysing computations. In 1977, he defined the notion of ‘sharp-P’ (#P)-completeness and established its utility in classifying counting or enumeration problems according to computational tractability. The first application was to counting matchings (the matrix permanent function). In 1984, Leslie introduced a definition of inductive learning that, for the first time, reconciles computational feasibility with the applicability to nontrivial classes of logical rules to be learned. This notion, later called ‘probably approximately correct learning’, became a theoretical basis for the development of machine learning. In 1989, he formulated the concept of bulk synchronous computation as a unifying principle for parallel computation. Leslie received the Nevanlinna Prize in 1986, and the Turing Award in 2010.[26]

The citation for his A.M. Turing Award reads:

For transformative contributions to the theory of computation, including the theory of probably approximately correct (PAC) learning, the complexity of enumeration and of algebraic computation, and the theory of parallel and distributed computing.[6]

Personal life

[edit]

His two sons Gregory Valiant[27] and Paul Valiant[28] are both also theoretical computer scientists.[8]

References

[edit]
  1. ^ a b c Leslie Valiant at the Mathematics Genealogy Project
  2. ^ Valiant, L.; Vazirani, V. (1986). "NP is as easy as detecting unique solutions" (PDF). Theoretical Computer Science. 47: 85–93. doi:10.1016/0304-3975(86)90135-0.
  3. ^ Valiant, L. G. (1979). "The Complexity of Enumeration and Reliability Problems". SIAM Journal on Computing. 8 (3): 410–421. doi:10.1137/0208032.
  4. ^ a b "Leslie Valiant FRS". London: Royal Society. 1991.
  5. ^ DServe Archive Catalog Show
  6. ^ a b c d e "Leslie G. Valiant - A.M. Turing Award Laureate". A.M. Turing Award. Retrieved 9 January 2019.
  7. ^ Hoffmann, L. (2011). "Q&A: Leslie Valiant discusses machine learning, parallel computing, and computational neuroscience". Communications of the ACM. 54 (6): 128. doi:10.1145/1953122.1953152.
  8. ^ a b Anon (2017). "Valiant, Prof. Leslie Gabriel". Who's Who (online Oxford University Press ed.). Oxford: A & C Black. doi:10.1093/ww/9780199540884.013.U40928. (Subscription or UK public library membership required.)
  9. ^ "A. M. Turing Award Oral History Interview with Leslie Gabriel Valiant" (PDF).
  10. ^ Leslie Valiant author profile page at the ACM Digital Library
  11. ^ Wigderson, A. (2009). "The work of Leslie Valiant". Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09. pp. 1–2. doi:10.1145/1536414.1536415. ISBN 9781605585062. S2CID 15370663.
  12. ^ Leslie G. Valiant at DBLP Bibliography Server Edit this at Wikidata
  13. ^ Valiant, Leslie (1984). "A theory of the learnable" (PDF). Communications of the ACM. 27 (11): 1134–1142. doi:10.1145/1968.1972. S2CID 12837541.
  14. ^ a b "CV of Leslie G. Valiant" (PDF). Harvard University. Retrieved 9 January 2019.
  15. ^ Valiant, Leslie (1973). Decision procedures for families of deterministic pushdown automata. warwick.ac.uk (PhD thesis). University of Warwick. OCLC 726087468. EThOS uk.bl.ethos.475930.
  16. ^ MillWheel: Fault-Tolerant Stream Processing at Internet Scale
  17. ^ Pregel: a system for large-scale graph processing
  18. ^ A comparison of state-of-the-art graph processing systems.
  19. ^ One Trillion Edges: Graph Processing at Facebook-Scale
  20. ^ https://www.hachettebookgroup.com/titles/leslie-valiant/probably-approximately-correct/9780465037902/?lens=basic-books, ISBN 9780465032716
  21. ^ David Peleg The EATCS Award 2008 – Laudatio for Professor Leslie Valiant European Association of Theoretical Computer Science.
  22. ^ Josh Fishman "‘Probably Approximately Correct’ Inventor, From Harvard U., Wins Turing Award" Chronicle of Higher Education 9 March 2011.
  23. ^ ACM Turing Award Goes to Innovator in Machine Learning ACM Computing News
  24. ^ Elected AAAI Fellows Association for the Advancement of Artificial Intelligence.
  25. ^ Member Directory: Leslie G. Valiant National Academy of Sciences.
  26. ^ https://royalsociety.org/people/leslie-valiant-12451/ Royal Society biography
  27. ^ Gregory Valiant Homepage
  28. ^ Paul Valiant's homepage
[edit]

 This article incorporates text available under the CC BY 4.0 license.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Leslie_Valiant&oldid=1169052199"