Mehryar Mohri

Last updated
Mehryar Mohri
Mehryar Mohri, Scholar Photo.jpg
Mehryar Mohri, 2020.
Born (1964-10-20) October 20, 1964 (age 59)
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 Learning 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]

Related Research Articles

<span class="mw-page-title-main">Theory of computation</span> Academic subfield of computer science

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">John Hopcroft</span> American computer scientist (born 1939)

John Edward Hopcroft is an American theoretical computer scientist. His textbooks on theory of computation and data structures are regarded as standards in their fields. He is the IBM Professor of Engineering and Applied Mathematics in Computer Science at Cornell University, Co-Director of the Center on Frontiers of Computing Studies at Peking University, and the Director of the John Hopcroft Center for Computer Science at Shanghai Jiao Tong University.

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

Theoretical computer science (TCS) is a subset of general computer science and mathematics that focuses on mathematical aspects of computer science such as the theory of computation, formal language theory, the lambda calculus and type theory.

Algorithmic learning theory is a mathematical framework for analyzing machine learning problems and algorithms. Synonyms include formal learning theory and algorithmic inductive inference. Algorithmic learning theory is different from statistical learning theory in that it does not make use of statistical assumptions and analysis. Both algorithmic and statistical learning theory are concerned with machine learning and can thus be viewed as branches of computational learning theory.

A finite-state transducer (FST) is a finite-state machine with two memory tapes, following the terminology for Turing machines: an input tape and an output tape. This contrasts with an ordinary finite-state automaton, which has a single tape. An FST is a type of finite-state automaton (FSA) that maps between two sets of symbols. An FST is more general than an FSA. An FSA defines a formal language by defining a set of accepted strings, while an FST defines a relation between sets of strings.

<span class="mw-page-title-main">Marcel-Paul Schützenberger</span> French mathematician

Marcel-Paul "Marco" Schützenberger was a French mathematician and Doctor of Medicine. He worked in the fields of formal language, combinatorics, and information theory. In addition to his formal results in mathematics, he was "deeply involved in [a] struggle against the votaries of [neo-]Darwinism", a stance which has resulted in some mixed reactions from his peers and from critics of his stance on evolution. Several notable theorems and objects in mathematics as well as computer science bear his name. Paul Schützenberger was his great-grandfather.

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">Jaroslav Nešetřil</span> Czech mathematician

Jaroslav (Jarik) Nešetřil is a Czech mathematician, working at Charles University in Prague. His research areas include combinatorics, graph theory, algebra, posets, computer science.

<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 (German: Elektronische Informationsverarbeitung und Kybernetik) 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.

<span class="mw-page-title-main">Dimitri Bertsekas</span>

Dimitri Panteli Bertsekas is an applied mathematician, electrical engineer, and computer scientist, a McAfee Professor at the Department of Electrical Engineering and Computer Science in School of Engineering at the Massachusetts Institute of Technology (MIT), Cambridge, Massachusetts, and also a Fulton Professor of Computational Decision Making at Arizona State University, Tempe.

<span class="mw-page-title-main">Grzegorz Rozenberg</span> Polish and Dutch computer scientist

Grzegorz Rozenberg is a Polish and Dutch computer scientist.

<i>Information Processing Letters</i> Academic journal

Information Processing Letters is a peer-reviewed scientific journal in the field of computer science, published by Elsevier. The aim of the journal is to enable fast dissemination of results in the field of information processing in the form of short papers. Submissions are limited to nine double-spaced pages.

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>

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.

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.

Arun Sharma is an Indian Australian computer science professor. He is a distinguished emeritus professor at the Queensland University of Technology (QUT) where he was the Deputy Vice-Chancellor for Research and Commercialisation from 2004 to 2019. He is the Council Chair of the QIMR Berghofer Medical Research Institute. Within the multinational Adani Group, he is also an Advisor to the Chairman and Group Head for Sustainability and Climate Change. He was a cofounder of Australia's National ICT Research Centre of Excellence (NICTA), and Director of the Translational Research Institute (Australia). In the course of his institutional duties, Sharma played a significant role in the development of Australian technology research capability, the promotion of translational research in agriculture and biosciences within Queensland, and the fostering of international technological research cooperation between Australia and India. Sharma's professional achievements have been recognized by awards by the Premier of Queensland, the Office of the Chief Scientist (Australia), the India Australia Business & Community Awards (IABCA), the Birla Institute of Technology & Science, and the Royal Order of Australia. He was born in the town of Banmankhi in the Indian state of Bihar.

References