LGJul 13, 2022
Neural Topological Ordering for Computation GraphsMukul Gagrani, Corrado Rainone, Yang Yang et al.
Recent works on machine learning for combinatorial optimization have shown that learning based approaches can outperform heuristic methods in terms of speed and performance. In this paper, we consider the problem of finding an optimal topological order on a directed acyclic graph with focus on the memory minimization problem which arises in compilers. We propose an end-to-end machine learning based approach for topological ordering using an encoder-decoder framework. Our encoder is a novel attention based graph neural network architecture called \emph{Topoformer} which uses different topological transforms of a DAG for message passing. The node embeddings produced by the encoder are converted into node priorities which are used by the decoder to generate a probability distribution over topological orders. We train our model on a dataset of synthetically generated graphs called layered graphs. We show that our model outperforms, or is on-par, with several topological ordering baselines while being significantly faster on synthetic graphs with up to 2k nodes. We also train and test our model on a set of real-world computation graphs, showing performance improvements.
32.8NAMar 16
Efficient and Accurate Surrogate Modeling of Turbulent Flows via Space-Dependent Aggregation and Reduced Order ModelsPiero Zappi, Anna Ivagnes, Niccolò Tonicello et al.
Reynolds-Averaged Navier-Stokes (RANS) models are widely used for turbulent flow simulations due to their computational efficiency, but their accuracy strongly depends on the selected turbulence closure and may vary across the flow domain. Space-dependent model aggregation has been shown to improve RANS predictions by combining multiple turbulence models, although at the cost of repeated high-fidelity simulations. The first novelty of this work is a unified framework that combines different turbulence models, space-dependent aggregation, and non-intrusive reduced order models to achieve both accuracy and efficiency. Two aggregation pipelines are proposed: a Mixed FOM-ROM (MFR) approach, where a reduced order model is trained on aggregated RANS solutions, and a Mixed-ROM (MR) approach, which directly aggregates multiple reduced order models built on top of different RANS full-order models. The second novelty is that the aggregation weights are learned via a neural-network that provides smooth, space-continuous weights and improves generalization with respect to standard weighting techniques. The resulting surrogate models are validated on the two-dimensional periodic hill benchmark and on the flow over a height-dependent bump, demonstrating improved accuracy over individual RANS and ROM predictions at near real-time computational cost.