Mean-Field Simulation-Based Inference for Cosmological Initial Conditions

• URL: http://arxiv.org/abs/2410.15808v1
• Date: Mon, 21 Oct 2024 09:23:50 GMT
• Title: Mean-Field Simulation-Based Inference for Cosmological Initial Conditions
• Authors: Oleg Savchenko, Florian List, Guillermo Franco Abellán, Noemi Anau Montel, Christoph Weniger,
• Abstract summary: We present a simple method for Bayesian field reconstruction based on modeling the posterior distribution of the initial matter density field to be diagonal Gaussian in Fourier space. Training and sampling are extremely fast (training: $sim 1, mathrmh$ on a GPU, sampling: $lesssim 3, mathrms$ for 1000 samples at resolution $1283$), and our method supports industry-standard (non-differentiable) $N$-body simulators.
• Score: 4.520518890664213
• License:
• Abstract: Reconstructing cosmological initial conditions (ICs) from late-time observations is a difficult task, which relies on the use of computationally expensive simulators alongside sophisticated statistical methods to navigate multi-million dimensional parameter spaces. We present a simple method for Bayesian field reconstruction based on modeling the posterior distribution of the initial matter density field to be diagonal Gaussian in Fourier space, with its covariance and the mean estimator being the trainable parts of the algorithm. Training and sampling are extremely fast (training: $\sim 1 \, \mathrm{h}$ on a GPU, sampling: $\lesssim 3 \, \mathrm{s}$ for 1000 samples at resolution $128^3$), and our method supports industry-standard (non-differentiable) $N$-body simulators. We verify the fidelity of the obtained IC samples in terms of summary statistics.

Related papers

• A Specialized Semismooth Newton Method for Kernel-Based Optimal Transport [92.96250725599958]
  Kernel-based optimal transport (OT) estimators offer an alternative, functional estimation procedure to address OT problems from samples. We show that our SSN method achieves a global convergence rate of $O (1/sqrtk)$, and a local quadratic convergence rate under standard regularity conditions.
  arXiv  Detail & Related papers  (2023-10-21T18:48:45Z)
• Simulation-free Schr\"odinger bridges via score and flow matching [89.4231207928885]
  We present simulation-free score and flow matching ([SF]$2$M) Our method generalizes both the score-matching loss used in the training of diffusion models and the recently proposed flow matching loss used in the training of continuous flows. Notably, [SF]$2$M is the first method to accurately model cell dynamics in high dimensions and can recover known gene regulatory networks simulated data.
  arXiv  Detail & Related papers  (2023-07-07T15:42:35Z)
• 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)
• 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)
• A Statistical Learning View of Simple Kriging [0.0]
  We analyze the simple Kriging task from a statistical learning perspective. The goal is to predict the unknown values it takes at any other location with minimum quadratic risk. We prove non-asymptotic bounds of order $O_mathbbP (1/sqrtn)$ for the excess risk of a plug-in predictive rule mimicking the true minimizer.
  arXiv  Detail & Related papers  (2022-02-15T12:46:43Z)
• Fast and Credible Likelihood-Free Cosmology with Truncated Marginal Neural Ratio Estimation [0.0]
  Truncated Marginal Neural Ratio Estimation (TMNRE) is a new approach in so-called simulation-based inference. We show that TMNRE can achieve converged posteriors using orders of magnitude fewer simulator calls than conventional Markov Chain Monte Carlo. TMNRE promises to become a powerful tool for cosmological data analysis, particularly in the context of extended cosmologies.
  arXiv  Detail & Related papers  (2021-11-15T19:00:09Z)
• Inverting brain grey matter models with likelihood-free inference: a tool for trustable cytoarchitecture measurements [62.997667081978825]
  characterisation of the brain grey matter cytoarchitecture with quantitative sensitivity to soma density and volume remains an unsolved challenge in dMRI. We propose a new forward model, specifically a new system of equations, requiring a few relatively sparse b-shells. We then apply modern tools from Bayesian analysis known as likelihood-free inference (LFI) to invert our proposed model.
  arXiv  Detail & Related papers  (2021-11-15T09:08:27Z)
• Sensing Cox Processes via Posterior Sampling and Positive Bases [56.82162768921196]
  We study adaptive sensing of point processes, a widely used model from spatial statistics. We model the intensity function as a sample from a truncated Gaussian process, represented in a specially constructed positive basis. Our adaptive sensing algorithms use Langevin dynamics and are based on posterior sampling (textscCox-Thompson) and top-two posterior sampling (textscTop2) principles.
  arXiv  Detail & Related papers  (2021-10-21T14:47:06Z)
• Topological Echoes of Primordial Physics in the Universe at Large Scales [0.0]
  We compute persistence diagrams and derived statistics for simulations of dark matter halos. Our pipeline computes persistence in sub-boxes of full simulations and simulations are subsampled to uniform halo number.
  arXiv  Detail & Related papers  (2020-12-07T12:08:55Z)
• Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction [63.41789556777387]
  Asynchronous Q-learning aims to learn the optimal action-value function (or Q-function) of a Markov decision process (MDP) We show that the number of samples needed to yield an entrywise $varepsilon$-accurate estimate of the Q-function is at most on the order of $frac1mu_min (1-gamma)5varepsilon2+ fract_mixmu_min (1-gamma)$ up to some logarithmic factor.
  arXiv  Detail & Related papers  (2020-06-04T17:51:00Z)
• 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.