Issue |
A&A
Volume 668, December 2022
|
|
---|---|---|
Article Number | A139 | |
Number of page(s) | 14 | |
Section | Numerical methods and codes | |
DOI | https://doi.org/10.1051/0004-6361/202039956 | |
Published online | 15 December 2022 |
Reducing the complexity of chemical networks via interpretable autoencoders
1
Universitäts-Sternwarte München,
Scheinerstr. 1,
81679
München, Germany
e-mail: tgrassi@mpe.mpg.de
2
Excellence Cluster Origin and Structure of the Universe,
Boltzmannstr.2,
85748
Garching bei München, Germany
3
Max Planck Institute for Extraterrestrial Physics,
Giessenbachstrasse 1,
85748
Garching bei München, Germany
4
2MNordic IT Consulting AB,
Skårs led 3,
412 63
Gothenburg, Sweden
5
Department of Astronomy, University of Virginia,
Charlottesville, VA
22904, USA
6
Departamento de Astronomía, Facultad Ciencias Físicas y Matemáticas, Universidad de Concepción,
Av. Esteban Iturra s/n Barrio Universitario, Casilla 160,
Concepción, Chile
Received:
21
November
2020
Accepted:
2
September
2021
In many astrophysical applications, the cost of solving a chemical network represented by a system of ordinary differential equations (ODEs) grows significantly with the size of the network and can often represent a significant computational bottleneck, particularly in coupled chemo-dynamical models. Although standard numerical techniques and complex solutions tailored to thermochemistry can somewhat reduce the cost, more recently, machine learning algorithms have begun to attack this challenge via data-driven dimensional reduction techniques. In this work, we present a new class of methods that take advantage of machine learning techniques to reduce complex data sets (autoencoders), the optimization of multiparameter systems (standard backpropagation), and the robustness of well-established ODE solvers to to explicitly incorporate time dependence. This new method allows us to find a compressed and simplified version of a large chemical network in a semiautomated fashion that can be solved with a standard ODE solver, while also enabling interpretability of the compressed, latent network. As a proof of concept, we tested the method on an astrophysically relevant chemical network with 29 species and 224 reactions, obtaining a reduced but representative network with only 5 species and 12 reactions, and an increase in speed by a factor 65.
Key words: astrochemistry / methods: numerical
© T. Grassi et al. 2022
Open Access article, published by EDP Sciences, under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Open access funding provided by Max Planck Society.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.