EvoMesh: Adaptive Physical Simulation with Hierarchical Graph Evolutions

• URL: http://arxiv.org/abs/2410.03779v3
• Date: Wed, 21 May 2025 05:23:38 GMT
• Title: EvoMesh: Adaptive Physical Simulation with Hierarchical Graph Evolutions
• Authors: Huayu Deng, Xiangming Zhu, Yunbo Wang, Xiaokang Yang,
• Abstract summary: EvoMesh is a fully differentiable framework that jointly learns graph hierarchies and physical dynamics.<n>We show that EvoMesh outperforms recent fixed-hierarchy message passing networks by large margins.
• Score: 61.89682310797067
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph neural networks have been a powerful tool for mesh-based physical simulation. To efficiently model large-scale systems, existing methods mainly employ hierarchical graph structures to capture multi-scale node relations. However, these graph hierarchies are typically manually designed and fixed, limiting their ability to adapt to the evolving dynamics of complex physical systems. We propose EvoMesh, a fully differentiable framework that jointly learns graph hierarchies and physical dynamics, adaptively guided by physical inputs. EvoMesh introduces anisotropic message passing, which enables direction-specific aggregation of dynamic features between nodes within each hierarchy, while simultaneously learning node selection probabilities for the next hierarchical level based on physical context. This design creates more flexible message shortcuts and enhances the model's capacity to capture long-range dependencies. Extensive experiments on five benchmark physical simulation datasets show that EvoMesh outperforms recent fixed-hierarchy message passing networks by large margins. The project page is available at https://hbell99.github.io/evo-mesh/.

Related papers

• Instruction-Guided Autoregressive Neural Network Parameter Generation [49.800239140036496]
  We propose IGPG, an autoregressive framework that unifies parameter synthesis across diverse tasks and architectures.<n>By autoregressively generating neural network weights' tokens, IGPG ensures inter-layer coherence and enables efficient adaptation across models and datasets.<n>Experiments on multiple datasets demonstrate that IGPG consolidates diverse pretrained models into a single, flexible generative framework.
  arXiv  Detail & Related papers  (2025-04-02T05:50:19Z)
• Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification [4.129489934631072]
  Graph neural networks excel at graph representation learning but struggle with heterophilous data and long-range dependencies.<n>We propose GNNMoE, a universal model architecture for node classification.<n>We show that GNNMoE performs exceptionally well across various types of graph data, effectively alleviating the over-smoothing issue and global noise.
  arXiv  Detail & Related papers  (2024-12-11T08:35:13Z)
• LLM-Based Multi-Agent Systems are Scalable Graph Generative Models [73.28294528654885]
  GraphAgent-Generator (GAG) is a novel simulation-based framework for dynamic, text-attributed social graph generation.<n>GAG simulates the temporal node and edge generation processes for zero-shot social graph generation.<n>The resulting graphs exhibit adherence to seven key macroscopic network properties, achieving an 11% improvement in microscopic graph structure metrics.
  arXiv  Detail & Related papers  (2024-10-13T12:57:08Z)
• Online Learning Of Expanding Graphs [14.952056744888916]
  This paper addresses the problem of online network inference for expanding graphs from a stream of signals. We introduce a strategy that enables different types of updates for nodes that just joined the network and for previously existing nodes.
  arXiv  Detail & Related papers  (2024-09-13T09:20:42Z)
• Learning Flexible Body Collision Dynamics with Hierarchical Contact Mesh Transformer [19.042551780033765]
  We present Hierarchical Contact Mesh Transformer (HCMT), which uses hierarchical mesh structures and can learn long-range dependencies. HCMT enables long-range interactions, and the hierarchical mesh structure quickly propagates collision effects to faraway positions. Our results show that HCMT provides significant performance improvements over existing methods.
  arXiv  Detail & Related papers  (2023-12-19T05:30:08Z)
• Dynamic Dense Graph Convolutional Network for Skeleton-based Human Motion Prediction [14.825185477750479]
  This paper presents a Dynamic Dense Graph Convolutional Network (DD-GCN) which constructs a dense graph and implements an integrated dynamic message passing. Based on the dense graph, we propose a dynamic message passing framework that learns dynamically from data to generate distinctive messages. Experiments on benchmark Human 3.6M and CMU Mocap datasets verify the effectiveness of our DD-GCN.
  arXiv  Detail & Related papers  (2023-11-29T07:25:49Z)
