Multimodal Bayesian registration of noisy functions using Hamiltonian Monte Carlo
نویسندگان
چکیده
Functional data registration is a necessary processing step for many applications. The observed can be inherently noisy, often due to measurement error or natural process uncertainty; which most functional alignment methods cannot handle. A pair of functions also have multiple optimal solutions, not addressed in current literature. In this paper, flexible Bayesian approach presented, appropriately accounts noise the without any pre-smoothing required. Additionally, by running parallel MCMC chains, method account alignments via multi-modal posterior distribution warping functions. To efficiently sample functions, relies on modification standard Hamiltonian Monte Carlo well-defined infinite-dimensional Hilbert space. This applied both simulated and real sets show its efficiency handling noisy successfully accounting posterior; characterizing uncertainty surrounding
منابع مشابه
Hamiltonian Monte Carlo Acceleration Using Neural Network Surrogate functions
Relatively high computational cost for Bayesian methods often limits their application for big data analysis. In recent years, there have been many attempts to improve computational efficiency of Bayesian inference. Here we propose an efficient and scalable computational technique for a state-of-the-art Markov Chain Monte Carlo (MCMC) methods, namely, Hamiltonian Monte Carlo (HMC). The key idea...
متن کاملMagnetic Hamiltonian Monte Carlo
Hamiltonian Monte Carlo (HMC) exploits Hamiltonian dynamics to construct efficient proposals for Markov chain Monte Carlo (MCMC). In this paper, we present a generalization of HMC which exploits non-canonical Hamiltonian dynamics. We refer to this algorithm as magnetic HMC, since in 3 dimensions a subset of the dynamics map onto the mechanics of a charged particle coupled to a magnetic field. W...
متن کاملWormhole Hamiltonian Monte Carlo
In machine learning and statistics, probabilistic inference involving multimodal distributions is quite difficult. This is especially true in high dimensional problems, where most existing algorithms cannot easily move from one mode to another. To address this issue, we propose a novel Bayesian inference approach based on Markov Chain Monte Carlo. Our method can effectively sample from multimod...
متن کاملSplit Hamiltonian Monte Carlo
We show how the Hamiltonian Monte Carlo algorithm can sometimes be speeded up by “splitting” the Hamiltonian in a way that allows much of the movement around the state space to be done at low computational cost. One context where this is possible is when the log density of the distribution of interest (the potential energy function) can be written as the log of a Gaussian density, which is a qu...
متن کاملMonte Carlo Hamiltonian
We construct an effective Hamiltonian via Monte Carlo from a given action. This Hamiltonian describes physics in the low energy regime. We test it by computing spectrum, wave functions and thermodynamical observables (average energy and specific heat) for the free system and the harmonic oscillator. The method is shown to work also for other local potentials. PACS index: o3.65.-w, 05.10.Ln ∗Cor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Statistics & Data Analysis
سال: 2021
ISSN: ['0167-9473', '1872-7352']
DOI: https://doi.org/10.1016/j.csda.2021.107298