Mehryar Mohri

Last updated
Mehryar Mohri
Mehryar Mohri, Scholar Photo.jpg
Mehryar Mohri, 2020.
Born (1964-10-20) October 20, 1964 (age 60)
Alma mater École Polytechnique
École Normale Supérieure
University of Paris 7 Denis Diderot
Known forFoundations of Machine Learning [1]
Scientific career
Institutions Google
Courant Institute of Mathematical Sciences
AT&T Bell Labs
Website cs.nyu.edu/~mohri/

Mehryar Mohri is a Professor and theoretical computer scientist [2] at the Courant Institute of Mathematical Sciences. He is also a Research Director at Google Research where he heads the Machine Learning Theory (ML Theory) team. [3]

Contents

Career

Prior to joining the Courant Institute, Mohri was a Research Department Head and later Technology Leader at AT&T Bell Labs, where he was a Member of the Technical Staff for about ten years. Mohri has also taught as an Assistant Professor at the University of Paris 7 (1992-1993) and Ecole Polytechnique (1992-1994). [4]

Research

Mohri's main area of research is machine learning, in particular learning theory. [5] He is also an expert in automata theory and algorithms. He is the author of several core algorithms that have served as the foundation for the design of many deployed speech recognition and natural language processing systems. [6]

Publications

Mohri is the author of the reference book Foundations of Machine Learning [7] used as a textbook in many graduate-level machine learning courses. [8] Mohri is also a member of the Lothaire group of mathematicians with the pseudonym M. Lothaire and contributed to the book on Applied Combinatorics on Words. [9] He is the author of more than 250 conference and journal publications.

Organizational affiliations

Mohri is currently the President of the Association for Algorithmic Learning Theory (AALT) [10] and the Steering Committee Chair for the ALT conference. [11] He is also Editorial Board member of Machine Learning [12] and TheoretiCS, [13] Action Editor of the Journal of Machine Learning Research (JMLR) and a member of the advisory board for the Journal of Automata, Languages and Combinatorics. [14] He has been the co-founder and co-organizer of the New York Academy of Sciences Machine Learning Symposium (NYAS ML Symposium [15] ) since 2006. [16]

Related Research Articles

In theoretical computer science and mathematics, the theory of computation is the branch that deals with what problems can be solved on a model of computation, using an algorithm, how efficiently they can be solved or to what degree. The field is divided into three major branches: automata theory and formal languages, computability theory, and computational complexity theory, which are linked by the question: "What are the fundamental capabilities and limitations of computers?".

<span class="mw-page-title-main">Theoretical computer science</span> Subfield of computer science and mathematics

Theoretical computer science is a subfield of computer science and mathematics that focuses on the abstract and mathematical foundations of computation.

ICALP, the International Colloquium on Automata, Languages, and Programming is an academic conference organized annually by the European Association for Theoretical Computer Science and held in different locations around Europe. Like most theoretical computer science conferences its contributions are strongly peer-reviewed. The articles have appeared in proceedings published by Springer in their Lecture Notes in Computer Science, but beginning in 2016 they are instead published by the Leibniz International Proceedings in Informatics.

ACM SIGACT or SIGACT is the Association for Computing Machinery Special Interest Group on Algorithms and Computation Theory, whose purpose is support of research in theoretical computer science. It was founded in 1968 by Patrick C. Fischer.

<span class="mw-page-title-main">Rajeev Alur</span> American computer scientist

Rajeev Alur is an American professor of computer science at the University of Pennsylvania who has made contributions to formal methods, programming languages, and automata theory, including notably the introduction of timed automata and nested words.

<i>Journal of Automata, Languages and Combinatorics</i> Academic journal

The Journal of Automata, Languages and Combinatorics (JALC) is a peer-reviewed scientific journal of computer science. It was established in 1965 as the Journal of Information Processing and Cybernetics and obtained its current title in 1996 with volume numbering reset to 1. The main focus of the journal is on automata theory, formal language theory, and combinatorics.

Informatics is the study of computational systems. According to the ACM Europe Council and Informatics Europe, informatics is synonymous with computer science and computing as a profession, in which the central notion is transformation of information. In some cases, the term "informatics" may also be used with different meanings, e.g. in the context of social computing, or in context of library science.

Christopher Umans is a professor of Computer Science in the Computing and Mathematical Sciences Department at the California Institute of Technology. He is known for work on algorithms, computational complexity, algebraic complexity, and hardness of approximation.

Michael Justin Kearns is an American computer scientist, professor and National Center Chair at the University of Pennsylvania, the founding director of Penn's Singh Program in Networked & Social Systems Engineering (NETS), the founding director of Warren Center for Network and Data Sciences, and also holds secondary appointments in Penn's Wharton School and department of Economics. He is a leading researcher in computational learning theory and algorithmic game theory, and interested in machine learning, artificial intelligence, computational finance, algorithmic trading, computational social science and social networks. He previously led the Advisory and Research function in Morgan Stanley's Artificial Intelligence Center of Excellence team, and is currently an Amazon Scholar within Amazon Web Services.

<span class="mw-page-title-main">Dominique Perrin</span> French mathematician & theoretical computer scientist (born 1946)

Dominique Pierre Perrin is a French mathematician and theoretical computer scientist known for his contributions to coding theory and to combinatorics on words. He is a professor of the University of Marne-la-Vallée and currently serves as the President of ESIEE Paris.

<span class="mw-page-title-main">Juhani Karhumäki</span> Finnish mathematician and theoretical computer scientist

Eero Urho Juhani Karhumäki is a Finnish mathematician and theoretical computer scientist known for his contributions to automata theory. He is a professor at the University of Turku in southwestern Finland.

The following outline is provided as an overview of, and topical guide to, machine learning:

Jean Berstel is a French mathematician and theoretical computer scientist known for his contributions to combinatorics on words and formal language theory. He is a currently a professor emeritus at the University of Marne-la-Vallée.

Oded Regev is an Israeli-American theoretical computer scientist and mathematician. He is a professor of computer science at the Courant institute at New York University. He is best known for his work in lattice-based cryptography, and in particular for introducing the learning with errors problem.

Aleksandar Nikolov is a Bulgarian and Canadian theoretical computer scientist working on differential privacy, discrepancy theory, and high-dimensional geometry. He is a professor at the University of Toronto.

Benjamin E. Rossman is an American mathematician and theoretical computer scientist, specializing in computational complexity theory. He is currently an associate professor of computer science and mathematics at Duke University.

References

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.