Declarative Modeling and Bayesian Inference of Dark Matter Halos
원문 초록
Probabilistic programming allows specification of probabilistic models in a declarative manner. Recently, several new software systems and languages for probabilistic programming have been developed on the basis of newly developed and improved methods for approximate inference in probabilistic models. In this contribution a probabilistic model for an idealized dark matter localization problem is described. We first derive the probabilistic model for the inference of dark matter locations and masses, and then show how this model can be implemented using BUGS and Infer.NET, two software systems for probabilistic programming. Finally, the different capabilities of both systems are discussed. The presented dark matter model includes mainly non-conjugate factors, thus, it is difficult to implement this model with Infer.NET.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
DeepRV: pre-trained spatial priors for accelerated disease mapping
Statistical Machine Learning for Astronomy -- A Textbook
A Simple Approximate Bayesian Inference Neural Surrogate for Stochastic Petri Net Models
Scalable Bayesian Low-Rank Adaptation of Large Language Models via Stochastic Variational Subspace Inference
Generative Diffusion Receivers: Achieving Pilot-Efficient MIMO-OFDM Communications
Variational Inference with Mixtures of Isotropic Gaussians
토론
이 논문과 연결된 포럼 글이 아직 없습니다.