01
Introduction to Inverse Problems
Forward and inverse problems and the notion of well-posedness, motivated by linear regression, denoising, deblurring, computed tomography, inverse heat conduction, inverse scattering, tumor modeling, and image registration.
02
Spectral Operator Theory in Inverse Problems
The singular value decomposition of matrices and compact operators, the Picard condition, and how spectral decay causes ill-posedness; spectral regularization such as truncated SVD, Tikhonov regularization, and Landweber iteration, and how to choose the regularization parameter.
03
Convex Optimization
Convex sets and functions, projections, Fenchel conjugates, Lagrangian duality, and the KKT optimality conditions.
04
Convex Non-Smooth Optimization
Subgradient methods, proximal operators and the Moreau envelope, proximal gradient methods, and ADMM, with sparsity-promoting problems such as the LASSO as a running example.
05
Optimization in Machine Learning
Iterative shrinkage-thresholding (ISTA and FISTA) and its learned, unrolled counterpart LISTA, along with adaptive gradient methods such as AdaGrad, RMSProp, and Adam.
06
Inverse Problems Governed by Dynamical Systems
Inverse problems constrained by partial differential equations, from the inverse heat equation to large-scale applications: discretization, adjoint-based sensitivities, reduced-space Newton–Krylov methods, preconditioning, and scalability on CPUs and GPUs.
07
Numerical Methods for Machine Learning
Numerical building blocks behind learning algorithms, including finite-difference discretizations, derivative checks, and line-search methods.
08
Bayesian Inverse Problems
Likelihood and prior modeling, the posterior in finite dimensions and in function space, connections to Tikhonov regularization, MAP estimation and the Laplace approximation, sampling with Metropolis–Hastings and preconditioned Crank–Nicolson, variational inference, hierarchical models, and optimal experimental design.