Project Grant 2411264

NSF-BSF: SCALABLE GRAPH NEURAL NETWORK ALGORITHMS AND APPLICATIONS TO PDES -THIS PROJECT WILL ADVANCE THE FIELDS OF GEOMETRIC MACHINE LEARNING AND NUMERICAL PARTIAL DIFFERENTIAL EQUATIONS AND STRENGTHEN THE CONNECTIONS BETWEEN THEM. GEOMETRIC MACHINE LEARNING PROVIDES AN EFFECTIVE APPROACH FOR ANALYZING UNSTRUCTURED DATA AND HAS BECOME INDISPENSABLE FOR COMPUTER GRAPHICS AND VISION, BIOINFORMATICS, SOCIAL NETWORK ANALYSIS, PROTEIN FOLDING, AND MANY OTHER AREAS. PARTIAL DIFFERENTIAL EQUATIONS (PDES) ARE UBIQUITOUS IN MATHEMATICAL MODELING, AND THEIR NUMERICAL SOLUTION ENABLES THE SIMULATION OF REAL-WORLD PHENOMENA IN ENGINEERING DESIGN, MEDICAL ANALYSIS, AND MATERIAL SCIENCES, TO NAME A FEW. A UNIFIED STUDY OF BOTH FIELDS EXPOSES MANY POTENTIAL SYNERGIES, WHICH THE PROJECT WILL SEIZE TO IMPROVE THE EFFICIENCY OF ALGORITHMS IN BOTH AREAS. THE FIRST GOAL IS TO IMPROVE THE SCALABILITY OF GEOMETRIC MACHINE LEARNING APPROACHES BASED ON GRAPH NEURAL NETWORKS (GNNS) TO ACCOMMODATE GROWING DATASETS WITH MILLIONS OF NODES USING INSIGHTS AND IDEAS FROM NUMERICAL PDES. THE SECOND GOAL IS TO ACCELERATE NUMERICAL PDE SIMULATIONS BY ENHANCING NUMERICAL SOLVERS ON UNSTRUCTURED MESHES WITH GNN COMPONENTS. THROUGH THESE IMPROVEMENTS IN COMPUTATIONAL EFFICIENCY, THE PROJECT WILL ENABLE MORE ACCURATE DATA ANALYSIS AND PDE SIMULATIONS FOR HIGH-IMPACT APPLICATIONS ACROSS THE SCIENCES, ENGINEERING, AND INDUSTRY. GRADUATE STUDENTS AND POSTDOCTORAL RESEARCHERS WILL BE INTEGRATED INTO THIS RESEARCH AS PART OF THEIR PROFESSIONAL TRAINING. THIS PROJECT WILL DEVELOP COMPUTATIONAL ALGORITHMS THAT IMPROVE THE EFFICIENCY AND SCALABILITY OF GNNS AND CREATE NEW APPROACHES FOR GNNS FOR SOLVING NONLINEAR PDES ON UNSTRUCTURED MESHES. TO IMPROVE THE SCALABILITY OF GNNS TO GRAPHS WITH MILLIONS OF NODES, THE RESEARCH TEAM WILL DEVELOP SPATIAL SMOOTHING OPERATORS, COARSENING OPERATORS, AND MULTILEVEL TRAINING SCHEMES. TO ACCELERATE PDE SIMULATIONS ON UNSTRUCTURED MESHES, THE TEAM WILL TRAIN GNNS TO PRODUCE EFFECTIVE PROLONGATION, RESTRICTION, AND COARSE MESH OPERATORS IN MULTIGRID METHODS AND PRECONDITIONERS IN KRYLOV METHODS. THE TEAM WILL DEMONSTRATE THAT THE RESULTING HYBRID SCHEMES ACCELERATE COMPUTATIONS AND ARE PROVABLY CONVERGENT. TO SHOW THE BROAD APPLICABILITY OF THE SCHEMES, THE TEAM WILL CONSIDER CHALLENGING PDE PROBLEMS IN COMPUTATIONAL FLUID DYNAMICS AND TEST THE SCALABLE GNNS ON ESTABLISHED GEOMETRIC LEARNING BENCHMARK TASKS SUCH AS SHAPE AND NODE CLASSIFICATION. THE MATHEMATICAL BACKBONE OF THESE DEVELOPMENTS IS ALGEBRAIC MULTIGRID TECHNIQUES, WHICH MOTIVATE GNN DESIGN AND TRAINING AND ARE USED IN THE PDE SOLVERS. 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.