Stanford Root

Schedule

Stanford Root

Schedule

MS&E 318

Safe and Constrained AI

UNITS:3
GRADING:Letter or Credit/No Credit
LEVEL:Graduate
GER:—

How can we design AI systems that are not only powerful but also provably safe and trustworthy? This advanced PhD seminar surveys algorithmic methods to enforce hard constraints in machine learning, reinforcement learning, and generative AI. Topics include classical constrained optimization (Lagrangian methods, robust and stochastic programming), safe reinforcement learning (trust regions, Lyapunov functions, reachability, shielding), hybrid ML-optimization methods (projection networks, solver-in-the-loop architectures), and alignment strategies for large language models (fine-tuning, model editing, tool use, and interactive alignment). Each week highlights a key theoretical result alongside state-of-the-art research, with applications spanning robotics, finance, healthcare, energy, and language models. Students will critically assess the strengths and limitations of these methods and develop final projects that apply or extend them in real-world domains. Prerequisites: optimization at the level of CME 307 or EE 364a.

Syllabus not available for this section

Sections

0 Terms
No sections available.

MS&E 318: Safe and Constrained AI

3 units · Letter or Credit/No Credit

How can we design AI systems that are not only powerful but also provably safe and trustworthy? This advanced PhD seminar surveys algorithmic methods to enforce hard constraints in machine learning, reinforcement learning, and generative AI. Topics include classical constrained optimization (Lagrangian methods, robust and stochastic programming), safe reinforcement learning (trust regions, Lyapunov functions, reachability, shielding), hybrid ML-optimization methods (projection networks, solver-in-the-loop architectures), and alignment strategies for large language models (fine-tuning, model editing, tool use, and interactive alignment). Each week highlights a key theoretical result alongside state-of-the-art research, with applications spanning robotics, finance, healthcare, energy, and language models. Students will critically assess the strengths and limitations of these methods and develop final projects that apply or extend them in real-world domains. Prerequisites: optimization at the level of CME 307 or EE 364a.

More MS&E courses

  • MS&E 297: "Hacking for Defense": Solving National Security issues with the Lean Launchpad (INTLPOL 341)
  • MS&E 299: Entrepreneurship Inside Government (INTLPOL 239)
  • MS&E 301: Dissertation Research
  • MS&E 302: Fundamental Concepts in Management Science and Engineering
  • MS&E 311: Optimization (CME 307)
  • MS&E 315: Combinatorial Optimization (CME 310, CS 261)
  • MS&E 319: Matching Theory
  • MS&E 321: Stochastic Systems
  • MS&E 322: Stochastic Calculus and Control
  • MS&E 324: Stochastic Methods in Engineering (CME 308, MATH 228)
  • MS&E 325: Diffusion, Control and Optimal Transport
  • MS&E 326: Advanced Topics in Applied Data Science

All MS&E courses · All departments