Skip to content

Due to scheduled maintenance, online ordering, in regions where offered, will not be available on this site from 08:00 until noon GMT on Sunday 17th February. We apologise for the inconvenience.

Cart

Your Cart

×

You have 0 items in your cart.

Register Sign in Wishlist

Algorithmic Aspects of Machine Learning

$34.99 (P)

  • Date Published: September 2018
  • availability: In stock
  • format: Paperback
  • isbn: 9781316636008

$ 34.99 (P)
Paperback

Add to cart Add to wishlist

Other available formats:
Hardback, eBook


Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • This book bridges theoretical computer science and machine learning by exploring what the two sides can teach each other. It emphasizes the need for flexible, tractable models that better capture not what makes machine learning hard, but what makes it easy. Theoretical computer scientists will be introduced to important models in machine learning and to the main questions within the field. Machine learning researchers will be introduced to cutting-edge research in an accessible format, and gain familiarity with a modern, algorithmic toolkit, including the method of moments, tensor decompositions and convex programming relaxations. The treatment beyond worst-case analysis is to build a rigorous understanding about the approaches used in practice and to facilitate the discovery of exciting, new ways to solve important long-standing problems.

    • Covers exciting recent developments in theoretical machine learning
    • Introduces sophisticated mathematical tools and demonstrates their use in designing and analyzing algorithms
    • Includes numerous exercises to challenge the reader's understanding
    Read more

    Reviews & endorsements

    '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

    '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

    '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

    '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

    'Moitra … has written a high-level, fast-paced book on connections between theoretical computer science and machine learning. … A main theme throughout the book is to go beyond worst-case analysis of algorithms. This is done in three ways: by probabilistic algorithms, by algorithms that are very efficient on simple inputs, and by notions of stability that emphasize instances of problems that have meaningful answers and thus are particularly important to solve. … Summing Up: Highly recommended.' M. Bona, Choice

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: September 2018
    • format: Paperback
    • isbn: 9781316636008
    • length: 158 pages
    • dimensions: 228 x 152 x 10 mm
    • weight: 0.24kg
    • availability: In stock
  • Table of Contents

    1. Introduction
    2. Nonnegative matrix factorization
    3. Tensor decompositions – algorithms
    4. Tensor decompositions – applications
    5. Sparse recovery
    6. Sparse coding
    7. Gaussian mixture models
    8. Matrix completion.

  • Author

    Ankur Moitra, Massachusetts Institute of Technology
    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.

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×