English
Related papers

Related papers: A Sampling Strategy for High-Dimensional Spaces Ap…

200 papers

In this paper we shall consider optimal scaling problems for high-dimensional Metropolis--Hastings algorithms where updates can be chosen to be lower dimensional than the target density itself. We find that the optimal scaling rule for the…

Probability · Mathematics 2007-05-23 Peter Neal , Gareth Roberts

Several approaches exist to model gravitational lens systems. In this study, we apply global optimization methods to find the optimal set of lens parameters using a genetic algorithm. We treat the full optimization procedure as a two-step…

Cosmology and Nongalactic Astrophysics · Physics 2015-06-11 Adam Rogers , Jason D. Fiege

The purpose of this paper is to report on recent approaches to reconstruction problems based on analog, or in other words, infinite-dimensional, image and signal models. We describe three main contributions to this problem. First, linear…

Numerical Analysis · Mathematics 2013-10-07 Ben Adcock , Anders Hansen , Bogdan Roman , Gerd Teschke

The missing data issue often complicates the task of estimating generalized linear models (GLMs). We describe why the pseudo-marginal Metropolis-Hastings algorithm, used in this setting, is an effective strategy for parameter estimation.…

Methodology · Statistics 2019-07-23 Taylor R. Brown , Timothy L. McMurry , Alexander Langevin

In Bayesian inverse problems, the posterior distribution is used to quantify uncertainty about the reconstructed solution. In practice, Markov chain Monte Carlo algorithms often are used to draw samples from the posterior distribution.…

Numerical Analysis · Mathematics 2018-03-13 D. Andrew Brown , Arvind Saibaba , Sarah Vallélian

We propose a new smoothing method for obtaining surface densities from discrete particle positions from numerical simulations. This is an essential step for many applications in gravitational lensing. This method is based on the ``scatter''…

Astrophysics · Physics 2011-02-11 Guo-Liang Li , S. Mao , Y. P. Jing , X. Kang , M. Bartelmann

This paper introduces Manhattan sampling in two and higher dimensions, and proves sampling theorems. In two dimensions, Manhattan sampling, which takes samples densely along a Manhattan grid of lines, can be viewed as sampling on the union…

Information Theory · Computer Science 2015-02-06 Matthew A. Prelee , David L. Neuhoff

This article develops a general-purpose adaptive sampler that approximates the target density by a mixture of multivariate t densities. The adaptive sampler is based on reversible proposal distributions each of which has the mixture of…

Methodology · Statistics 2013-08-22 Minh-Ngoc Tran , Michael K. Pitt , Robert Kohn

Strong lenses are extremely useful probes of the distribution of matter on galaxy and cluster scales at cosmological distances, but are rare and difficult to find. The number of currently known lenses is on the order of 1,000. We wish to…

Convergence analysis of Markov chain Monte Carlo methods in high-dimensional statistical applications is increasingly recognized. In this paper, we develop general mixing time bounds for Metropolis-Hastings algorithms on discrete spaces by…

Computation · Statistics 2025-07-29 Hyunwoong Chang , Quan Zhou

Motivated by the problem of exploring discrete but very complex state spaces in Bayesian models, we propose a novel Markov Chain Monte Carlo search algorithm: the taxicab sampler. We describe the construction of this sampler and discuss how…

Methodology · Statistics 2022-10-04 Vincent Geels , Matthew Pratola , Radu Herbei

We investigate the local and line-of-sight overdensities of strong gravitational lens galaxies using wide-area multiband imaging from the Hyper Suprime-Cam Subaru Strategic Program. We present 41 new definite or probable lens candidates…

Consider the problem of approximating a given probability distribution on the cube $[0,1]^n$ via the use of a square lattice discretization with mesh-size $1/N$ and the Metropolis algorithm. Here the dimension $n$ is fixed and we focus for…

Probability · Mathematics 2022-02-01 Laurent Saloff-Coste , Sophie Uluatam

Studies of strong gravitational lensing in current and upcoming wide and deep photometric surveys, and of stellar kinematics from (integral-field) spectroscopy at increasing redshifts, promise to provide valuable constraints on galaxy…

Astrophysics · Physics 2015-05-13 Glenn van de Ven , Rachel Mandelbaum , Charles R. Keeton

The self-learning Metropolis-Hastings algorithm is a powerful Monte Carlo method that, with the help of machine learning, adaptively generates an easy-to-sample probability distribution for approximating a given hard-to-sample distribution.…

Quantum Physics · Physics 2021-01-04 Katsuhiro Endo , Taichi Nakamura , Keisuke Fujii , Naoki Yamamoto

We propose a hybrid generative model for efficient sampling of high-dimensional, multimodal probability distributions for Bayesian inference. Traditional Monte Carlo methods, such as the Metropolis-Hastings and Langevin Monte Carlo sampling…

Machine Learning · Statistics 2025-05-14 Hoang Tran , Zezhong Zhang , Feng Bao , Dan Lu , Guannan Zhang

This paper introduces a new Markov Chain Monte Carlo method for Bayesian variable selection in high dimensional settings. The algorithm is a Hastings-Metropolis sampler with a proposal mechanism which combines a Metropolis Adjusted Langevin…

Statistics Theory · Mathematics 2015-09-14 Amandine Schreck , Gersende Fort , Sylvain Le Corff , Eric Moulines

Strong gravitational lensing by galaxies is a powerful tool for studying cosmology and galaxy structure. The China Space Station Telescope (CSST) will revolutionize this field by discovering up to $\sim$100,000 galaxy-scale strong lenses, a…

Cosmology and Nongalactic Astrophysics · Physics 2025-11-12 Hengyu Wu , Yun Chen , Tonghua Liu , Xiaoyue Cao , Tian Li , Hui Li , Nan Li , Ran Li , Tengpeng Xu

We show that it is feasible to carry out exact Bayesian inference for non-Gaussian state space models using an adaptive Metropolis Hastings sampling scheme with the likelihood approximated by the particle filter. Furthermore, an adapyive…

Computation · Statistics 2009-11-03 Ralph Silva , Paolo Giordani , Robert Kohn , Mike Pitt

Sampling-based algorithms are classical approaches to perform Bayesian inference in inverse problems. They provide estimators with the associated credibility intervals to quantify the uncertainty on the estimators. Although these methods…

Methodology · Statistics 2023-11-28 Pierre-Antoine Thouvenin , Audrey Repetti , Pierre Chainais
‹ Prev 1 4 5 6 7 8 10 Next ›