Difference between revisions of "MAT2253"

From Department of Mathematics at UTSA
Jump to navigation Jump to search
(moved matrix factorization up)
(made the schedule week to week)
 
Line 10: Line 10:
  
 
{| class="wikitable"
 
{| class="wikitable"
−
! Session !! Section !! Topic !! Prerequisites !! SLOs
+
! Week !! Section !! Topic !! Prerequisites !! SLOs
 
|-
 
|-
 
| 1 || 2.1 || Systems of Linear Equations ||  ||  
 
| 1 || 2.1 || Systems of Linear Equations ||  ||  
 
|-
 
|-
−
| 2 || 2.2 || Matrices ||  ||  
+
| rowspan="2" | 2 || 2.2 || Matrices ||  ||  
 
|-
 
|-
−
| 3 || 2.3 || Solving systems of linear equations ||  ||  
+
| 2.3 || Solving systems of linear equations ||  ||  
 
|-
 
|-
−
| 4 || 2.4 || Vector spaces ||  ||  
+
| 3 || 2.4 || Vector spaces ||  ||  
 
|-
 
|-
−
| 5 || 2.5 ||Linear Independence ||  ||  
+
| rowspan="2" | 4 || 2.5 || Linear Independence ||  ||  
 
|-
 
|-
−
| 6 || 2.6 || Basis & Rank ||  ||  
+
| 2.6 || Basis & Rank ||  ||  
 
|-
 
|-
−
| 7 || Exam 1 ||  ||  ||  
+
| rowspan="2" | 5 || Exam 1 ||  ||  ||  
 
|-
 
|-
−
| 8 || 2.7 || Linear Mappings ||  ||  
+
| 2.7 || Linear Mappings ||  ||  
 
|-
 
|-
−
| 9 || 2.7 || Linear Mappings (examples) ||  ||  
+
| rowspan="2" | 6 || 2.7 || Linear Mappings (examples) ||  ||  
 
|-
 
|-
−
| 10 || 4.1 || Determinant and Traces ||  ||  
+
| 4.1 || Determinant and Traces ||  ||  
 
|-
 
|-
−
| 11 || 4.2 || Eigenvalues & Eigenvectors ||  ||  
+
| rowspan="2" | 7 || 4.2 || Eigenvalues & Eigenvectors ||  ||  
 
|-
 
|-
−
| 12 || 4.3, 4.4 || Matrix Factorization ||  ||
+
| 4.3, 4.4 || Matrix Factorization ||  ||  
 
|-
 
|-
−
| 13 || 3.1, 3.2, 3.3 || Norms, Inner Products, Lengths & Distances ||  ||  
+
| rowspan="2" | 8 || 3.1, 3.2, 3.3 || Norms, Inner Products, Lengths & Distances ||  ||  
 
|-
 
|-
−
| 14 || 3.4 || Angles & orthogonality ||  ||  
+
| 3.4 || Angles & orthogonality ||  ||  
 
|-
 
|-
−
| 15 || 3.5 || Orthonormal Basis ||  ||  
+
| rowspan="3" | 9 || 3.5 || Orthonormal Basis ||  ||  
 
|-
 
|-
−
| 16 || 3.7 || Inner Product of Functions ||  ||  
+
| 3.7 || Inner Product of Functions ||  ||  
 
|-
 
|-
−
| 17 || Project 1 ||  ||  ||  
+
| Project 1 ||  ||  ||  
 
|-
 
|-
−
| 18 || 5.1 ||Vector Calculus Intro and Taylor Series ||  ||  
+
| rowspan="3" | 10 || 5.1 || Vector Calculus Intro and Taylor Series ||  ||  
 
|-
 
|-
−
| 19 || 5.1, 5.2 || Differentiation Rules Review and Partial Derivatives ||  ||  
+
| 5.1, 5.2 || Differentiation Rules Review and Partial Derivatives ||  ||  
 
|-
 
|-
−
| 20 || 5.2 || Gradients- Examples, visualizations, computation ||  ||  
+
| 5.2 || Gradients- Examples, visualizations, computation ||  ||  
 
|-
 
|-
−
| 21 || 5.3 || Gradients of Vector-Valued Functions ||  ||  
+
| rowspan="2" | 11 || 5.3 || Gradients of Vector-Valued Functions ||  ||  
 
|-
 
|-
−
| 22 || 5.4, Dhrymes 78 || Gradients of Matrices ||  ||  
+
| 5.4, Dhrymes 78 || Gradients of Matrices ||  ||  
 
|-
 
|-
−
| 23 || Exam 2 ||  ||  ||  
+
| rowspan="2" | 12 || Exam 2 ||  ||  ||  
 
|-
 
|-
−
| 24 || 5.5, Dhrymes 78 || Useful Identities for Computing Gradients ||  ||  
+
| 5.5, Dhrymes 78 || Useful Identities for Computing Gradients ||  ||  
 
|-
 
|-
−
| 25 || 5.7 || Higher-Order Derivatives ||  ||  
+
| rowspan="3" | 13 || 5.7 || Higher-Order Derivatives ||  ||  
 
|-
 
|-
−
| 26 || Notes || Minimization via Newton's Method & Backpropagation ||  ||  
+
| Notes || Minimization via Newton's Method & Backpropagation ||  ||  
 
|-
 
|-
−
| 27 ||Project 2 ||  ||  ||  
+
| Project 2 ||  ||  ||  
 
|-
 
|-
−
| 28 || 5.8 || Multivariate Taylor Series ||  ||  
+
| rowspan="3" | 14 || 5.8 || Multivariate Taylor Series ||  ||  
 
|-
 
|-
−
| 29 || Notes || Linear optimization: Simplex method ||  ||  
+
| Notes || Linear optimization: Simplex method ||  ||  
 
|-
 
|-
−
| 30 || 7.1 || Optimization Using Gradient Descent ||  ||  
+
| 7.1 || Optimization Using Gradient Descent ||  ||  
 
|-
 
|-
−
| 31|| 7.2 and Notes || Constrained Optimization and Lagrange Multipliers: PCA ||  ||  
+
| rowspan="3" | 15 || 7.2 and Notes || Constrained Optimization and Lagrange Multipliers: PCA ||  ||  
 
|-
 
|-
−
| 32 || 7.3 || Convex Optimization (time permitting) ||  ||  
+
| Bishop, Duda et al. || Feed-forward Artificial Neural Networks ||  ||  
 
|-
 
|-
−
| 33 || Bishop, Duda et al. || Feed-forward Artificial Neural Networks ||  ||  
+
| Bishop, Duda et al. || Backpropagation in ANNs ||  ||  
 
|-
 
|-
−
| 34 || Bishop, Duda et al. || Backpropagation in ANNs ||  ||  
+
| rowspan="3" | 16 || Bishop, Duda et al. || Activation Functions: Linear & Nonlinear ||  ||  
 
|-
 
|-
−
| 35 || Bishop, Duda et al. || Activation Functions: Linear & Nonlinear ||  ||  
+
| Bishop, Duda et al. || Step-by-step simple ANN ||  ||  
 
|-
 
|-
−
| 36 || Bishop, Duda et al. || Step-by-step simple ANN ||  ||
+
| Final Project ||  ||  ||  
−
|-
 
−
| 37 || Bishop, Duda et al. || Measures of performance ||  ||
 
−
|-
 
−
| 38 || Bishop, Duda et al. || More complex architectures of ANNs ||  ||
 
−
|-
 
−
| 39 || Final Project Introduction ||  ||  ||
 
−
|-
 
−
| 40 || Final project||  ||  ||
 
−
|-
 
−
| 41 || Review ||  ||  ||  
 
 
|}
 
|}

