paper-with-me

Papers

Orbital MCMC

2020-10-15 · Kirill Neklyudov, Max Welling

Markov Chain Monte Carlo (MCMC) algorithms ubiquitously employ complex deterministic transformations to generate proposal points that are then filtered by the Metropolis-Hastings-Green (MHG) test. However, the condition of the target measure invariance puts restrictions on the design of these transformations. In this paper, we first derive the acceptance test for the stochastic Markov kernel considering arbitrary deterministic maps as proposal generators. When applied to the transformations with orbits of period two (involutions), the test reduces to the MHG test. Based on the derived test we propose two practical algorithms: one operates by constructing periodic orbits from any diffeomorphism, another on contractions of the state space (such as optimization trajectories). Finally, we perform an empirical study demonstrating the practical advantages of both kernels.

📄 PDF Abstract BibTeX arXiv:2010.08047

Code (1)

necludov/oMCMC 공식 구현 pytorch

Similar Papers 제목 키워드 기반

Block-Value Symmetries in Probabilistic Graphical Models

2018-07-02 · Gagan Madan, Ankit Anand, Mausam, Parag Singla

One popular way for lifted inference in probabilistic graphical models is to first merge symmetric states into a single cluster (orbit) and then use these for downstream inference, via variations of orbital MCMC [Niepert…

Estimating Orbital Parameters of Direct Imaging Exoplanet Using Neural Network

2025-10-20 · Bo Liang, Hanlin Song, Chang Liu, Tianyu Zhao 외 arxiv

In this work, we propose a flow-matching Markov chain Monte Carlo (FM-MCMC) algorithm for estimating the orbital parameters of exoplanetary systems, especially for those only one exoplanet is involved. Compared to tradit…

Markov Chains on Orbits of Permutation Groups

2014-08-09 · Mathias Niepert

We present a novel approach to detecting and utilizing symmetries in probabilistic graphical models with two main contributions. First, we present a scalable approach to computing generating sets of permutation groups re…

DeepTTV: Deep Learning Prediction of Hidden Exoplanet From Transit Timing Variations

2024-09-06 · Chen Chen, Lingkai Kong, Gongjie Li, Molei Tao

Transit timing variation (TTV) provides rich information about the mass and orbital properties of exoplanets, which are often obtained by solving an inverse problem via Markov Chain Monte Carlo (MCMC). In this paper, we …

An Ontological Architecture for Orbital Debris Data

2017-04-01 · Robert J. Rovetto

The orbital debris problem presents an opportunity for inter-agency and international cooperation toward the mutually beneficial goals of debris prevention, mitigation, remediation, and improved space situational awarene…