English
Related papers

Related papers: Efficient cosmological parameter sampling using sp…

200 papers

We discuss the problems of applying Maximum Likelihood methods to the CMB and how one can make it both efficient and optimal. The solution is a generalised eigenvalue problem that allows virtually no loss of information about the parameter…

Astrophysics · Physics 2007-05-23 Andy Taylor , Alan Heavens , Bill Ballinger , Max Tegmark

Precise estimation of cosmological parameters from the cosmic microwave background (CMB) remains a central goal of modern cosmology and a key test of inflationary physics. However, this task is fundamentally limited by strong foreground…

Cosmology and Nongalactic Astrophysics · Physics 2026-04-03 Larissa Santos , Camila P. Novaes , Elisa G. M. Ferreira , Carlo Baccigalupi

Structured kernel interpolation (SKI) accelerates Gaussian process (GP) inference by interpolating the kernel covariance function using a dense grid of inducing points, whose corresponding kernel matrix is highly structured and thus…

Machine Learning · Computer Science 2023-05-26 Mohit Yadav , Daniel Sheldon , Cameron Musco

We study polynomial approximation on a $d$-cube, where $d$ is large, and compare interpolation on sparse grids, aka Smolyak's algorithm (SA), with a simple least squares method based on randomly generated points (LS) using standard…

Numerical Analysis · Mathematics 2025-07-01 Jakob Eggl , Elias Mindlberger , Mario Ullrich

In this work we provide a new technique to design fast approximation algorithms for graph problems where the points of the graph lie in a metric space. Specifically, we present a sampling approach for such metric graphs that, using a…

Data Structures and Algorithms · Computer Science 2018-07-26 Hossein Esfandiari , Michael Mitzenmacher

Efficient sampling of many-dimensional and multimodal density functions is a task of great interest in many research fields. We describe an algorithm that allows parallelizing inherently serial Markov chain Monte Carlo (MCMC) sampling by…

Computation · Statistics 2020-08-10 Vasyl Hafych , Philipp Eller , Oliver Schulz , Allen Caldwell

Cosmological analyses can be accelerated by approximating slow calculations using a training set, which is either precomputed or generated dynamically. However, this approach is only safe if the approximations are well understood and…

Instrumentation and Methods for Astrophysics · Physics 2015-09-03 Grigor Aslanyan , Richard Easther , Layne C. Price

Uncertainty quantification is a crucial step of cosmological mass-mapping that is often ignored. Suggested methods are typically only approximate or make strong assumptions of Gaussianity of the shear field. Probabilistic sampling methods,…

Cosmology and Nongalactic Astrophysics · Physics 2023-06-22 Augustin Marignier , Thomas Kitching , Jason D. McEwen , Ana M. G. Ferreira

The confrontation of the Cosmic Microwave Background (CMB) theoretical angular power spectrum with available data often requires the calculation of large numbers of power spectra. The standard practice is to use a fast code to compute the…

Astrophysics · Physics 2009-10-31 Kris Sigurdson , Douglas Scott

Several rapid parameter estimation methods have recently been advanced to deal with the computational challenges of the problem of Bayesian inference of the properties of compact binary sources detected in the upcoming science runs of the…

General Relativity and Quantum Cosmology · Physics 2023-12-05 Lalit Pathak , Amit Reza , Anand S. Sengupta

We present a method for ultra-fast confrontation of the WMAP cosmic microwave background observations with theoretical models, implemented as a publicly available software package called CMBfit, useful for anyone wishing to measure…

Astrophysics · Physics 2013-08-07 Havard B. Sandvik , Max Tegmark , Xiaomin Wang , Matias Zaldarriaga

Markov Chain Monte Carlo (MCMC) techniques are now widely used for cosmological parameter estimation. Chains are generated to sample the posterior probability distribution obtained following the Bayesian approach. An important issue is how…

The majority of present efforts to constrain cosmological parameters with cosmic microwave background (CMB) anisotropy data employ approximate likelihood functions, the time consuming nature of a complete analysis being a major obstacle. We…

Astrophysics · Physics 2007-05-23 M. Douspis , J. G. Bartlett , A. Blanchard , M. Le Dour

We give a new probabilistic algorithm for interpolating a "sparse" polynomial f given by a straight-line program. Our algorithm constructs an approximation f* of f, such that their difference probably has at most half the number of terms of…

Symbolic Computation · Computer Science 2014-01-24 Andrew Arnold , Mark Giesbrecht , Daniel S. Roche

Sampling-based inference techniques are central to modern cosmological data analysis; these methods, however, scale poorly with dimensionality and typically require approximate or intractable likelihoods. In this paper we describe how…

Cosmology and Nongalactic Astrophysics · Physics 2022-11-09 Alex Cole , Benjamin Kurt Miller , Samuel J. Witte , Maxwell X. Cai , Meiert W. Grootes , Francesco Nattino , Christoph Weniger

Cosmological probes pose an inverse problem where the measurement result is obtained through observations, and the objective is to infer values of model parameters which characterize the underlying physical system -- our Universe. Modern…

Instrumentation and Methods for Astrophysics · Physics 2019-05-21 Timur Takhtaganov , Zarija Lukic , Juliane Mueller , Dmitriy Morozov

Markov Chain Monte Carlo (MCMC) algorithms play an important role in statistical inference problems dealing with intractable probability distributions. Recently, many MCMC algorithms such as Hamiltonian Monte Carlo (HMC) and Riemannian…

Computation · Statistics 2017-04-19 Cheng Zhang , Babak Shahbaba , Hongkai Zhao

The statistical properties of a map of the primary fluctuations in the cosmic microwave background (CMB) may be specified to high accuracy by a few thousand power spectra measurements, provided the fluctuations are gaussian, yet the number…

Astrophysics · Physics 2009-11-07 Sujata Gupta , Alan F. Heavens

In the feature maps of CNNs, there commonly exists considerable spatial redundancy that leads to much repetitive processing. Towards reducing this superfluous computation, we propose to compute features only at sparsely sampled locations,…

Computer Vision and Pattern Recognition · Computer Science 2020-09-07 Zhenda Xie , Zheng Zhang , Xizhou Zhu , Gao Huang , Stephen Lin

In this work we develop a dynamically adaptive sparse grids (SG) method for quasi-optimal interpolation of multidimensional analytic functions defined over a product of one dimensional bounded domains. The goal of such approach is to…

Numerical Analysis · Mathematics 2015-08-06 Miroslav K. Stoyanov , Clayton G. Webster