Stanford AI Course Map 中文 GitHub ↗
← Back to the course map
Stanford · 2026—27 CS 225 Statistics & Optimization —

Related course · Statistics & Optimization

Machine Learning for Discrete Optimization (MS&E 236)

中文:ML × 离散优化

Learn heuristics with GNNs, RL, and LLMs to improve combinatorial optimization solvers.

Draft translation: official facts are checked; wording may change after native review.

3 units Not scheduled in 2026–27 Letter or Credit/No Credit —
ML × Discrete Optimization

Course positioning

Learn heuristics with GNNs, RL, and LLMs to improve combinatorial optimization solvers. This page keeps the official record and entry points; check the current syllabus for details.

What it covers

This is a related-course page: the official description below is the main content.

Prerequisites

See the official description (related courses do not have a separate prerequisite write-up).

Assessment & workload

Check the current syllabus.

Who it's for

Anyone interested in ML × Discrete Optimization.

Study advice

Read the official description and course site before deciding.

Related courses

Official course description

Machine learning has become a powerful tool for discrete optimization. This is because, in practice, we often have ample data about the application domain?data that can be used to optimize algorithmic performance, ranging from runtime to solution quality. This course covers how machine learning can be used within the discrete optimization pipeline from many perspectives, including how to design novel combinatorial algorithms with machine-learned modules and configure existing algorithms? parameters to optimize performance. Topics will include both applied machinery (such as graph neural networks, reinforcement learning, transformers, and LLMs) as well as theoretical tools for providing provable guarantees.