Our search has the following Google-type functionality:
If you use '+' at the start of a word, that word will be present in the search results.
eg. Harry +Potter
Search results will contain 'Potter'.
If you use '-' at the start of a word, that word will be absent in the search results.
eg. Harry -Potter
Search results will not contain 'Potter'.
If you use 'AND' between 2 words, then both those words will be present in the search results.
eg. Harry AND Potter
Search results will contain both 'Harry' and 'Potter'.
NOTE: AND will only work with single words not phrases.
If you use 'OR' between 2 single words, then either or both of those words will be present in the search results.
eg. 'Harry OR Potter'
Search results will contain just 'Harry', or just 'Potter', or both 'Harry' and 'Potter'.
NOTE: OR will only work with single words not phrases.
If you use 'NOT' before a word, that word will be absent in the search results. (This is the same as using the minus symbol).
eg. 'Harry NOT Potter'
Search results will not contain 'Potter'.
NOTE: NOT will only work with single words not phrases.
If you use double quotation marks around words, those words will be present in that order.
eg. "Harry Potter"
Search results will contain 'Harry Potter', but not 'Potter Harry'.
NOTE: "" cannot be combined with AND, OR & NOT searches.
If you use '*' in a word, it performs a wildcard search, as it signifies any number of characters. (Searches cannot start with a wildcard).
Search results will contain words starting with 'Pot' and ending in 'er', such as 'Potter'.
Ankur Moitra is the Rockwell International Associate Professor of Mathematics at Massachusetts Institute of Technology. He is a principal investigator in the Computer Science and Artificial Intelligence Lab (CSAIL), a core member of the Theory of Computation Group, Machine Learning@MIT, and the Center for Statistics. The aim of his work is to bridge the gap between theoretical computer science and machine learning by developing algorithms with provable guarantees and foundations for reasoning about their behavior. He is a recipient of a Packard Fellowship, a Sloan Fellowship, an National Science Foundation (NSF) CAREER Award, an NSF Computing and Innovation Fellowship and a Hertz Fellowship.
Advance praise: 'The unreasonable effectiveness of modern machine learning has thrown the gauntlet down to theoretical computer science. Why do heuristic algorithms so often solve problems that are intractable in the worst case? Is there predictable structure in the problem instances that arise in practice? Can we design novel algorithms that exploit such structure? This book is an introduction to the state-of-the-art at the interface of machine learning and theoretical computer science, lucidly written by a leading expert in the area.' Tim Roughgarden, Stanford University, California Advance praise: 'This book is a gem. It is a series of well-chosen and organized chapters, each centered on one algorithmic problem arising in machine learning applications. In each, the reader is lead through different ways of thinking about these problems, modeling them, and applying different algorithmic techniques to solving them. In this process, the reader learns new mathematical techniques from algebra, probability, geometry and analysis that underlie the algorithms and their complexity. All this material is delivered in a clear and intuitive fashion.' Avi Wigderson, Institute for Advanced Study, New Jersey Advance praise: 'A very readable introduction to a well-curated set of topics and algorithms. It will be an excellent resource for students and researchers interested in theoretical machine learning and applied mathematics.' Sanjeev Arora, Princeton University, New Jersey Advance praise: 'This text gives a clear exposition of important algorithmic problems in unsupervised machine learning including nonnegative matrix factorization, topic modeling, tensor decomposition, matrix completion, compressed sensing, and mixture model learning. It describes the challenges that these problems present, gives provable guarantees known for solving them, and explains important algorithmic techniques used. This is an invaluable resource for instructors and students, as well as all those interested in understanding and advancing research in this area.' Avrim Blum, Toyota Technical Institute at Chicago