Ankur Moitra
Professor of Applied Mathematics · MIT · Distinguished · author of Algorithmic Aspects of Machine Learning
Ankur Moitra is Professor of Applied Mathematics at MIT, working on algorithms, machine learning, spectral methods and tensor decompositions.
- lectures
- 11
- series
- 1
- hours
- 13
Start here
Series and courses
MIT 18.200: Principles of Discrete Applied Mathematics
In these lectures
- A first-order source generates length-n strings using independent and identically distributed samples from an unfair K-sided die.Data Compression and Shannon’s Noiseless Coding Theorem
- A group is a set with a binary operation that satisfies closure, associativity, identity, and inverse properties.Basic Group Theory
- Prefix-free codes allow unambiguous symbol-by-symbol decoding because no codeword is a prefix of another.Huffman Coding
Draws on
People cited in the lectures, at the moment of the citation.
- Herman ChernoffInventor of the Chernoff bound.
- Claude ShannonFounder of information theory in 1948
- Bob FanoMIT professor who offered Huffman the choice of a term paper or final exam
- Sun Tzu ShuantsingChinese mathematician in the 4th century, cited for the Chinese Remainder Theorem.
- Anne BeaufortCited for her model of communication expertise in new disciplines.
- DraftKings CTOFormer owner of the lecturer's house in Belmont
About
Ankur Moitra is Professor of Applied Mathematics at MIT, working on algorithms, machine learning, spectral methods and tensor decompositions. His undergraduate course MIT 18.200 proves Shannon's coding theorems, Chernoff bounds, Lagrange's theorem and von Neumann's minimax theorem.
Taught with
Same subject, Mathematics
Connections
20Their places, courses, books and lectures.