Latest revision as of 09:19, 14 August 2026

Applied Linear Algebra

Prerequisite: MAT1214/MAT1213 Calculus I

This comprehensive course in linear algebra provides an in-depth exploration of core concepts and their applications to optimization, data analysis, and neural networks. Students will gain a strong foundation in the fundamental notions of linear systems of equations, vectors, and matrices, as well as advanced topics such as eigenvalues, eigenvectors, and canonical solutions to linear systems of differential equations. The course also explores he critical techniques of calculus operations in vectors and matrices, optimization, and Taylor series in one and multiple variables. By the end of the course, students will have a thorough understanding of the mathematical framework underlying principal component analysis, gradient descent, and the implementation of simple neural networks.

The primary textbook is "Mathematics for Machine Learning" by Deisenroth, Faisal, and Ong, 2020, Cambridge University Press. The book is available for free for personal use at https://mml-book.github.io/book/mml-book.pdf

The secondary textbook is "Pattern Recognition and Machine Learning" by Bishop, 2006, Springer Information Science and Statistics. The book is available for free for personal use at https://www.microsoft.com/en-us/research/uploads/prod/2006/01/Bishop-Pattern-Recognition-and-Machine-Learning-2006.pdf

Week Section Topic Prerequisites SLOs
1 2.1 Systems of Linear Equations
2 2.2 Matrices
2.3 Solving systems of linear equations
3 2.4 Vector spaces
4 2.5 Linear Independence
2.6 Basis & Rank
5 Exam 1
2.7 Linear Mappings
6 2.7 Linear Mappings (examples)
4.1 Determinant and Traces
7 4.2 Eigenvalues & Eigenvectors
4.3, 4.4 Matrix Factorization
8 3.1, 3.2, 3.3 Norms, Inner Products, Lengths & Distances
3.4 Angles & orthogonality
9 3.5 Orthonormal Basis
3.7 Inner Product of Functions
Project 1
10 5.1 Vector Calculus Intro and Taylor Series
5.1, 5.2 Differentiation Rules Review and Partial Derivatives
5.2 Gradients- Examples, visualizations, computation
11 5.3 Gradients of Vector-Valued Functions
5.4, Dhrymes 78 Gradients of Matrices
12 Exam 2
5.5, Dhrymes 78 Useful Identities for Computing Gradients
13 5.7 Higher-Order Derivatives
Notes Minimization via Newton's Method & Backpropagation
Project 2
14 5.8 Multivariate Taylor Series
Notes Linear optimization: Simplex method
7.1 Optimization Using Gradient Descent
15 7.2 and Notes Constrained Optimization and Lagrange Multipliers: PCA
Bishop, Duda et al. Feed-forward Artificial Neural Networks
Bishop, Duda et al. Backpropagation in ANNs
16 Bishop, Duda et al. Activation Functions: Linear & Nonlinear
Bishop, Duda et al. Step-by-step simple ANN
Final Project
Retrieved from "https://mathresearch.utsa.edu/wiki/index.php?title=MAT2253&oldid=5455"