Symbolic Emulators for Cosmology: Accelerating Cosmological Analyses Without Sacrificing Precision

• URL: http://arxiv.org/abs/2510.18749v1
• Date: Tue, 21 Oct 2025 15:57:23 GMT
• Title: Symbolic Emulators for Cosmology: Accelerating Cosmological Analyses Without Sacrificing Precision
• Abstract summary: We introduce approximations to hypergeometric functions used for the $Lambda$CDM comoving distance and linear growth factor.<n>We show that integrating symbolic emulators into a Dark Energy Survey-like $3times2$pt analysis produces cosmological constraints consistent with those obtained using standard numerical methods.
• Score: 0.35684665108045377
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In cosmology, emulators play a crucial role by providing fast and accurate predictions of complex physical models, enabling efficient exploration of high-dimensional parameter spaces that would be computationally prohibitive with direct numerical simulations. Symbolic emulators have emerged as promising alternatives to numerical approaches, delivering comparable accuracy with significantly faster evaluation times. While previous symbolic emulators were limited to relatively narrow prior ranges, we expand these to cover the parameter space relevant for current cosmological analyses. We introduce approximations to hypergeometric functions used for the $\Lambda$CDM comoving distance and linear growth factor which are accurate to better than 0.001% and 0.05%, respectively, for all redshifts and for $\Omega_{\rm m} \in [0.1, 0.5]$. We show that integrating symbolic emulators into a Dark Energy Survey-like $3\times2$pt analysis produces cosmological constraints consistent with those obtained using standard numerical methods. Our symbolic emulators offer substantial improvements in speed and memory usage, demonstrating their practical potential for scalable, likelihood-based inference.

Related papers

• EventShiftFlow: Towards Hardware-efficient FPGA-based Flow Estimation [43.77587889970362]
  Event-based vision sensors offer asynchronous, high-temporal-resolution measurements.<n>Many event-based motion estimation methods are computationally intensive and difficult to map to FPGA hardware.<n>We present a streaming velocity estimator that discretizes asynchronous events into fixed-duration time bins, constructs a 1-bit spatial occupancy grid, and evaluates multiple velocity hypotheses in parallel.
  arXiv  Detail & Related papers  (2026-05-27T11:13:58Z)
• Physically Accurate Rigid-Body Dynamics in Particle-Based Simulation [38.44669833143752]
  Particle-based simulators offer a compelling alternative to current simulators.<n>Position-based dynamics (PBD) is a popular solver known for its computational efficiency and visual plausibility.<n>We introduce PBD-R, a revised PBD formulation that enforces physically accurate rigid-body dynamics.
  arXiv  Detail & Related papers  (2026-03-15T22:09:42Z)
• SimulCost: A Cost-Aware Benchmark and Toolkit for Automating Physics Simulations with LLMs [56.07550353240028]
  We introduce SimulCost, the first benchmark targeting cost-sensitive parameter tuning in physics simulations.<n>SimulCost compares LLM tuning cost-sensitive parameters against traditional scanning approach in both accuracy and computational cost.<n>Each simulator's cost is analytically defined and platform-independent.
  arXiv  Detail & Related papers  (2026-03-11T05:00:48Z)
• G-Sim: Generative Simulations with Large Language Models and Gradient-Free Calibration [48.948187359727996]
  G-Sim is a hybrid framework that automates simulator construction with rigorous empirical calibration.<n>It produces reliable, causally-informed simulators, mitigating data-inefficiency and enabling robust system-level interventions.
  arXiv  Detail & Related papers  (2025-06-10T22:14:34Z)
• GausSim: Foreseeing Reality by Gaussian Simulator for Elastic Objects [55.02281855589641]
  GausSim is a novel neural network-based simulator designed to capture the dynamic behaviors of real-world elastic objects represented through Gaussian kernels.<n>We leverage continuum mechanics and treat each kernel as a Center of Mass System (CMS) that represents continuous piece of matter.<n>In addition, GausSim incorporates explicit physics constraints, such as mass and momentum conservation, ensuring interpretable results and robust, physically plausible simulations.
  arXiv  Detail & Related papers  (2024-12-23T18:58:17Z)
• Parallel Simulation for Log-concave Sampling and Score-based Diffusion Models [55.07411490538404]
  We propose a novel parallel sampling method that improves adaptive complexity dependence on dimension $d$.<n>Our approach builds on parallel simulation techniques from scientific computing.
  arXiv  Detail & Related papers  (2024-12-10T11:50:46Z)
