Linear Algebra and Learning fr-轻识

This is a textbook to help readers understand the steps that lead to deep learning. Linear algebra comes first especially singular values, least squares, and matrix factorizations. Often the goal is a low rank approximation A = CR (column-row) to a large matrix of data to see its most important part. This uses the full array of applied linear algebra, including randomization for very large matrices. Then deep learning creates a large-scale optimization problem for the weights solved by gradient descent or better stochastic gradient descent. Finally, the book develops the architectures of fully connected neural nets and of Convolutional Neural Nets (CNNs) to find patterns in data. Audience: This book is for anyone who wants to learn how data is reduced and interpreted by and understand matrix methods. Based on the second linear algebra course taught by Professor Strang, whose lectures on the training data are widely known, it starts from scratch (the four fundamental subspaces) and is fully accessible without the first text.

Gilbert Strang is a Professor of Mathematics at Massachusetts Institute of Technology and an Honorary Fellow of Balliol College, Oxford University. He is also a prolific author of a dozen highly regarded textbooks and monographs. Gilbert Strang served as president of the Society for Industrial and Applied Mathematics (SIAM) from 1999-2000 and chaired the U.S. National Committee on Mathematics from 2003-2004. He won the Henrici and Su Buchin prizes at ICIAM 2007 and the Von Neumann Medal of the U.S. Association of Computational Mechanics. He is a SIAM Fellow and a member of the National Academy of Sciences.