COmoving Computer Acceleration (COCA): N-body simulations in an emulated frame of reference
Not on the map. Why?
Abstract (arXiv)
N-body simulations are computationally expensive, so machine-learning (ML)-based emulation techniques have emerged as a way to increase their speed. Although fast, surrogate models have limited trustworthiness due to potentially substantial emulation errors that current approaches cannot correct for. To alleviate this problem, we introduce COmoving Computer Acceleration (COCA), a hybrid framework interfacing ML with an N-body simulator. The correct physical equations of motion are solved in an emulated frame of reference, so that any emulation error is corrected by design. This approach corresponds to solving for the perturbation of particle trajectories around the machine-learnt solution, which is computationally cheaper than obtaining the full solution, yet is guaranteed to converge to the truth as one increases the number of force evaluations. Although applicable to any ML algorithm and N-body simulator, this approach is assessed in the particular case of particle-mesh cosmological simulations in a frame of reference predicted by a convolutional neural network, where the time dependence is encoded as an additional input parameter to the network. COCA efficiently reduces emulation errors in particle trajectories, requiring far fewer force evaluations than running the corresponding simulation without ML. We obtain accurate final density and velocity fields for a reduced computational budget. We demonstrate that this method shows robustness when applied to examples outside the range of the training data. When compared to the direct emulation of the Lagrangian displacement field using the same training resources, COCA's ability to correct emulation errors results in more accurate predictions. COCA makes N-body simulations cheaper by skipping unnecessary force evaluations, while still solving the correct equations of motion and correcting for emulation errors made by ML.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 19 of its 73 references that are in the map. First posted on arXiv 3 Sep 2024.
Builds on
19 of 73 references.
References · 19
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,604
- 2019Analyzing and Improving the Image Quality of StyleGANcited by 3,580
- 2016V-Net: Fully Convolutional Neural Networks for Volumetric Medical Image Segmentationcited by 2,284
- 2018Learning to Predict the Cosmological Structure Formationcited by 38
- 2022Exhaustive Symbolic Regressioncited by 29
- 2020AI-assisted super-resolution cosmological simulationscited by 15
- 2022Field Level Neural Network Emulator for Cosmological N-body Simulationscited by 13
- 2019Cosmological N-body simulations: a challenge for scalable generative modelscited by 11
- 2024LtU-ILI: An All-in-One Framework for Implicit Inference in Astrophysics and Cosmologycited by 8
7 more
- 2020Learning effective physical laws for generating cosmological hydrodynamics with Lagrangian Deep Learningcited by 7
- 2020Fast and Accurate Non-Linear Predictions of Universes with Deep Learningcited by 7
- 2022Hybrid Physical-Neural ODEs for Fast N-body Simulationscited by 5
- 2019Learning neutrino effects in Cosmology with Convolutional Neural Networkscited by 3
- 2022Simple lessons from complex learning: what a neural network model learns about cosmic structure formationcited by 2
- 2022Simulation-based inference of Bayesian hierarchical models while checking for model misspecificationcited by 2
- 2023Fast emulation of cosmological density fields based on dimensionality reduction and supervised machine-learningcited by 1
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.