Cited by 1,122Machine Learning and AlgorithmsStochastic Gradient Optimization TechniquesNeural Networks and Applications

Foundations of Machine Learning

Open access
Mohri, Mehryar, Rostamizadeh, Afshin, Talwalkar, Ameet·2018·The MIT Press eBooks

Abstract

A new edition of a graduate-level machine learning textbook that focuses on the analysis and theory of algorithms. This book is a general introduction to machine learning that can serve as a textbook for graduate students and a reference for researchers. It covers fundamental modern topics in machine learning while providing the theoretical basis and conceptual tools needed for the discussion and justification of algorithms. It also describes several key aspects of the application of these algorithms. The authors aim to present novel theoretical tools and concepts while giving concise proofs even for relatively advanced topics. Foundations of Machine Learning is unique in its focus on the analysis and theory of algorithms. The first four chapters lay the theoretical foundation for what follows; subsequent chapters are mostly self-contained. Topics covered include the Probably Approximately Correct (PAC) learning framework; generalization bounds based on Rademacher complexity and VC-dimension; Support Vector Machines (SVMs); kernel methods; boosting; on-line learning; multi-class classification; ranking; regression; algorithmic stability; dimensionality reduction; learning automata and languages; and reinforcement learning. Each chapter ends with a set of exercises. Appendixes provide additional material including concise probability review. This second edition offers three new chapters, on model selection, maximum entropy models, and conditional entropy models. New material i…

Integrity signals

Registry

Crossref · 10.7551/mitpress/10290.001.0001

Cites

11 of 11 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Mohri, M., Rostamizadeh, A., & Talwalkar, A.
Affiliations
New York University (US)
Venue
The MIT Press eBooks
Publisher
The MIT Press
Published
2018-11-30
OpenAlex
W1944672
Cited by
1,122
References
11
Citations by year
2026: 14 · 2025: 3 · 2024: 6 · 2023: 14 · 2022: 32 · 2021: 249 · 2020: 232 · 2019: 159 · 2018: 100 · 2017: 62 · 2016: 72 · 2015: 100 · 2014: 62 · 2013: 14 · 2012: 2
FWCI
64.53
Type
book
Language
en
Open access
Locations
  • The MIT Press eBooks (publishedVersion, cc-by-nc-nd)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
  • Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
Keywords
machine learning theory, PAC learning, generalization bounds, Rademacher complexity, VC dimension, support vector machine, kernel methods, boosting, online learning, multi-class classification, ranking, regression analysis, algorithm stability, dimensionality reduction, learning automata, reinforcement learning, model selection, maximum entropy model, Fenchel duality, concentration inequalities, information theory

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review