My research develops the mathematical foundations and algorithms for reliable, efficient, and scalable learning. Spanning optimization, machine learning, and reinforcement learning, I connect rigorous theory with algorithm design to advance learning and decision-making in complex environments.
My work has appeared in NeurIPS, ICML, AISTATS, JMLR, and SIAM journals in optimization and control. My research has been supported by an SNSF Postdoc.Mobility Fellowship and an ETH AI Center Doctoral Fellowship.
Prospective Students
Interested in joining my group? I welcome prospective Ph.D. students interested in optimization, machine learning, and reinforcement learning to complete the prospective student interest form. See the research overview below to learn more.
Research Overview
My work centers on three interconnected pillars that address fundamental challenges in modern machine learning:
Non-convex Optimization: I develop mathematical foundations and algorithms for solving non-convex problems in learning and decision-making. My research seeks to identify exploitable structure and translate it into convergence guarantees and effective methods for increasingly complex models.
Data Efficiency and Robustness: I develop learning algorithms that make effective use of limited data and remain reliable under uncertainty. A central goal is to advance optimization and reinforcement learning methods that combine strong statistical guarantees with stable performance in practice.
Scalable Learning Systems: I design optimization methods that address the computational and communication demands of large-scale learning. My research aims to connect algorithmic efficiency with reliable performance across distributed and resource-constrained environments.
September 2026 – Completed my Ph.D. in Computer Science at ETH Zurich. My dissertation is titled Structure, Geometry, and Noise in Stochastic First-Order Optimization.
August 2026 – We are organizing the Swiss Optimization Symposium, taking place at Monte Verità in Ascona, Switzerland (August 23–27, 2026).
June 2026 – Awarded a Swiss National Science Foundation (SNSF) Postdoc.Mobility Fellowship for the project Structure Exploiting Optimization for Data-Efficient Reinforcement Learning and Games at Stanford University.
Show earlier news
June 2026 – Attended the SIAM Conference on Optimization (OP26) in Edinburgh, United Kingdom (June 2–5), as a minisymposium organizer and invited speaker.
May 2026 – Attended the ELLIIT symposium and focus period on Optimization for Learning in Lund, Sweden as an invited visiting scholar.
March 2026 – Attended INFORMS IOS in Atlanta, U.S.A., as a session organizer and speaker.
February 2026 – Finished a five-month internship at Amazon as an Applied Scientist Intern.
December 2025 – Presented “Global Solutions to Non-Convex Functional Constrained Problems with Hidden Convexity” at the NeurIPS Workshop on Constrained Optimization for Machine Learning. Oral Presentation Award for the best fundamental (theoretical or algorithmic) contribution.
October 2025 – Started an Applied Scientist internship with Amazon’s Forecasting & Optimization team in Luxembourg, focusing on large-scale capacity management problems across the delivery network.
August 2025 – Delivered “Can SGD Handle Heavy-Tailed Noise?” at the H. Milton Stewart School of Industrial and Systems Engineering (Georgia Tech) student seminar in Atlanta.
July 2025 – Attended the International Conference on Continuous Optimization ICCOPT 2025 at the University of Southern California in Los Angeles, USA, and presented “Taming Nonconvex Stochastic Mirror Descent with General Bregman Divergence.”
July 2025 – Attended the International Conference on Stochastic Programming (ICSP) 2025 in Paris, France, and presented “Safe-EF: Error Feedback for Nonsmooth Constrained Optimization (with Applications to Humanoid Fleet Training).”
March 2025 – Research visit at Georgia Tech’s H. Milton Stewart School of ISyE with Prof. Guanghui (George) Lan.