Mehryar Mohri, Afshin Rostamizadeh, and Ameet Talwalkar.
EDITION STATEMENT
Edition Statement
Second edition.
.PUBLICATION, DISTRIBUTION, ETC
Place of Publication, Distribution, etc.
Cambridge, Massachusetts :
Name of Publisher, Distributor, etc.
The MIT Press,
Date of Publication, Distribution, etc.
[2018]
PHYSICAL DESCRIPTION
Specific Material Designation and Extent of Item
xv, 486 pages :
Other Physical Details
illustrations (some color) ;
Dimensions
24 cm.
SERIES
Series Title
Adaptive computation and machine learning
INTERNAL BIBLIOGRAPHIES/INDEXES NOTE
Text of Note
Includes bibliographical references and index.
CONTENTS NOTE
Text of Note
The PAC learning framework -- Rademacher complexity and VC-dimension -- Model selection -- Support vector machines -- Kernel methods - Boosting -- On-line learning -- Multi-class classification -- Ranking -- Regression -- Maximum entropy models -- Conditional maximum entropy models -- Algorithmic stability -- Dimensionality reduction -- Learning automata and languages -- Reinforcement learning -- Conclusion -- Appendices: Linear algebra review ; Convex optimization ; Probability review ; Concentration inequalities ; Notions of information theory.
0
SUMMARY OR ABSTRACT
Text of Note
"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 in the appendixes includes a major section on Fenchel duality, expanded coverage of concentration inequalities, and an entirely new entry on information theory. More than half of the exercises are new to this edition--Provided by publisher.