Multi-Output Random Forest Regression to Emulate the Earliest Stages of Planet Formation

• URL: http://arxiv.org/abs/2104.12845v1
• Date: Mon, 26 Apr 2021 19:51:40 GMT
• Title: Multi-Output Random Forest Regression to Emulate the Earliest Stages of Planet Formation
• Authors: Kevin Hoffman, Jae Yoon Sung, Andr\'e Zazzera
• Abstract summary: We take a machine learning approach to designing a system for a much faster approximation. We develop a multi-output random forest regression model trained on brute-force simulation data. Results indicate that the random forest model can generate highly accurate predictions relative to the brute-force simulation results.
• Score: 0.1657441317977376
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: In the current paradigm of planet formation research, it is believed that the first step to forming massive bodies (such as asteroids and planets) requires that small interstellar dust grains floating through space collide with each other and grow to larger sizes. The initial formation of these pebbles is governed by an integro-differential equation known as the Smoluchowski coagulation equation, to which analytical solutions are intractable for all but the simplest possible scenarios. While brute-force methods of approximation have been developed, they are computationally costly, currently making it infeasible to simulate this process including other physical processes relevant to planet formation, and across the very large range of scales on which it occurs. In this paper, we take a machine learning approach to designing a system for a much faster approximation. We develop a multi-output random forest regression model trained on brute-force simulation data to approximate distributions of dust particle sizes in protoplanetary disks at different points in time. The performance of our random forest model is measured against the existing brute-force models, which are the standard for realistic simulations. Results indicate that the random forest model can generate highly accurate predictions relative to the brute-force simulation results, with an $R^{2}$ of 0.97, and do so significantly faster than brute-force methods.

Related papers

• Diffusion posterior sampling for simulation-based inference in tall data settings [53.17563688225137]
  Simulation-based inference ( SBI) is capable of approximating the posterior distribution that relates input parameters to a given observation. In this work, we consider a tall data extension in which multiple observations are available to better infer the parameters of the model. We compare our method to recently proposed competing approaches on various numerical experiments and demonstrate its superiority in terms of numerical stability and computational cost.
  arXiv  Detail & Related papers  (2024-04-11T09:23:36Z)
• Neural Likelihood Approximation for Integer Valued Time Series Data [0.0]
  We construct a neural likelihood approximation that can be trained using unconditional simulation of the underlying model. We demonstrate our method by performing inference on a number of ecological and epidemiological models.
  arXiv  Detail & Related papers  (2023-10-19T07:51:39Z)
• Towards Complex Dynamic Physics System Simulation with Graph Neural ODEs [75.7104463046767]
  This paper proposes a novel learning based simulation model that characterizes the varying spatial and temporal dependencies in particle systems. We empirically evaluate GNSTODE's simulation performance on two real-world particle systems, Gravity and Coulomb.
  arXiv  Detail & Related papers  (2023-05-21T03:51:03Z)
• A Neural Network Subgrid Model of the Early Stages of Planet Formation [1.8641315013048296]
  We present a fast and accurate learned effective model for dust coagulation, trained on data from high resolution numerical simulations. Our model captures details of the dust coagulation process that were so far not tractable with other dust coagulation prescriptions with similar computational efficiency.
  arXiv  Detail & Related papers  (2022-11-08T10:59:57Z)
• Residual Neural Networks for the Prediction of Planetary Collision Outcomes [0.0]
  We present a machine learning (ML) model for fast and accurate treatment of collisions in N-body planet formation simulations. Our model is motivated by the underlying physical processes of the data-generating process and allows for flexible prediction of post-collision states. We formulate the ML task as a multi-task regression problem, allowing simple, yet efficient training of ML models for collision treatment in an end-to-end manner.
  arXiv  Detail & Related papers  (2022-10-09T12:42:43Z)
• Multi-fidelity Hierarchical Neural Processes [79.0284780825048]
  Multi-fidelity surrogate modeling reduces the computational cost by fusing different simulation outputs. We propose Multi-fidelity Hierarchical Neural Processes (MF-HNP), a unified neural latent variable model for multi-fidelity surrogate modeling. We evaluate MF-HNP on epidemiology and climate modeling tasks, achieving competitive performance in terms of accuracy and uncertainty estimation.
  arXiv  Detail & Related papers  (2022-06-10T04:54:13Z)
• Fast and realistic large-scale structure from machine-learning-augmented random field simulations [0.0]
  We train a machine learning model to transform projected lognormal dark matter density fields to more realistic dark matter maps. We demonstrate the performance of our model comparing various statistical tests with different field resolutions, redshifts and cosmological parameters.
  arXiv  Detail & Related papers  (2022-05-16T18:00:01Z)
• Fast and Accurate Non-Linear Predictions of Universes with Deep Learning [21.218297581239664]
  We build a V-Net based model that transforms fast linear predictions into fully nonlinear predictions from numerical simulations. Our NN model learns to emulate the simulations down to small scales and is both faster and more accurate than the current state-of-the-art approximate methods.
  arXiv  Detail & Related papers  (2020-12-01T03:30:37Z)
• Learning to predict metal deformations in hot-rolling processes [59.00006390882099]
  Hot-rolling is a metal forming process that produces a cross-section from an input through a sequence of deformations. In current practice, the rolling sequence and the geometry of their rolls are needed to achieve a given cross-section. We propose a supervised learning approach to predict a given by a set of rolls with given geometry.
  arXiv  Detail & Related papers  (2020-07-22T13:33:44Z)
• Efficient Model-Based Reinforcement Learning through Optimistic Policy Search and Planning [93.1435980666675]
  We show how optimistic exploration can be easily combined with state-of-the-art reinforcement learning algorithms. Our experiments demonstrate that optimistic exploration significantly speeds-up learning when there are penalties on actions.
  arXiv  Detail & Related papers  (2020-06-15T18:37:38Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.