| Track
|
Fall
|
Winter
|
Spring
|
Optimization and linear algebra
|
Linear Algebra & Applied Operator Theory
- ACM 104/CDS 201 (Beck, Murray, Owhadi)
- Vector spaces, including Banach and Hilbert spaces
- Linear operators, dual spaces, decompositions
|
Introduction to Optimization
- ACM 113 (Doyle, Owhadi, Tropp)
- Convex analysis
- Linear programming/duality
|
|
|
|
Introduction to Stochastic Processes and Modeling
- ACM/EE 116 (Hassibi, Owhadi, Tropp)
|
Markov Chains, Discrete Stochastic Processes and Applications
|
|
IDS 130ab
|
Information and complexity
- CS/EE/Ma 129a (Abu-Mostafa, Winfree)
- Information theory and coding
- Finite state automata, Turing machines, computability
- Data compression
- Note: EE 126 is an alternative to this course for people who have already seen automata, computability, etc
|
Information and complexity
- CS/EE/Ma 129b (Abu-Mostafa, Winfree)
- Channel coding, capacity and rate theorem
- Time complexity of algorithms; P vs NP
- Formal logic and provability
|
Decision Sytems
IDS 150
|
Modern Control Theory
- CDS 212 (Doyle, Low, Murray)
- Dynamics and stability in discrete and continuous time
- Uncertainty and robustness
- Fundamental limits: Bode, Shannon, Bode/Shannon
|
Algorithmic Game Theory
|
|
Data-driven modeling
IDS 140ab
|
Learning systems
|
Graphical models
|