Related papers: Hierarchical Markovian algorithm in QCD evolution
Markov chain Monte Carlo (MCMC) algorithms offer various strategies for sampling; the Hamiltonian Monte Carlo (HMC) family of samplers are MCMC algorithms which often exhibit improved mixing properties. The recently introduced magnetic HMC,…
Traditional Markov Chain Monte Carlo methods suffer from low acceptance rate, slow mixing and low efficiency in high dimensions. Hamiltonian Monte Carlo resolves this issue by avoiding the random walk. Hamiltonian Monte Carlo (HMC) is a…
We characterize a class of Markovian dynamics using the concept of divisible dynamical map. Moreover we provide a family of criteria which can distinguish Markovian and non-Markovian dynamics. These Markovianity criteria are based on a…
The hybrid Monte Carlo (HMC) algorithm is used for Bayesian analysis of the generalized autoregressive conditional heteroscedasticity (GARCH) model. The HMC algorithm is one of Markov chain Monte Carlo (MCMC) algorithms and it updates all…
In most sampling algorithms, including Hamiltonian Monte Carlo, transition rates between states correspond to the probability of making a transition in a single time step, and are constrained to be less than or equal to 1. We derive a…
Due to its constrained support, the Dirichlet distribution is uniquely suited to many applications. The constraints that make it powerful, however, can also hinder practical implementations, particularly those utilizing Markov Chain Monte…
Markov chain Monte Carlo (MCMC) algorithms have long been the main workhorses of Bayesian inference. Among them, Hamiltonian Monte Carlo (HMC) has recently become very popular due to its efficiency resulting from effective use of the…
General birth-and-death as well as hopping stochastic dynamics of infinite particle systems in the continuum are considered. We derive corresponding evolution equations for correlation functions and generating functionals. General…
We develop a quadratic regularization approach for the solution of high-dimensional multistage stochastic optimization problems characterized by a potentially large number of time periods/stages (e.g. hundreds), a high-dimensional resource…
We suggest a new procedure for extrapolating the parton distributions from HERA to much higher energies. The procedure suggested consists of two steps. First, we solve the non-linear evolution equation. Second, we introduce a correcting…
Markov chain Monte Carlo (MCMC) algorithms provide a very general recipe for estimating properties of complicated distributions. While their use has become commonplace and there is a large literature on MCMC theory and practice, MCMC users…
Solving realistic quantum systems coupled to an environment is a challenging task. Here we develop a hierarchical functional derivative (HFD) approach for efficiently solving the non-Markovian quantum trajectories of an open quantum system…
Dynamically rescaled Hamiltonian Monte Carlo (DRHMC) is introduced as a computationally fast and easily implemented method for performing full Bayesian analysis in hierarchical statistical models. The method relies on introducing a modified…
The next-to-leading order (NLO) evolution of the parton distribution functions (PDFs) in QCD is a common tool in the lepton-hadron and hadron-hadron collider data analysis. The standard NLO DGLAP evolution is formulated for inclusive…
Hamiltonian Monte Carlo (HMC) is a powerful Markov chain Monte Carlo (MCMC) method for performing approximate inference in complex probabilistic models of continuous variables. In common with many MCMC methods, however, the standard HMC…
Hamiltonian Monte Carlo (HMC) has been progressively incorporated within the statistician's toolbox as an alternative sampling method in settings when standard Metropolis-Hastings is inefficient. HMC generates a Markov chain on an augmented…
This work introduces structure preserving hierarchical decompositions for sampling Gaussian random fields (GRF) within the context of multilevel Bayesian inference in high-dimensional space. Existing scalable hierarchical sampling methods,…
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled by evolutionary algorithms that use a representation which…
Sampling from hierarchical Bayesian models is often difficult for MCMC methods, because of the strong correlations between the model parameters and the hyperparameters. Recent Riemannian manifold Hamiltonian Monte Carlo (RMHMC) methods have…
Using a recursive algorithm to solve the renormalization group equations of N=1 QCD (DGLAP), we describe the most general supersymmetric evolution of the parton distributions. The analysis involves the regular DGLAP evolution, a partial…