Robust Optimization
Robust optimization aims to find solutions that remain optimal even when faced with uncertainty in data or model parameters, a crucial consideration in many real-world applications. Current research focuses on developing efficient algorithms, such as stochastic primal-dual methods and those leveraging techniques from sleeping bandits, to solve increasingly complex robust optimization problems, particularly those involving non-convex loss functions and high-dimensional data. These advancements are improving the robustness and reliability of machine learning models across diverse fields, including network traffic classification, robotics, and financial modeling, by mitigating the impact of data imbalances, adversarial attacks, and model uncertainty. The development of tractable formulations and efficient algorithms is a key driver of progress in this active area of research.
Papers
Gradual Domain Adaptation via Manifold-Constrained Distributionally Robust Optimization
Amir Hossein Saberi, Amir Najafi, Ala Emrani, Amin Behjati, Yasaman Zolfimoselo, Mahdi Shadrooy, Abolfazl Motahari, Babak H. Khalaj
From Distributional Robustness to Robust Statistics: A Confidence Sets Perspective
Gabriel Chan, Bart Van Parys, Amine Bennouna