Autumn
Winter
Spring
Summer

181 - 190 of 236 results for: MS

MS&E 322: Stochastic Calculus and Control

Ito integral, existence and uniqueness of solutions of stochastic differential equations (SDEs), diffusion approximations, numerical solutions of SDEs, controlled diffusions and the Hamilton-Jacobi-Bellman equation, and statistical inference of SDEs. Applications to finance and queueing theory. Prerequisites: 221 or STATS 217: MATH 113, 115.
Terms: Aut | Units: 3
Instructors: Blanchet, J. (PI)

MS&E 323: Stochastic Simulation

Emphasis is on the theoretical foundations of simulation methodology. Generation of uniform and non-uniform random variables. Discrete-event simulation and generalized semi-Markov processes. Output analysis (autoregressive, regenerative, spectral, and stationary times series methods). Variance reduction techniques (antithetic variables, common random numbers, control variables, discrete-time, conversion, importance sampling). Stochastic optimization (likelihood ratio method, perturbation analysis, stochastic approximation). Simulation in a parallel environment. Prerequisite: MS&E 221 or equivalent.
Last offered: Winter 2024 | Units: 3

MS&E 324: Stochastic Methods in Engineering (CME 308, MATH 228)

The basic limit theorems of probability theory and their application to maximum likelihood estimation. Basic Monte Carlo methods and importance sampling. Markov chains and processes, random walks, basic ergodic theory and its application to parameter estimation. Discrete time stochastic control and Bayesian filtering. Diffusion approximations, Brownian motion and an introduction to stochastic differential equations. Examples and problems from various applied areas. Prerequisites: exposure to probability and background in analysis.
Terms: Spr | Units: 3
Instructors: Glynn, P. (PI)

MS&E 325: Optimal Transport in Operations Research, Statistics, and Economics

Current stochastic models, motivated by a wide range of applications in engineering, business, and science, as well as the design and analysis of associated computational methods for performance analysis and control of such stochastic systems.
Terms: Win | Units: 3
Instructors: Blanchet, J. (PI)

MS&E 326: Advanced Topics in Applied Data Science

Advanced Topics in Applied Data Science
Terms: Spr | Units: 3 | Repeatable for credit (up to 99 units total)
Instructors: Johari, R. (PI)

MS&E 328: Foundations of Causal Machine Learning

Theoretical foundations of modern techniques at the intersection of causal inference and machine learning. Topics may include: semi-parametric inference and semi-parametric efficiency, modern statistical learning theory, Neyman orthogonality and double/debiased machine learning, theoretical foundations of high-dimensional linear regression, theoretical foundations of non-linear regression models, such as random forests and neural networks, adaptive non-parametric estimation of conditional moment models, estimation and inference on heterogeneous treatment effects, causal inference and reinforcement learning, off-policy evaluation, adaptive experimentation and inference.
Terms: Win | Units: 3

MS&E 330: Reliability and Validity in Artificial Intelligence (STATS 357)

This course examines the principles and methods required to make artificial intelligence (AI) systems reliable and scientifically sound. Topics include evaluation and benchmarking, notions of validity, distribution shift, causality, predictive inference, AI-assisted statistical inference, data attribution, and beyond. Problem sets will involve both mathematical components and coding projects to see the practical effects of the methods we develop.
Terms: Spr | Units: 3
Instructors: Zrnic, T. (PI)

MS&E 331: AI for Algorithmic Reasoning and Optimization (CS 331X)

Artificial intelligence is expanding the frontier of algorithm design, enabling new ways to reason about and solve complex optimization problems. This course explores how AI methods - ranging from graph neural networks and diffusion models to large language models - can be integrated into the algorithm design pipeline. We will study how to use machine learning to design new algorithms, enhance classical algorithms with data-driven components, and optimize algorithm performance in specific application domains. Topics will span both practical approaches, such as differentiable optimization and generative AI for combinatorial problems, to theoretical perspectives, including approximation guarantees and the limits of learned algorithms.
Terms: Aut | Units: 3
Instructors: Vitercik, E. (PI)

MS&E 332: Security and Risk in Computer Networks

Risk management of large scale computing and networking systems with respect to security, data integrity, performance collapse, and service disruption. Qualitative and analytical basis for assessment, modeling, control, and mitigation of network risks. Stochastic risk models. Contact process. Random fields on networks. Virus and worm propagation dynamics and containment. Denial of service attacks. Intruder detection technologies. Distributed network attacks and countermeasures. Disaster recovery networks. Network protection services and resource placement. Autonomic self-defending networks. Economics of risk management. Emphasis is on analytics and quantitative methods.
Last offered: Winter 2021 | Units: 3

MS&E 333: AI Application Lab

This project-based experiential course is designed for students with a strong background in machine learning methods who are interested in studying and experimenting with building platforms in specific application domains. Students form interdisciplinary teams to develop innovative solutions leveraging generative AI technologies to address societal challenges across education, healthcare, knowledge access, and resource allocation. Applications of interest include improving educational accessibility, enhancing healthcare delivery, bridging knowledge gaps across communities, and optimizing resource distribution through AI-powered systems.Prerequisites: Instructor's permission is required to take the course.
Terms: Aut, Spr | Units: 3
© Stanford University | Terms of Use | Copyright Complaints