CAREER: Large-Scale Multi-Objective Learning: Novel Algorithms and Fundamental Theory

About This Grant

Many real-world AI and big data applications, including 5G networks, autonomous systems, healthcare, finance, recommendation engines, and large foundation models, frequently involve multiple, often competing objectives arising from complex environments, conflicting goals, and vast datasets encompassing different domains and modalities. Multi-objective optimization (MOO) provides a robust theoretical framework for navigating these challenges by identifying sets of solutions that represent the best trade-offs among objectives. Despite notable efforts toward conflict-avoidant MOO approaches, algorithmic and theoretical progress in large-scale, data-driven settings remains limited. This project aims to significantly advance the theoretical and algorithmic foundations of MOO, offering provably convergent and efficient stochastic, bilevel, and fairness-aware MOO algorithms. Its outcomes hold the promise of propelling MOO research to new heights, with broad impacts on both theory and practice across wireless communication networks, multi-agent transportation and robotics systems, recommendation systems, and foundation models. The research outcomes are integrated into education and outreach activities for K-12 educators, graduate, and undergraduate students through (i) summer camp for K-12 students, (ii) student supervision, (iii) Experiential Learning and Research (ELR) undergraduate activity, (iv) CSE Colloquium and Upbeat events, and (v) course development. The research efforts are organized around three complimentary thrusts: (i) Thrust A focuses on developing new theoretical and algorithmic foundations for stochastic MOO; (ii) Thrust B focuses on proposing efficient and scalable multi-objective bilevel optimization (MOBO) algorithms, and further characterizes their convergence rates, iteration and sample complexities, and (iii) Thrust C aims to substantially advance MOO frameworks by incorporating innovative concepts of fairness that differ from existing approaches. This project aims to establish a fundamental understanding of stochastic MOO, MOBO, and fairness-aware MOO, covering aspects such as optimality, convergence guarantees, iteration requirements, and oracle complexities. The proposed methods are validated in real-world applications, including (i) fair resource allocation in communication networks, (ii) visual action prediction for multi-agent systems, and (iii) multi-task learning to rank in recommendation systems. By significantly advancing the field of MOO, this work is expected to attract interest from multiple communities, including machine learning, statistics, information science, networking, communication, robotics, and bioinformatics. Moreover, the project fosters new interdisciplinary research directions that bridge these areas. This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.