ACM Turing Award is an innovator in the Machine Learning, Harvard University
New York, NY (Vocus / PRWEB) March 9, 2011
ACM, the Association for Computing Machinery, today named Leslie G. Vaillant of Harvard University the winner of 2010 ACM AM Turing Award for his fundamental contributions to the development of learning theory calculation and the more general theory of computing. Valiant has assembled machine learning and computational complexity, leading to advances in artificial intelligence and computing practices such as natural language processing, handwriting recognition and computer vision. He also launched several sub-fields of theoretical computer science, and developed models for parallel computing. The Turing Award, considered the “Nobel Prize in Computer Science”, is named for British mathematician Alan Turing M.. The prize is $ 250,000, with funding provided by Intel Corporation and Google Inc.
Leslie Valiant achievements over the past 30 years have provided the theoretical basis for the advancement of artificial intelligence and led to outstanding achievements in machine learning. His work led to modeling that offers answers based calculation on such fundamental issues as how the brain “computes”, said Alain Chesnais, ACM President. “His profound vision of computer science, mathematics and cognitive theory have been combined with other techniques to build modern forms of machine learning and communication, as IBM computer system “Watson, who have allowed computer systems to compete with a man’s ability to answer questions. “
Shekhar Borkar
, Director of Microprocessor Technology Lab of Intel Corp., Intel and a member said: “The research of Professor Valiant in the theory of algorithms and machine learning has revolutionized the artificial intelligence machines making almost think. “he added,” His approach invites comparison with himself Turing – a new formulation based on a fundamental knowledge, and Intel is pleased to support this award, “
.
“Google joins recognize Leslie Valiant for his profound impact on the landscape of computing research,” said Alfred Spector, vice president of research and special initiatives at Google Inc. “His clever concepts and brilliant Research had an incredible amount, and he has two and inspired innovations in the field of machine learning, an area of growing importance in many applications of computing. We are pleased to be a sponsor of the Turing Award, which motivates and recognizes the great advances in computing, which together had a beneficial impact on the world. “
computational learning theory
Valiant “programming theory,” published in 1984 in Communications of the ACM, is regarded as one of the major contributions to machine learning. He put the machine learning on a solid foundation in mathematics and laid the groundwork for a new field of research known as computation learning theory. He provided a general framework and concrete models of computation, and its approach “probably approximately correct (PAC) learning has become a standard model for studying the learning process. His work led to the development of algorithms that adapt their behavior in response to feedback from the environment. Mainstream AI research has adopted his views as an essential tool for designing intelligent systems.
Algebraic Computation Theory
One of the main contributions to the Valiant computational complexity has been his work on the complexity of counting problems. Its impact has been to demonstrate the inherent difficulty in counting the number of solutions not only for computationally hard problems, but also those whose decision complexity is relatively “easy”. This work led to the theory of algebraic calculations, which established a framework for understanding algebraic formulas that can be assessed effectively. Valiant also introduced the class # P and proved to be permanent full for this class. His article “Completeness Classes in Algebra,” published in 1979, introduces algebraic techniques in the toolbox of theoretical computer science and his work on P # prepare the ground for the development of interactive proofs for NP beyond.
Development models for parallel computing
preview
Valiant in the theory of parallel and distributed computing is another broad area of significant contributions. His 1982 paper “A scheme for fast parallel communication” describes a simple parallel routing scheme that offers a solution to congestion problems that occur when multiple computers try to communicate on networks with limited capacity. He also introduced the “parallel Bulk synchronous “model of computing (BSP), which describes the various types of multiprocessor computers based on the efficiency with which they synchronize and communicate internally. The BSP model explains why the performance of an algorithm can vary between different parallel computers.
Focus
Recent Research
More recently, Valiant has contributed to computational neuroscience, providing a concrete mathematical model of the brain and its architecture on complex cognitive functions. In his 1994 book tours of the mind, it details a new and promising approach for calculating the study of complex mechanisms of the human brain. It focuses on the brain’s ability to quickly access a massive store of information accumulated during reasoning process despite the extreme stresses imposed by the finite number of neurons in the brain, their limited speed of communication, and their limited interconnection. The book offers a new approach to brain science for students and researchers in computer science, neurobiology, neuroscience, artificial intelligence and cognitive science.
Background
Valiant Professor T. Jefferson Coolidge of Computer Science and Applied Mathematics from Harvard University School of Engineering and Applied Science (SEAS). Before joining Harvard in 1982, he taught at Carnegie Mellon University, the University of Leeds, and Edinburgh University. He graduated from Kings College, Cambridge University with a BA in Mathematics and Imperial College, London, where he graduated from Imperial College (DIC) in Computer Science. He earned a Ph.D. in Computer Science, University of Warwick.
Nevanlinna Prize winner of the International Mathematical Union in 1986, Valiant was awarded in 1997 Knuth Prize ACM Special Interest Group on algorithms and theory (sigaction) and the IEEE Technical Committee on mathematical foundations of computing. In 2008, he received the European Association for Theoretical Computer Science Award. He is a Fellow of the Royal Society (London), member of the American Association for Artificial Intelligence and a member of the National Academy of Sciences (USA).
present the ACM AM Turing Award in 2010 at its annual banquet awards ceremony June 4 in San Jose, CA.
About ACM
A. M. Turing Award
The AM Turing Award was named for Alan Turing M., the British mathematician who formulated the mathematical foundation and limits of computing, and has been a key contributor to the Allied cryptanalysis of the German Enigma figure and the German machine “Tuna” coding in the Second World War. Since its inception in 1966, the Turing Award has honored the computer scientists and engineers who created the systems and underlying theoretical foundations that have propelled the industry of information technology. Jump to http://awards.acm.org/turing information.
About ACM
ACM, the Association for Computing Machinery http://www.acm.org, is the largest in the world of educational and scientific computing society, uniting computing educators, researchers and professionals to raise the dialogue, share resources and meet the challenges of the field. ACM strengthens the profession’s collective voice of IT through strong leadership, promotion of the highest standards, and recognition of technical excellence. ACM supports the professional development of its members by providing opportunities for lifelong learning, career development and professional networking.
>
clear = “all”
class = “small-text”>
© Copyright 1997 -
, Vocus PRW Holdings, LLC.
Vocus, PRWeb and advertising Wire are trademarks or registered trademarks of Vocus, Inc. or Vocus PRW Holdings, LLC.