• Cosmological Analysis with Calibrated Neural Quantile Estimation and Approximate Simulators [0.0]
  We introduce a new Simulation-Based Inference ( SBI) method that leverages a large number of approximate simulations for training and a small number of high-fidelity simulations for calibration. As a proof of concept, we demonstrate that cosmological parameters can be inferred at field level from projected 2-dim dark matter density maps up to $k_rm maxsim1.5,h$/Mpc at $z=0$. The calibrated posteriors closely match those obtained by directly training on $sim104$ expensive Particle-Particle (PP) simulations, but at a fraction of the computational cost
  arXiv  Detail & Related papers  (2024-11-22T05:53:46Z)
• syren-new: Precise formulae for the linear and nonlinear matter power spectra with massive neutrinos and dynamical dark energy [0.6825805890534121]
  Current and future large scale structure surveys aim to constrain the neutrino mass and the equation of state of dark energy. We construct accurate and interpretable symbolic approximations to the linear and nonlinear matter power spectra as a function of cosmological parameters. Our work greatly improves the accuracy, speed and range of applicability of current symbolic approximations to the linear and nonlinear matter power spectra.
  arXiv  Detail & Related papers  (2024-10-18T17:22:38Z)
• Discovering physical laws with parallel symbolic enumeration [67.36739393470869]
  We introduce parallel symbolic enumeration (PSE) to efficiently distill generic mathematical expressions from limited data.<n>Experiments show that PSE achieves higher accuracy and faster computation compared to the state-of-the-art baseline algorithms.<n> PSE represents an advance in accurate and efficient data-driven discovery of symbolic, interpretable models.
  arXiv  Detail & Related papers  (2024-07-05T10:41:15Z)
• A precise symbolic emulator of the linear matter power spectrum [0.28087862620958753]
  We utilise an efficient genetic programming based symbolic regression framework to explore the space of potential mathematical expressions. We obtain an analytic approximation to the linear power spectrum with a root mean squared fractional error of 0.2% between $k = 9times10-3 - 9, hrm, Mpc-1$ and across a wide range of cosmological parameters. We also provide a simple analytic approximation for $sigma_8$ with a similar accuracy, with a root mean squared fractional error of just 0.1% when evaluated across the same range of cosmologies.
  arXiv  Detail & Related papers  (2023-11-27T14:33:21Z)
• Fast emulation of cosmological density fields based on dimensionality reduction and supervised machine-learning [0.0]
  We show that it is possible to perform fast dark matter density field emulations with competitive accuracy using simple machine-learning approaches. New density cubes for different cosmological parameters can be estimated without relying directly on new N-body simulations.
  arXiv  Detail & Related papers  (2023-04-12T18:29:26Z)
• Cosmology from Galaxy Redshift Surveys with PointNet [65.89809800010927]
  In cosmology, galaxy redshift surveys resemble such a permutation invariant collection of positions in space. We employ a textitPointNet-like neural network to regress the values of the cosmological parameters directly from point cloud data. Our implementation of PointNets can analyse inputs of $mathcalO(104) - mathcalO(105)$ galaxies at a time, which improves upon earlier work for this application by roughly two orders of magnitude.
  arXiv  Detail & Related papers  (2022-11-22T15:35:05Z)
• 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)
• Satellite galaxy abundance dependency on cosmology in Magneticum simulations [101.18253437732933]
  We build an emulator of satellite abundance based on cosmological parameters. We find that $A$ and $beta$ depend on cosmological parameters, even if weakly. We also show that satellite abundance cosmology dependency differs between full-physics (FP) simulations, dark-matter only (DMO) and non-radiative simulations.
  arXiv  Detail & Related papers  (2021-10-11T18:00:02Z)
• Sim and Real: Better Together [47.14469055555684]
  We demonstrate how to learn simultaneously from both simulation and interaction with the real environment. We propose an algorithm for balancing the large number of samples from the high throughput but less accurate simulation. We analyze such multi-environment interaction theoretically, and provide convergence properties, through a novel theoretical replay buffer analysis.
  arXiv  Detail & Related papers  (2021-10-01T14:30:03Z)
• Hybridized Methods for Quantum Simulation in the Interaction Picture [69.02115180674885]
  We provide a framework that allows different simulation methods to be hybridized and thereby improve performance for interaction picture simulations. Physical applications of these hybridized methods yield a gate complexity scaling as $log2 Lambda$ in the electric cutoff. For the general problem of Hamiltonian simulation subject to dynamical constraints, these methods yield a query complexity independent of the penalty parameter $lambda$ used to impose an energy cost.
  arXiv  Detail & Related papers  (2021-09-07T20:01:22Z)

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.