From Offline Control to Sequential Decisions
Two Faces of Optimization:
From Offline Control to Sequential Decisions
July 8–9, 2025 · ETH Zurich, Switzerland
Optimization lies at the core of modern machine learning, underpinning both the design of algorithms and the analysis of their performance. This two-day workshop explores recent advances in the theory of optimization from two complementary perspectives. The first day focuses on stochastic approaches, including sampling algorithms, the dynamics of stochastic gradient methods, and probabilistic frameworks with connections to optimal transport. The second day turns to adaptive optimization, highlighting developments in reinforcement learning, bandits, and control, with an emphasis on methodology and fundamental limits.
UpdatesSpeakers

Massachusetts Institute of Technology

University of California, Berkeley

Yale University

University of Toronto

University of Tübingen

Boston University and Broad Institute of MIT and Harvard

University of Washington

Università degli Studi di Milano and Politecnico di Milano
Attend and Present
Held at the ETH Zurich OAT, the workshop will be a small gathering accommodating a limited number of attendees. To help us plan, please submit your attendance request using the following form:
To present a recent work as a poster, you can submit an abstract or a paper. The list of accepted posters will be updated frequently on the website. Posters should be printed at A1 (landscape) or A0 (portrait) for the event.
Schedule
Date | Time | Session |
---|---|---|
08.07 | 10:00–10:20 | Coffee Reception |
10:20–10:30 | Opening remarks | |
10:30–12:00 | Talks by Andre and Matthew | |
13:30–15:00 | Talks by Ayush and Aditi | |
15:00–15:15 | Coffee Break | |
15:15–17:00 | Short Talks I | |
17:00–18:30 | Social (Lakeside Walk) | |
09.07 | 9:00 – 10:15 | Short Talks II |
10:15–10:30 | Coffee Break | |
10:30–12:00 | Talks by Kevin & Nicolò | |
14:00–15:30 | Talks by Aldo & Claire | |
15:30–17:00 | Posters | |
17:00–18:30 | Apéro |
Short Talks
- Poincaré Inequality for Uni-modal Log-Morse-Bott Measures: Non-asymptotic Analysis in Low-temperature Regime Zebang Shen, ETH Zurich
- Score Learning under the Manifold Hypothesis: Theory and Implications for Data Science Xiang Li, ETH Zurich
- Decision-Dependent Stochastic Optimization Zhiyu He, Max Planck ETH Center for Learning Systems
- Learning Diffusion at Lightspeed Nicolas Lanzetti, ETH Zurich
- Confidence Estimation via Sequential Likelihood Mixing Johannes Kirschner, The Swiss Data Science Center
- Instance-Dependent Regret Bounds for Nonstochastic Linear Partial Monitoring Khaled Eldowa, Università degli Studi di Milano and Politecnico di Milano
- Dynamic Regret Reduces to Kernelized Static Regret in Online Convex Optimization Andrew Jacobsen, Università degli Studi di Milano and Politecnico di Milano
Posters
- Exploiting Curvature in Online Convex Optimization with Delayed Feedback
- Optimism in the Face of Ambiguity Principle for Multi-Armed Bandits
- DISCOVER: Automated Curricula for Sparse-Reward Reinforcement Learning
- Efficient Preference-Based Reinforcement Learning: Randomized Exploration Meets Experimental Design
- From Gradient Clipping to Normalization for Heavy Tailed SGD
- Flow Density Control: Generative Optimization Beyond Entropy-Regularized Fine-Tuning
- Safe-EF: Error Feedback for Nonsmooth Constrained Optimization
- ROC-n-reroll: How Verifier Imperfection Affects Test-Time Scaling