Distinguished Webinar Speaker: Prof. Leslie G. Valiant
Webinar Details
Date: May 15, 2026
Time: 11:00 AM (Eastern Time - US & Canada)
We are honored to feature Prof. Leslie G. Valiant, 2010 A.M. Turing Award Laureate, whose foundational work has shaped computational learning theory, complexity theory, and parallel computation.
Distinguished Webinar Speaker, Prof. Leslie G. Valiant, 2010 A.M. Turing Award Laureate
Inaugural Talk
Enhanced and Efficient Reasoning in Large Language Models
In current Large Language Models the production of smoothly flowing prose is understandable in terms of the principles of machine learning. However, there is no comparable principled basis to justify trust in the content of the text produced. The widely recognized phenomenon of hallucinations is just one manifestation of this situation. While instances may be detected and corrected where alternative methods of verification exist, the pervasiveness of hallucinations where those precautions are not taken leads one to wonder about the trustworthiness of outputs in general. It appears to be conventional wisdom that addressing this issue by adding more principled reasoning to large language models is not computationally feasible and hence not an appropriate goal for technology.
Here we describe some new results that indicate, to the contrary, that one can enhance current language models with more principled reasoning, even while retaining much of the current software and hardware base. The method can be interpreted as providing more of a world model, where the individual objects and relations of the world are represented as first-class entities, and not treated indirectly and impressionistically as is current practice. On this model learned or programmed rules can be chained with certain soundness guarantees.
Biography
Prof. Leslie G. Valiant is a pioneering computer scientist whose work has had lasting impact on theoretical computer science, machine learning, and large-scale computation. He currently serves as the T. Jefferson Coolidge Professor of Computer Science and Applied Mathematics at Harvard University.
He received the 2010 A.M. Turing Award for transformative contributions to the theory of computation, including the theory of probably approximately correct learning, the complexity of enumeration and algebraic computation, and the theory of parallel and distributed computing.
His research introduced influential ideas that helped define modern computational learning theory and expanded the foundations of algorithmic and systems thinking. His scholarship continues to inspire researchers working across AI, theory, and trustworthy computing.
Key Contributions
- Introduced the PAC learning framework, a foundational model in computational learning theory.
- Made landmark contributions to counting complexity, including #P-related work.
- Advanced the theory of parallel and distributed computation through the BSP model.
- Produced influential research spanning theory of computation, learning, and intelligence.
Recognition
- 2010 A.M. Turing Award Laureate
- Knuth Prize recipient
- EATCS Award recipient
- Member of the U.S. National Academy of Sciences