Metraipolis › archive › dc_13bf68c8995d
A Latent Space Optimization Approach for Symbolic Discovery of Dynamical Models — arXiv:2610.11059
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.11059
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T07:13:37.213Z
- SHA-256 of the archived text
615ceaf183a523e71face072d85b781b43d9d130bf0ba64340177378cda25eaf- Stable URL of this page
https://metraipolis.com/documento/dc_13bf68c8995d
How to cite
A Latent Space Optimization Approach for Symbolic Discovery of Dynamical Models — arXiv:2610.11059 — arXiv (en), https://arxiv.org/abs/2610.11059 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_13bf68c8995d (Metraipolis archive dc_13bf68c8995d, sha256 615ceaf183a523e71face072d85b781b43d9d130bf0ba64340177378cda25eaf)
BibTeX
@misc{dc13bf68c8995d,
title = {A Latent Space Optimization Approach for Symbolic Discovery of Dynamical Models — arXiv:2610.11059},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.11059},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_13bf68c8995d; sha256 615ceaf183a523e71face072d85b781b43d9d130bf0ba64340177378cda25eaf},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.11059. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In this paper, we propose a hybrid latent-space Bayesian Optimization (BO) and global optimization framework for solving symbolic regression tasks to discover dynamical models from data. Symbolic regression can discover equations from data without fixing the functional form of the expression a priori. The proposed framework uses the fact that if the functional form of the expression is fixed, the symbolic regression task reduces to a parameter estimation problem, which must be solved to global optimality. Motivated by this structure, first, we train a VAE to map the discrete space of expression trees into a continuous latent space. Then, we use BO to search this latent space while assessing a candidate expression's prediction error by solving the parameter estimation problem to global optimality. We evaluate our framework across two case studies: static reaction rate law discovery and dynamic concentration identification in a continuous stirred-tank reactor (CSTR). The results show that our framework identifies the true governing equations faster than MINLP formulations without solver timeouts and achieves higher sample efficiency than evolutionary baselines under tight evaluation budgets. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv eess.SY, nuovi lavori del giorno). Categorie arXiv: Systems and Control (eess.SY). Pagina del lavoro: https://arxiv.org/abs/2610.11059 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-09T07:07:42.925Z dalla pagina https://arxiv.org/list/eess.SY/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).