Biosketch
Ravi Kannan works in theoretical Computer Science and theoretical Machine Learning. He received his bachelor’s degree from the Indian Institute of Technology, Bombay and Ph.D. from Cornell University. After a postdoc fellowship in University of California, Berkeley, he was a faculty member at Massachusetts Institute of Technology, Carnegie-Mellon University and Yale University and was a Principal Researcher at Microsoft Research Labs., India. With coauthors Martin Dyer and Alan Frieze, he devised the first polynomial time algorithm for estimating the volume of multi-dimensional convex sets. They received the Fulkerson Prize for this work. He received the Knuth Prize in 2011 for lifetime contributions to Theoretical Computer Science. He is a fellow of the American Academy of Arts and Sciences and a member of the National Academy of Sciences.
Research Interests
Ravi Kannan’s research interests include Optimization, Matrix Computations, High-Dimensional Geometry, Data Clustering, mathematical aspects of Machine Learning. His research establishes mathematical (in particular, geometric, stochastic or algebraic) properties of data and exploits these to derive efficient algorithms. Examples are the use of Geometry of Numbers for Integer Programming and the Frobenius problem, Isoperimetry for geometric random walks and the properties of Singular Value Decomposition for randomized algorithms.
Membership Type
Member
Election Year
2025
Primary Section
Section 34: Computer and Information Sciences
Secondary Section
Section 11: Mathematics