Linear Algebra And Learning From Data

Linear algebra and the foundations of deep learning, together at last! From Professor Gilbert Strang, acclaimed author of Introduction to Linear Algebra, comes Linear Algebra and Learning from Data, the first textbook that teaches linear algebra together with deep learning and neural nets. This readable yet rigorous textbook contains a complete course in the linear algebra and related mathematics that students need to know to get to grips with learning from data. Included are: the four fundamental subspaces, singular value decompositions, special matrices, large matrix computation techniques, compressed sensing, probability and statistics, optimization, the architecture of neural nets, stochastic gradient descent and backpropagation.

This textbook introduces linear algebra and optimization in the context of machine learning. Examples and exercises are provided throughout the book. A solution manual for the exercises at the end of each chapter is available to teaching instructors. This textbook targets graduate level students and professors in computer science, mathematics and data science. Advanced undergraduate students can also use this textbook. The chapters for this textbook are organized as follows: 1. Linear algebra and its applications: The chapters focus on the basics of linear algebra together with their common applications to singular value decomposition, matrix factorization, similarity matrices (kernel methods), and graph analysis. Numerous machine learning applications have been used as examples, such as spectral clustering, kernel-based classification, and outlier detection. The tight integration of linear algebra methods with examples from machine learning differentiates this book from generic volumes on linear algebra. The focus is clearly on the most relevant aspects of linear algebra for machine learning and to teach readers how to apply these concepts. 2. Optimization and its applications: Much of machine learning is posed as an optimization problem in which we try to maximize the accuracy of regression and classification models. The “parent problem” of optimization-centric machine learning is least-squares regression. Interestingly, this problem arises in both linear algebra and optimization, and is one of the key connecting problems of the two fields. Least-squares regression is also the starting point for support vector machines, logistic regression, and recommender systems. Furthermore, the methods for dimensionality reduction and matrix factorization also require the development of optimization methods. A general view of optimization in computational graphs is discussed together with its applications to back propagation in neural networks. A frequent challenge faced by beginners in machine learning is the extensive background required in linear algebra and optimization. One problem is that the existing linear algebra and optimization courses are not specific to machine learning; therefore, one would typically have to complete more course material than is necessary to pick up machine learning. Furthermore, certain types of ideas and tricks from optimization and linear algebra recur more frequently in machine learning than other application-centric settings. Therefore, there is significant value in developing a view of linear algebra and optimization that is better suited to the specific perspective of machine learning.

Linear algebra has become the subject to know for people in quantitative disciplines of all kinds. No longer the exclusive domain of mathematicians and engineers, it is now used everywhere there is data and everybody who works with data needs to know more. This new book from Professor Gilbert Strang, author of the acclaimed Introduction to Linear Algebra, now in its fifth edition, makes linear algebra accessible to everybody, not just those with a strong background in mathematics. It takes a more active start, beginning by finding independent columns of small matrices, leading to the key concepts of linear combinations and rank and column space. From there it passes on to the classical topics of solving linear equations, orthogonality, linear transformations and subspaces, all clearly explained with many examples and exercises. The last major topics are eigenvalues and the important singular value decomposition, illustrated with applications to differential equations and image compression. A final optional chapter explores the ideas behind deep learning.

Distills key concepts from linear algebra, geometry, matrices, calculus, optimization, probability and statistics that are used in machine learning.

Linear algebra is a pillar of machine learning. You cannot develop a deep understanding and application of machine learning without it. In this laser-focused Ebook, you will finally cut through the equations, Greek letters, and confusion, and discover the topics in linear algebra that you need to know. Using clear explanations, standard Python libraries, and step-by-step tutorial lessons, you will discover what linear algebra is, the importance of linear algebra to machine learning, vector, and matrix operations, matrix factorization, principal component analysis, and much more.

A groundbreaking introduction to vectors, matrices, and least squares for engineering applications, offering a wealth of practical examples.

Master matrix methods via engaging data-driven applications, aided by classroom-tested quizzes, homework exercises and online Julia demos.

Differential equations and linear algebra are two central topics in the undergraduate mathematics curriculum. This innovative textbook allows the two subjects to be developed either separately or together, illuminating the connections between two fundamental topics, and giving increased flexibility to instructors. It can be used either as a semester-long course in differential equations, or as a one-year course in differential equations, linear algebra, and applications. Beginning with the basics of differential equations, it covers first and second order equations, graphical and numerical methods, and matrix equations. The book goes on to present the fundamentals of vector spaces, followed by eigenvalues and eigenvectors, positive definiteness, integral transform methods and applications to PDEs. The exposition illuminates the natural correspondence between solution methods for systems of equations in discrete and continuous settings. The topics draw on the physical sciences, engineering and economics, reflecting the author's distinguished career as an applied mathematician and expositor.