CDS Seminar: Finding Stationary Points in Stochastic Convex Optimization: Why and How

Speaker: John C. Duchi (Stanford University)

Location: 60 Fifth Avenue, Room 7th Floor Open Space

Date: Friday, September 18, 2026

Abstract: In this talk, I will discuss finding stationary points of possibly non-differentiable stochastic convex functions. Motivation for solving such problems arises in modern “distribution free” statistical learning problems. We will highlight some of the challenges of solving such problems, including that subgradients of stochastic convex functions do not converge uniformly, and also demonstrate some new geometric tools to show that solving the problem is in fact possible.

Based on the paper "Finding a stationary point of a stochastic convex problem" (arXiv:2607.06883), a joint work with Felipe Areces and MaloSommers.

Bio: John Duchi is an associate professor of Statistics and Electrical Engineering at Stanford University. His work spans statistical learning, optimization, information theory, and computation, with a few driving goals. (1) To discover statistical learning procedures that optimally trade between real-world resources — computation, communication, privacy provided to study participants — while maintaining statistical efficiency. (2) To build efficient large-scale optimization methods that address the spectrum of optimization, machine learning, and data analysis problems we face, allowing us to move beyond bespoke solutions to methods that robustly work. (3) To develop tools to assess and guarantee the validity of — and confidence we should have in — machine-learned systems.