• Accelerating Dynamic Network Embedding with Billions of Parameter Updates to Milliseconds [27.98359191399847]
  We propose a novel dynamic network embedding paradigm that rotates and scales the axes of embedding space instead of a node-by-node update. Specifically, we propose the Dynamic Adjacency Matrix Factorization (DAMF) algorithm, which achieves an efficient and accurate dynamic network embedding. Experiments of node classification, link prediction, and graph reconstruction on different-sized dynamic graphs suggest that DAMF advances dynamic network embedding.
  arXiv  Detail & Related papers  (2023-06-15T09:02:17Z)
• WLD-Reg: A Data-dependent Within-layer Diversity Regularizer [98.78384185493624]
  Neural networks are composed of multiple layers arranged in a hierarchical structure jointly trained with a gradient-based optimization. We propose to complement this traditional 'between-layer' feedback with additional 'within-layer' feedback to encourage the diversity of the activations within the same layer. We present an extensive empirical study confirming that the proposed approach enhances the performance of several state-of-the-art neural network models in multiple tasks.
  arXiv  Detail & Related papers  (2023-01-03T20:57:22Z)
• Piecewise-Velocity Model for Learning Continuous-time Dynamic Node Representations [0.0]
  Piecewise-Veable Model (PiVeM) for representation of continuous-time dynamic networks. We show that PiVeM can successfully represent network structure and dynamics in ultra-low two-dimensional spaces. It outperforms relevant state-of-art methods in downstream tasks such as link prediction.
  arXiv  Detail & Related papers  (2022-12-23T13:57:56Z)
• Dynamic Graph Message Passing Networks for Visual Recognition [112.49513303433606]
  Modelling long-range dependencies is critical for scene understanding tasks in computer vision. A fully-connected graph is beneficial for such modelling, but its computational overhead is prohibitive. We propose a dynamic graph message passing network, that significantly reduces the computational complexity.
  arXiv  Detail & Related papers  (2022-09-20T14:41:37Z)
• Equivariant Graph Hierarchy-Based Neural Networks [53.60804845045526]
  We propose Equivariant Hierarchy-based Graph Networks (EGHNs) EGHNs consist of the three key components: generalized Equivariant Matrix Message Passing (EMMP), E-Pool and E-UpPool. Considerable experimental evaluations verify the effectiveness of our EGHN on several applications including multi-object dynamics simulation, motion capture, and protein dynamics modeling.
  arXiv  Detail & Related papers  (2022-02-22T03:11:47Z)
• ACE-HGNN: Adaptive Curvature Exploration Hyperbolic Graph Neural Network [72.16255675586089]
  We propose an Adaptive Curvature Exploration Hyperbolic Graph NeuralNetwork named ACE-HGNN to adaptively learn the optimal curvature according to the input graph and downstream tasks. Experiments on multiple real-world graph datasets demonstrate a significant and consistent performance improvement in model quality with competitive performance and good generalization ability.
  arXiv  Detail & Related papers  (2021-10-15T07:18:57Z)
• Improving Graph Neural Networks with Simple Architecture Design [7.057970273958933]
  We introduce several key design strategies for graph neural networks. We present a simple and shallow model, Feature Selection Graph Neural Network (FSGNN) We show that the proposed model outperforms other state of the art GNN models and achieves up to 64% improvements in accuracy on node classification tasks.
  arXiv  Detail & Related papers  (2021-05-17T06:46:01Z)
• Hierarchical Graph Neural Networks [0.0]
  This paper aims to connect the dots between the traditional Neural Network and the Graph Neural Network architectures. A Hierarchical Graph Neural Network architecture is proposed, supplementing the original input network layer with the hierarchy of auxiliary network layers. It enables simultaneous learning of the individual node features along with the aggregated network features at variable resolution and uses them to improve the convergence and stability of the individual node feature learning.
  arXiv  Detail & Related papers  (2021-05-07T16:47:18Z)
• Dynamic Graph: Learning Instance-aware Connectivity for Neural Networks [78.65792427542672]
  Dynamic Graph Network (DG-Net) is a complete directed acyclic graph, where the nodes represent convolutional blocks and the edges represent connection paths. Instead of using the same path of the network, DG-Net aggregates features dynamically in each node, which allows the network to have more representation ability.
  arXiv  Detail & Related papers  (2020-10-02T16:50:26Z)
• Dynamic Hierarchical Mimicking Towards Consistent Optimization Objectives [73.15276998621582]
  We propose a generic feature learning mechanism to advance CNN training with enhanced generalization ability. Partially inspired by DSN, we fork delicately designed side branches from the intermediate layers of a given neural network. Experiments on both category and instance recognition tasks demonstrate the substantial improvements of our proposed method.
  arXiv  Detail & Related papers  (2020-03-24T09:56:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.