PROGRAM

July 27-29, 2026


July 27 (Monday)

Time Activity
09:00-09:30Registration and Morning Refreshments
09:30-10:00Welcome and Opening Ceremony
TimeSpeaker / TitleChair
10:00-10:30 Robust and Flexible Reward Modeling in Reinforcement Learning Shuzhong Zhang
Masashi Sugiyama
10:30-11:00 Orthogonalized Moment Aberration for Hyperparameter Optimization under Heterogeneity
Ming-Chung Chang
11:00-11:30 Data-Driven Analysis of First-Order Methods via Distributionally Robust Optimization
Bartolomeo Stellato
11:30-12:00 Extended-Variable Relaxations for the Constrained Generalized Maximum-Entropy Sampling Problem
Jon Lee
12:00-13:30Lunch Break
13:30-14:00 New Results on the Majorization Schemes for Nonconvex Constrained Optimization Bartolomeo Stellato
Shuzhong Zhang
14:00-14:30 Learning-Enhanced Approximations of Mixed Integer Nonlinear Optimization Problems
Claudia D'Ambrosio
14:30-15:00 Evolution of Network Intelligence: From Classical Optimization to AI Agents
Chih-Wei Huang
15:00-15:30Coffee and Tea Break
15:30-16:00 Stochastic Block-Iterative Splitting of Systems of Monotone Inclusions Claudia d’Ambrosio
Patrick L. Combettes
16:00-16:30 A Conditional-Gradient-Based Single-Loop Augmented Lagrangian Method for Inequality Constrained Problems
Ting Kei Pong
16:30-17:00 Point Sketches versus Coresets in k-Means
Leo Liberti
17:00-17:30 Non-Stationary Douglas-Rachford Revisited
Matthew K. Tam