Pith. sign in

REVIEW 1 cited by

Boundary Graph Neural Networks for 3D Simulations

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2106.11299 v7 pith:JCXBPKWW submitted 2021-06-21 cs.LG cs.AIstat.ML

classification cs.LGcs.AIstat.ML
keywords bgnnsboundarygeometricgraphboundariesconditionsdifficultengineering
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The abundance of data has given machine learning considerable momentum in natural sciences and engineering, though modeling of physical processes is often difficult. A particularly tough problem is the efficient representation of geometric boundaries. Triangularized geometric boundaries are well understood and ubiquitous in engineering applications. However, it is notoriously difficult to integrate them into machine learning approaches due to their heterogeneity with respect to size and orientation. In this work, we introduce an effective theory to model particle-boundary interactions, which leads to our new Boundary Graph Neural Networks (BGNNs) that dynamically modify graph structures to obey boundary conditions. The new BGNNs are tested on complex 3D granular flow processes of hoppers, rotating drums and mixers, which are all standard components of modern industrial machinery but still have complicated geometry. BGNNs are evaluated in terms of computational efficiency as well as prediction accuracy of particle flows and mixing entropies. BGNNs are able to accurately reproduce 3D granular flows within simulation uncertainties over hundreds of thousands of simulation timesteps. Most notably, in our experiments, particles stay within the geometric objects without using handcrafted conditions or restrictions.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. BASIL: Best-Action Symbolic Interpretable Learning for Evolving Compact RL Policies

    cs.AI 2025-05 conditional novelty 6.0 of 10

    BASIL evolves compact symbolic if-then rule policies with a quality-diversity archive and matches a DQN baseline on CartPole, MountainCar, and Acrobot.

Pith tools