RANDOMIZED LINEAR ALGEBRA AND APPLICATIONS

COMPSCI/ECE/ME 532

Linear algebraic foundations of machine learning featuring real-world applications of matrix methods from classification and clustering to denoising and data analysis. Mathematical topics include: linear equations, regression, regularization, the singular value decomposition, and iterative algorithms. Machine learning topics include: the lasso, support vector machines, kernel methods, clustering, dictionary learning, neural networks, and deep learning. Previous exposure to numerical computing (e.g. Matlab, Python, Julia, R) required.

MATH 717

Introduction to computational methods that use stochastic algorithms and/or methods that are applied to random or stochastic mathematical problems. The main emphasis will be placed on learning practical tools, while some aspects of theoretical foundations will also be covered (e.g., basic error analysis for numerical solution of stochastic differential equations (SDEs), and basic convergence of Monte Carlo methods). Topics include Monte Carlo methods, Bayesian inference and Bayesian sampling, simulation of Markov chains, numerical analysis for SDEs, data assimilation / state estimation, stochastic optimization methods and random sketching. Applications to science, engineering, finance, data science, and other practical problems also included.

STAT 772

Introduce new algorithms that leverage randomization to address the scale, speed, and sensitivity needs of modern data science. Develop the mathematical foundations of such randomized algorithms. Criticize these algorithms through the lens of computational resource utilization. Implement these algorithms to address linear problems in data science.

MATH 345

Introduction to linear algebra, differential calculus in several variables, and basic optimization theory with applications to data science and related topics. Vectors, analytic geometry, matrices, linear functions, linear independence, orthogonality, inverses, partial derivatives and gradients, Taylor approximation, gradient descent, Lagrange multipliers, clustering, regression, classification. Implementation in Python.

COMPSCI 787

Advanced paradigms for the design and analysis of efficient algorithms, including the use of randomness, linear programming, and semi-definite programming. Applications to data structures, approximating NP-hard optimization problems, learning, on-line and distributed problems. Students are strongly encouraged to have introductory knowledge of algorithms (e.g.,COMP SCI 577)