Project Grant 2529107

Award Date 4/1/25
Completion Date 6/30/27
Dollars Obligated $80K
Federal Grant Program
47.049
Assistance Type
Project Grant
Place of Performance
Los Angeles, CA 90024, USA
Similar Awards
The National Science Foundation (NSF) awarded a $240,330 Project Grant under its Mathematical and Physical Sciences (CFDA 47.049) program to The Regents of the University of California, doing business as University of California, Berkeley. The grant supports a 2.5-year project to advance state-of-the-art techniques for solving nonconvex optimization problems and games through both theoretical and computational approaches. The core innovation is the concept of "approachable...
The National Science Foundation awarded a $250,000 Project Grant to the Texas A&M Engineering Experiment Station to support research titled "Collaborative Research: Consensus and Distributed Optimization in Non-Convex Environments with Applications to Networked Machine Learning." The award is part of the NSF Engineering program (CFDA 47.041), which aims to foster innovation and excellence in engineering research. Under the three-year award concluding in July 2026, the Texas A&M...
This three-year Project Grant from the National Science Foundation's Division of Computing and Communication Foundations under the Computer and Information Science and Engineering program will support the development of new optimization approaches for machine learning problems. The $600,000 award to the University of Wisconsin-Madison beginning October 1, 2022 will advance optimization algorithms and analysis techniques for convex-concave minimax problems incorporating sparsity or regularity....
This National Science Foundation project grant of $250,000 will fund research at Rensselaer Polytechnic Institute from July 2022 to June 2025 under the Mathematical and Physical Sciences program (CFDA 47.049). The grant supports the development of accelerated distributed stochastic optimization methods and applications in machine learning. Specifically, the grantee will design fast-convergent and communication-efficient optimization algorithms with theoretical guarantees for solving...
This $160,497 project grant awarded by the National Science Foundation (NSF) under the Computer and Information Science and Engineering (CFDA 47.070) program will fund research by the University of Michigan to analyze the computational landscape of nonconvex machine learning models and develop reliable, efficient algorithms for training these models. The project aims to demonstrate that the local solutions of many practical nonconvex models can be more tractable and generalize better than...
This three-year $300,000 Project Grant from the National Science Foundation's Division of Electrical, Communications and Cyber Systems, under the Engineering (47.041) federal grant program, funds research at New York University to advance the mathematical foundations and develop new tools for real-time distributed optimization-based control of large-scale nonlinear uncertain systems. Specifically, the award supports three research tasks: 1) synthesizing distributed optimization algorithms robust...
This $108,176 Project Grant awarded by the National Science Foundation's (NSF) Mathematical and Physical Sciences (CFDA 47.049) program supports research at the California Institute of Technology (Caltech) on interacting particle systems and their application to optimization, sampling, and filtering algorithms. The 5-year award, effective June 1, 2024, aims to develop a unified mathematical framework for these algorithms by reformulating them from the perspective of interacting particle systems....
This National Science Foundation (NSF) Project Grant award under the Mathematical and Physical Sciences program (CFDA 47.049) will fund research at Carnegie Mellon University (CMU) on mean-field and singular limits of deterministic and stochastic interacting particle systems. The $187,382 award, with a performance period from July 1, 2023 to May 31, 2025, aims to achieve a substantial reduction in computational complexity for modeling the behavior of large numbers of interacting particles,...
This $318,590 Project Grant awarded by the National Science Foundation (NSF) Engineering Program (CFDA 47.041) supports research and development at the Georgia Tech Research Corporation aimed at advancing computational models and algorithms for distributed constrained optimization in complex multi-agent networks. The key objectives are to: (i) develop an enhanced mathematical modeling framework utilizing variational inequality theory; (ii) design and analyze new iteratively regularized...
This Project Grant from the National Science Foundation's Mathematical and Physical Sciences program provides $171,089 to Old Dominion University Research Foundation for collaborative research developing computationally efficient methods for non-smooth and non-convex optimization by exploring sparsity structures in large data sets. The research aims to address critical issues in non-smooth, non-convex optimization arising from sparse modeling of data used in machine learning and sparse...

INTERACTING PARTICLE SYSTEM FOR NONCONVEX OPTIMIZATION -COLLECTIVE INTELLIGENCE OFFERS PROFOUND INSIGHTS INTO HOW GROUPS, WHETHER THEY BE CELLS, ANIMALS, OR EVEN MACHINES, CAN WORK TOGETHER TO ACCOMPLISH TASKS MORE EFFECTIVELY THAN INDIVIDUALS ALONE. ORIGINATING IN BIOLOGY AND NOW INFLUENCING FIELDS AS VARIED AS MANAGEMENT SCIENCE, ARTIFICIAL INTELLIGENCE, AND ROBOTICS, THIS CONCEPT UNDERSCORES THE POTENTIAL OF COLLABORATIVE EFFORTS IN SOLVING COMPLEX CHALLENGES. ON THE OTHER HAND, THE QUEST FOR FINDING GLOBAL MINIMIZERS OF NONCONVEX OPTIMIZATION PROBLEMS ARISES IN PHYSICS AND CHEMISTRY, AS WELL AS IN MACHINE LEARNING DUE TO THE WIDESPREAD ADOPTION OF DEEP LEARNING. BUILDING THE BRIDGE BETWEEN THESE TWO SEEMINGLY DISPARATE REALMS, THIS PROJECT WILL UTILIZE COLLECTIVE INTELLIGENCE TO LEVERAGE THE INTERACTING PARTICLE SYSTEMS AS A MEANS TO ADDRESS THE FORMIDABLE CHALLENGE OF FINDING GLOBAL MINIMIZERS IN NONCONVEX OPTIMIZATION PROBLEMS. GRADUATE STUDENTS WILL ALSO BE INTEGRATED WITHIN THE RESEARCH TEAM AS PART OF THEIR PROFESSIONAL TRAINING. THIS PROJECT WILL FOCUS ON A GRADIENT-FREE OPTIMIZATION METHOD INSPIRED BY A CONSENSUS-BASED INTERACTING PARTICLE SYSTEM TO SOLVE DIFFERENT TYPES OF NONCONVEX OPTIMIZATION PROBLEMS. EFFECTIVE COMMUNICATION AND COOPERATION AMONG PARTICLES WITHIN THE SYSTEM PLAY PIVOTAL ROLES IN EFFICIENTLY EXPLORING THE LANDSCAPE AND CONVERGING TO THE GLOBAL MINIMIZER. AIM 1 TARGETS NONCONVEX OPTIMIZATION WITH EQUALITY CONSTRAINTS; AND AIM 2 ADDRESSES NONCONVEX OPTIMIZATION ON CONVEX SETS; WHILE AIM 3 APPLIES TO CLUSTERED FEDERATED LEARNING. ADDITIONALLY, CONVERGENCE GUARANTEES WILL BE PROVIDED FOR NONCONVEX AND NONSMOOTH OBJECTIVE FUNCTIONS. THEORETICAL ANALYSES, ALONGSIDE PRACTICAL IMPLEMENTATIONS, WILL PROVIDE VALUABLE INSIGHTS AND TOOLS FOR ADDRESSING DIFFERENT TYPES OF NONCONVEX OPTIMIZATION CHALLENGES. 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.- SUBAWARDS ARE NOT PLANNED FOR THIS AWARD.

Posted 4/3/25, 12:00 AM