A precise symbolic emulator of the linear matter power spectrum

• URL: http://arxiv.org/abs/2311.15865v2
• Date: Mon, 15 Apr 2024 08:18:47 GMT
• Title: A precise symbolic emulator of the linear matter power spectrum
• Abstract summary: 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.
• Score: 0.28087862620958753
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Computing the matter power spectrum, $P(k)$, as a function of cosmological parameters can be prohibitively slow in cosmological analyses, hence emulating this calculation is desirable. Previous analytic approximations are insufficiently accurate for modern applications, so black-box, uninterpretable emulators are often used. We utilise an efficient genetic programming based symbolic regression framework to explore the space of potential mathematical expressions which can approximate the power spectrum and $\sigma_8$. We learn the ratio between an existing low-accuracy fitting function for $P(k)$ and that obtained by solving the Boltzmann equations and thus still incorporate the physics which motivated this earlier approximation. We obtain an analytic approximation to the linear power spectrum with a root mean squared fractional error of 0.2% between $k = 9\times10^{-3} - 9 \, h{\rm \, Mpc^{-1}}$ and across a wide range of cosmological parameters, and we provide physical interpretations for various terms in the expression. Our analytic approximation is 950 times faster to evaluate than camb and 36 times faster than the neural network based matter power spectrum emulator BACCO. 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. This function is easily invertible to obtain $A_{\rm s}$ as a function of $\sigma_8$ and the other cosmological parameters, if preferred. It is possible to obtain symbolic approximations to a seemingly complex function at a precision required for current and future cosmological analyses without resorting to deep-learning techniques, thus avoiding their black-box nature and large number of parameters. Our emulator will be usable long after the codes on which numerical approximations are built become outdated.

Related papers

• Symbolic Emulators for Cosmology: Accelerating Cosmological Analyses Without Sacrificing Precision [0.35684665108045377]
  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.
  arXiv  Detail & Related papers  (2025-10-21T15:57:23Z)
• An accuracy-runtime trade-off comparison of scalable Gaussian process approximations for spatial data [11.141688859736805]
  A drawback of Gaussian processes is their computational cost having $mathcalO(N3)$ time and $mathcalO(N2)$ memory complexity. Numerous approximation techniques have been proposed to address this limitation. We analyze this trade-off between accuracy and runtime on multiple simulated and large-scale real-world datasets.
  arXiv  Detail & Related papers  (2025-01-20T12:35:58Z)
• Beyond likelihood ratio bias: Nested multi-time-scale stochastic approximation for likelihood-free parameter estimation [49.78792404811239]
  We study inference in simulation-based models where the analytical form of the likelihood is unknown.<n>We use a ratio-free nested multi-time-scale approximation (SA) method that simultaneously tracks the score and drives the parameter update.<n>We show that our algorithm can eliminate the original bias $Obig(sqrtfrac1Nbig)$ and accelerate the convergence rate from $Obig(beta_k+sqrtfracalpha_kNbig)$.
  arXiv  Detail & Related papers  (2024-11-20T02:46:15Z)
• 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)
• A Theory of Interpretable Approximations [61.90216959710842]
  We study the idea of approximating a target concept $c$ by a small aggregation of concepts from some base class $mathcalH$. For any given pair of $mathcalH$ and $c$, exactly one of these cases holds: (i) $c$ cannot be approximated by $mathcalH$ with arbitrary accuracy. We show that, in the case of interpretable approximations, even a slightly nontrivial a-priori guarantee on the complexity of approximations implies approximations with constant (distribution-free and accuracy-
  arXiv  Detail & Related papers  (2024-06-15T06:43:45Z)
• Neural network learns low-dimensional polynomials with SGD near the information-theoretic limit [75.4661041626338]
  We study the problem of gradient descent learning of a single-index target function $f_*(boldsymbolx) = textstylesigma_*left(langleboldsymbolx,boldsymbolthetarangleright)$ under isotropic Gaussian data. We prove that a two-layer neural network optimized by an SGD-based algorithm learns $f_*$ of arbitrary link function with a sample and runtime complexity of $n asymp T asymp C(q) cdot d
  arXiv  Detail & Related papers  (2024-06-03T17:56:58Z)
• syren-halofit: A fast, interpretable, high-precision formula for the $Λ$CDM nonlinear matter power spectrum [0.0]
  We use symbolic regression to obtain simple analytic approximations to the nonlinear scale, $k_sigma$, the effective spectral index, $n_rm eff$, and the curvature, $C$. We then re-optimise the coefficients of halofit to fit a wide range of cosmologies and redshifts. Our results are designed to match the predictions of EuclidEmulator2, but are validated against $N$-body simulations.
  arXiv  Detail & Related papers  (2024-02-27T13:18:00Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Optimal Convergence Rate of Lie-Trotter Approximation for Quantum Thermal Averages [0.0]
  Lie--Trotter product formula is a foundational approximation for the quantum partition function.<n>This paper provides a quantitative error analysis for this approximation across two key systems.
  arXiv  Detail & Related papers  (2023-09-11T01:30:26Z)
• A self-consistent systematic optimization of range-separated hybrid functionals from first principles [0.0]
  We represent a self-consistent systematic optimization procedure for the development of optimally tuned (OT) range-separated hybrid (RSH) functionals. We make use of the size-dependency based ansatz i.e., RS parameter, $gamma$, is a functional of density, $rho(mathbfr)$, of which not much is known. It is found that the parameter $gamma_mathrmOT$ can show better performance in predicting properties than conventional respective RSH functionals.
  arXiv  Detail & Related papers  (2022-05-18T16:23:37Z)
• Statistically Meaningful Approximation: a Case Study on Approximating Turing Machines with Transformers [50.85524803885483]
  This work proposes a formal definition of statistically meaningful (SM) approximation which requires the approximating network to exhibit good statistical learnability. We study SM approximation for two function classes: circuits and Turing machines.
  arXiv  Detail & Related papers  (2021-07-28T04:28:55Z)
• Reducing the Variance of Gaussian Process Hyperparameter Optimization with Preconditioning [54.01682318834995]
  Preconditioning is a highly effective step for any iterative method involving matrix-vector multiplication. We prove that preconditioning has an additional benefit that has been previously unexplored. It simultaneously can reduce variance at essentially negligible cost.
  arXiv  Detail & Related papers  (2021-07-01T06:43:11Z)
• Tightening the Dependence on Horizon in the Sample Complexity of Q-Learning [59.71676469100807]
  This work sharpens the sample complexity of synchronous Q-learning to an order of $frac|mathcalS|| (1-gamma)4varepsilon2$ for any $0varepsilon 1$. Our finding unveils the effectiveness of vanilla Q-learning, which matches that of speedy Q-learning without requiring extra computation and storage.
  arXiv  Detail & Related papers  (2021-02-12T14:22:05Z)
• Even more efficient quantum computations of chemistry through tensor hypercontraction [0.6234350105794442]
  We describe quantum circuits with only $widetildecal O(N)$ Toffoli complexity that block encode the spectra of quantum chemistry Hamiltonians in a basis of $N$ arbitrary orbitals. This is the lowest complexity that has been shown for quantum computations of chemistry within an arbitrary basis.
  arXiv  Detail & Related papers  (2020-11-06T18:03:29Z)
• Spectral density estimation with the Gaussian Integral Transform [91.3755431537592]
  spectral density operator $hatrho(omega)=delta(omega-hatH)$ plays a central role in linear response theory. We describe a near optimal quantum algorithm providing an approximation to the spectral density.
  arXiv  Detail & Related papers  (2020-04-10T03:14:38Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

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.