To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Aimed at undergraduate students, this text guides readers through the methods and principles of machine learning in an approachable manner without sacrificing mathematical precision or notation. Step-by-step explanations allow students to grasp complicated mathematical calculations and translate the theory and mathematics into programming and applications. The text presents machine learning concepts visually, and uses example datasets from fictional hippopotamuses and illustrations to explain the material in a unique, but easily understood and engaging way. Worked examples connect the mathematics and algorithms to real-world applications and enable students to utilize this technology in new and ever-changing circumstances. Topics covered include Bayesian reasoning, linear regression and classification, margin-based classification, cross-validation, neural networks, decision trees, clustering and dimensionality reduction. End-of-chapter mathematical exercises and additional coding projects reinforce application and decision-making skills.
This gentle introduction to the most important techniques in natural language processing uses a unified mathematical and algorithmic framework and gradually increases in complexity. Topics covered range from n-gram language models to large language models (LLMs), from perceptron to deep learning, from text classification to structured prediction (e.g., sequence labelling, segmentation, and parsing) and generation, and from discrete representation to neural representation of linguistics structures. This book provides a comprehensive overview of NLP, making it ideal for upper undergraduate and graduate students in computer science and a valuable reference for researchers and engineers. Exercises of varying difficulty are provided as well as teaching slides and tutorial videos. The new edition features three new chapters on pre-trained language models and large language models as well as a new preliminary chapter overviewing data and model as a framework for NLP methods.
Kernel methods, with origins in the pioneering work of Mercer (1909), Bochner (1933), and Aronszajn (1950), have become central tools in modern mathematics and machine learning. This book explores their deep connections with approximation theory, highlighting both classical results and cutting-edge developments. Through clear explanations and illustrative examples, it guides readers from foundational concepts to contemporary applications, including computational methods and real-world problem solving. By bridging theory and practice, the text not only provides a rigorous understanding of kernels but also inspires further exploration and research. Suitable for students, researchers, and practitioners, it invites readers to engage with ongoing advances in this dynamic field and to contribute to its future growth.
Bridging the gap between introductory texts and the specialized research literature, this is one of the first truly rigorous yet accessible treatments of modern reinforcement learning. Written by three leading researchers with over a decade of teaching experience, the book uniquely combines mathematical precision with practical insights. It progresses naturally from planning (dynamic programming, MDPs, value and policy iteration) to learning (model-based and model-free algorithms, function approximation, policy gradients, and regret minimization). Each concept is developed from first principles with complete proofs, making the material self-contained. The modular chapter organization enables flexible course design. The book's website offers battle-tested exercises refined through years of classroom use. Combining mathematical rigor with practical applications, this definitive text is ideal for advanced undergraduate and graduate students as well as practitioners seeking a deep understanding of sequential decision-making and intelligent agent design.
This book offers a comprehensive introduction to Markov decision process and reinforcement learning fundamentals using common mathematical notation and language. Its goal is to provide a solid foundation that enables readers to engage meaningfully with these rapidly evolving fields. Topics covered include finite and infinite horizon models, partially observable models, value function approximation, simulation-based methods, Monte Carlo methods, and Q-learning. Rigorous mathematical concepts and algorithmic developments are supported by numerous worked examples. As an up-to-date successor to Martin L. Puterman's influential 1994 textbook, this volume assumes familiarity with probability, mathematical notation, and proof techniques. It is ideally suited for students, researchers, and professionals in operations research, computer science, engineering, and economics.
Originating from lectures delivered at the African Institute of Mathematical Sciences, this book presents a unifying perspective on traditional and modern methods in generative AI and stochastic thermodynamics. By relating the core topics in machine learning to the notion of (variational) free-energy, a bridge is built between methods such as latent variable models, variational auto-encoders, optimal control, optimal transport, normalizing flows and diffusion models and concepts such as entropy production and fluctuation theorems in stochastic thermodynamics. Structured into three main parts, the book commences by setting up the required mathematical and statistical physics preliminaries needed to make it broadly accessible. The largest part of the book then focuses on building intuition of major advances in generative AI by considering discrete time processes and their relationship to topics in stochastic thermodynamics. Finally, the authors take a short excursion to the continuous time domain for the more advanced learner.
Based on courses taught at the University of Cambridge, this text presents core contemporary statistical methods and theory in an accessible, self-contained and rigorous fashion, with a focus on finite-sample guarantees as opposed to asymptotic arguments. Many of the topics and results have not appeared in book form previously, and some constitute new research. The prerequisites are relatively light (primarily a good grasp of linear algebra and real analysis) and complete solutions to all 250+ exercises are available online. It is the perfect entry point to the subject for master's and graduate-level students in statistics, data science and machine learning, as well as related disciplines such as artificial intelligence, signal processing, information theory, electrical engineering and econometrics. Researchers in these fields will also find it an invaluable resource. This title is also available as Open Access on Cambridge Core.
This collection of articles and interviews surveys human-centered approaches to machine learning that can make AI more human-friendly, usable, and ethical. It provides a handbook for students, researchers, and practitioners who want new ways of approaching AI that place humanity at their center. It shows how to apply methods from human-computer interaction to the new technologies of AI and ML with a view to enabling computing technology to become user-friendly and human-centric. The book has 13 articles and 9 interviews from a range of different perspectives, helping readers understand existing machine learning systems and their impacts on people and society. It is an ideal introduction both for human-computer interaction practitioners who are interested in working with ML and for ML experts interested in making their practice more human-centered. The book offers a critical lens on existing machine learning alongside an optimistic vision of AI in the service of humanity.
This book presents a modern introduction to the field of algorithmic game theory. It places a heavy emphasis on optimization and online learning (a subdiscipline of machine learning), which are tools that increasingly play a central role in both the theory and practice of applying game-theoretic ideas. The book covers the core techniques used in several majorly successful applications, including techniques used for creating superhuman poker AIs, the theory behind the 'pacing' methodology that has become standard in the internet advertising industry, and the application of competitive equilibrium from equal incomes for fair course seat allocation in many business schools. With its focus on online learning tools, this book is an ideal companion to classic texts on algorithmic game theory for graduate students and researchers.
Statistical modelling and machine learning offer a vast toolbox of inference methods with which to model the world, discover patterns and reach beyond the data to make predictions when the truth is not certain. This concise book provides a clear introduction to those tools and to the core ideas – probabilistic model, likelihood, prior, posterior, overfitting, underfitting, cross-validation – that unify them. Toy and real examples illustrate diverse applications ranging from biomedical data to treasure hunts, while the accompanying datasets and computational notebooks in R and Python encourage hands-on learning. Instructors can benefit from online lecture slides and solutions to all the exercises. Requiring only first-year university-level knowledge of calculus, probability and linear algebra, the book equips students in statistics, data science and machine learning, as well as those in quantitative applied and social science programmes, with the tools and conceptual foundations to explore more advanced techniques.
Deep learning models are powerful, but are often large, slow, and expensive to run. This book is a practical guide to accelerating and compressing neural networks using proven techniques such as quantization, pruning, distillation, and fast architectures. It explains how and why these methods work, fostering a comprehensive understanding. Written for engineers, researchers, and advanced students, the book combines clear theoretical insights with hands-on PyTorch implementations and numerical results. Readers will learn how to reduce inference time and memory usage, lower deployment costs, and select the right acceleration strategy for their task. Whether you're working with large language models, vision systems, or edge devices, this book gives you the tools and intuition needed to build faster, leaner AI systems, without sacrificing performance. It is perfect for anyone who wants to go beyond intuition and take a principled approach to optimizing AI systems
This comprehensive modern look at regression covers a wide range of topics and relevant contemporary applications, going well beyond the topics covered in most introductory books. With concision and clarity, the authors present linear regression, nonparametric regression, classification, logistic and Poisson regression, high-dimensional regression, quantile regression, conformal prediction and causal inference. There are also brief introductions to neural nets, deep learning, random effects, survival analysis, graphical models and time series. Suitable for advanced undergraduate and beginning graduate students, the book will also serve as a useful reference for researchers and practitioners in data science, machine learning, and artificial intelligence who want to understand modern methods for data analysis.
The burgeoning field of differential equations on graphs has experienced significant growth in the past decade, propelled by the use of variational methods in imaging and by its applications in machine learning. This text provides a detailed overview of the subject, serving as a reference for researchers and as an introduction for graduate students wishing to get up to speed. The authors look through the lens of variational calculus and differential equations, with a particular focus on graph-Laplacian-based models and the graph Ginzburg-Landau functional. They explore the diverse applications, numerical challenges, and theoretical foundations of these models. A meticulously curated bibliography comprising approximately 800 references helps to contextualise this work within the broader academic landscape. While primarily a review, this text also incorporates some original research, extending or refining existing results and methods.
This comprehensive reference brings readers to the frontier of research on bandit convex optimization or zeroth-order convex optimization. The focus is on theoretical aspects, with short, self-contained chapters covering all the necessary tools from convex optimization and online learning, including gradient-based algorithms, interior point methods, cutting plane methods and information-theoretic machinery. The book features a large number of exercises, open problems and pointers to future research directions, making it ideal for students as well as researchers.
This tutorial guide introduces online nonstochastic control, an emerging paradigm in control of dynamical systems and differentiable reinforcement learning that applies techniques from online convex optimization and convex relaxations to obtain new methods with provable guarantees for classical settings in optimal and robust control. In optimal control, robust control, and other control methodologies that assume stochastic noise, the goal is to perform comparably to an offline optimal strategy. In online control, both cost functions and perturbations from the assumed dynamical model are chosen by an adversary. Thus, the optimal policy is not defined a priori and the goal is to attain low regret against the best policy in hindsight from a benchmark class of policies. The resulting methods are based on iterative mathematical optimization algorithms and are accompanied by finite-time regret and computational complexity guarantees. This book is ideal for graduate students and researchers interested in bridging classical control theory and modern machine learning.
Emphasizing how and why machine learning algorithms work, this introductory textbook bridges the gap between the theoretical foundations of machine learning and its practical algorithmic and code-level implementation. Over 85 thorough worked examples, in both Matlab and Python, demonstrate how algorithms are implemented and applied whilst illustrating the end result. Over 75 end-of-chapter problems empower students to develop their own code to implement these algorithms, equipping them with hands-on experience. Matlab coding examples demonstrate how a mathematical idea is converted from equations to code, and provide a jumping off point for students, supported by in-depth coverage of essential mathematics including multivariable calculus, linear algebra, probability and statistics, numerical methods, and optimization. Accompanied online by instructor lecture slides, downloadable Python code and additional appendices, this is an excellent introduction to machine learning for senior undergraduate and graduate students in Engineering and Computer Science.
This book bridges the gap between theoretical machine learning (ML) and its practical application in industry. It serves as a handbook for shipping production-grade ML systems, addressing challenges often overlooked in academic texts. Drawing on their experience at several major corporations and startups, the authors focus on real-world scenarios, guiding practitioners through the ML lifecycle, from planning and data management to model deployment and optimization. They highlight common pitfalls and offer interview-based case studies from companies that illustrate diverse industrial applications and their unique challenges. Multiple pathways through the book allow readers to choose which stage of the ML development process to focus on, as well as the learning strategy ('crawl,' 'walk,' or 'run') that best suits the needs of their project or team.
Bridge the gap between theoretical concepts and their practical applications with this rigorous introduction to the mathematics underpinning data science. It covers essential topics in linear algebra, calculus and optimization, and probability and statistics, demonstrating their relevance in the context of data analysis. Key application topics include clustering, regression, classification, dimensionality reduction, network analysis, and neural networks. What sets this text apart is its focus on hands-on learning. Each chapter combines mathematical insights with practical examples, using Python to implement algorithms and solve problems. Self-assessment quizzes, warm-up exercises and theoretical problems foster both mathematical understanding and computational skills. Designed for advanced undergraduate students and beginning graduate students, this textbook serves as both an invitation to data science for mathematics majors and as a deeper excursion into mathematics for data science students.
This focused textbook demonstrates cutting-edge concepts at the intersection of machine learning (ML) and wireless communications, providing students with a deep and insightful understanding of this emerging field. It introduces students to a broad array of ML tools for effective wireless system design, and supports them in exploring ways in which future wireless networks can be designed to enable more effective deployment of federated and distributed learning techniques to enable AI systems. Requiring no previous knowledge of ML, this accessible introduction includes over 20 worked examples demonstrating the use of theoretical principles to address real-world challenges, and over 100 end-of-chapter exercises to cement student understanding, including hands-on computational exercises using Python. Accompanied by code supplements and solutions for instructors, this is the ideal textbook for a single-semester senior undergraduate or graduate course for students in electrical engineering, and an invaluable reference for academic researchers and professional engineers in wireless communications.
Bridging theory and practice in network data analysis, this guide offers an intuitive approach to understanding and analyzing complex networks. It covers foundational concepts, practical tools, and real-world applications using Python frameworks including NumPy, SciPy, scikit-learn, graspologic, and NetworkX. Readers will learn to apply network machine learning techniques to real-world problems, transform complex network structures into meaningful representations, leverage Python libraries for efficient network analysis, and interpret network data and results. The book explores methods for extracting valuable insights across various domains such as social networks, ecological systems, and brain connectivity. Hands-on tutorials and concrete examples develop intuition through visualization and mathematical reasoning. The book will equip data scientists, students, and researchers in applications using network data with the skills to confidently tackle network machine learning projects, providing a robust toolkit for data science applications involving network-structured data.