| Track
|
Fall
|
Winter
|
Spring
|
Optimization and linear algebra
IDS 110
|
- Note: ACM 104/CDS 201 is a possibility for students who need more linear algebra and applied analysis
- Perhaps rename this row "Linear algebra and optimization"
- Similar course at MIT
|
ACM 113/CDS 203 (Doyle, Owhadi, Tropp)
- Convex analysis
- Linear programming/duality
- Note: create CDS 203 as alternative to CDS 202?
|
IDS 150 (Doyle, Low, Murray)
- Discrete systems
- Graphs and optimization (shortest distance, max cut, etc)
- Temporal logic, automata, SAT
- Algorithm complexity (build on CS/EE/Ma 129)
- Dynamics and stability
- Nonlinear discrete time systems, hybrid systems
- Stability and stability certificates (Lyapunov, SOS)
- Feedback systems, small gain theorems
- Uncertainty and robustness
- Representation of uncertainty
- Operator bounds; links to small gain
- Robust performance: discrete time, NL?
- Need to say all of this in a non-control specific way
- Fundamental limits: Bode, Shannon, Bode/Shannon
- Case studies
- Internet: layering as optimization
- One more (not the cell)
|
|
IDS 120
|
ACM/EE 116 (Hassibi, Owhadi, Tropp)
Introduction to Stochastic Processes and Modeling
|
ACM 216 (Owhadi, Tropp)
Markov Chains, Discrete Stochastic Processes and Applications
|
|
IDS 130
|
Information and complexity
- 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
- Channel coding, capacity and rate theorem
- Time complexity of algorithms; P vs NP
- Formal logic and provability
|
Data-driven modeling
IDS 140
|
|
CS 155 (Krause)
- Graphical models
- Will eventually move to second term
|
