English
Related papers

Related papers: Calculation of orthant probabilities by the holono…

200 papers

We use the holonomic gradient method to evaluate the probability content of a simplex region under a multivariate normal distribution. This probability equals to the integral of the probability density function of the multivariate Gaussian…

Statistics Theory · Mathematics 2020-03-04 Tamio Koyama

The holonomic gradient method gives an algorithm to efficiently and accurately evaluate normalizing constants and their derivatives. We apply the holonomic gradient method in the case of the conditional Poisson or multinomial distribution…

Classical Analysis and ODEs · Mathematics 2020-12-30 Yoshihito Tachibana , Yoshiaki Goto , Tamio Koyama , Nobuki Takayama

In this paper we implement the holonomic gradient method to exactly compute the normalising constant of Bingham distributions. This idea is originally applied for general Fisher-Bingham distributions in Nakayama et al. (2011). In this paper…

Computation · Statistics 2013-05-01 Tomonari Sei , Alfred Kume

Definite integrals with parameters of holonomic functions satisfy holonomic systems of linear partial differential equations. When we restrict parameters to a one dimensional curve, the system becomes a linear ordinary differential equation…

Numerical Analysis · Mathematics 2026-04-10 Nobuki Takayama , Takaharu Yaguchi , Yi Zhang

We calculate bounds for orthant probabilities for the equicorrelated multivariate normal distribution and use these bounds to show the following: for degree $k>4$, the probability that a $k$-homogeneous polynomial in $n$ variables attains a…

Probability · Mathematics 2020-04-10 Damián Pinasco , Ezequiel Smucler , Ignacio Zalduendo

Orthogonal polynomials are of fundamental importance in many fields of mathematics and science, therefore the study of a particular family is always relevant. In this manuscript, we present a survey of some general results of the Hermite…

Numerical Analysis · Mathematics 2020-02-18 Keith Y. Patarroyo

The computation of Gaussian orthant probabilities has been extensively studied for low-dimensional vectors. Here, we focus on the high-dimensional case and we present a two-step procedure relying on both deterministic and stochastic…

Methodology · Statistics 2018-12-03 Dario Azzimonti , David Ginsbourger

We apply the holonomic gradient method introduced by Nakayama et al.(2011) to the evaluation of the exact distribution function of the largest root of a Wishart matrix, which involves a hypergeometric function 1F1 of a matrix argument.…

Statistics Theory · Mathematics 2013-04-15 Hiroki Hashiguchi , Yasuhide Numata , Nobuki Takayama , Akimichi Takemura

We apply the holonomic gradient method to compute the distribution function of a weighted sum of independent noncentral chi-square random variables. It is the distribution function of the squared length of a multivariate normal random…

Statistics Theory · Mathematics 2015-09-01 Tamio Koyama , Akimichi Takemura

We give a bijection between a quotient space of the parameters and the space of moments for any $A$-hypergeometric distribution. An algorithmic method to compute the inverse image of the map is proposed utilizing the holonomic gradient…

Classical Analysis and ODEs · Mathematics 2015-11-13 Nobuki Takayama , Satoshi Kuriki , Akimichi Takemura

We study holonomic gradient decent for maximum likelihood estimation of exponential-polynomial distribution, whose density is the exponential function of a polynomial in the random variable. We first consider the case that the support of…

Statistics Theory · Mathematics 2014-09-17 Jumpei Hayakawa , Akimichi Takemura

We use the Legendre polynomials and the Hermite polynomials as two examples to illustrate a simple and systematic technique on deriving asymptotic formulas for orthogonal polynomials via recurrence relations. Another application of this…

Classical Analysis and ODEs · Mathematics 2011-01-25 X. -S. Wang , R. Wong

We show that various identities from [1] and [3] involving Gould-Hopper polynomials can be deduced from the real but also complex orthogonal invariance of multivariate Gaussian distributions. We also deduce from this principle a useful…

Probability · Mathematics 2011-03-29 O. Lévêque , C. Vignat

Natural gradient methods have been used to optimise the parameters of probability distributions in a variety of settings, often resulting in fast-converging procedures. Unfortunately, for many distributions of interest, computing the…

Machine Learning · Statistics 2024-05-28 Jonathan So , Richard E. Turner

We study the computation of Gaussian orthant probabilities, i.e. the probability that a Gaussian falls inside a quadrant. The Geweke-Hajivassiliou-Keane (GHK) algorithm [Genz, 1992; Geweke, 1991; Hajivassiliou et al., 1996; Keane, 1993], is…

Computation · Statistics 2014-11-26 James Ridgway

We adapt the rectangular splitting technique of Paterson and Stockmeyer to the problem of evaluating terms in holonomic sequences that depend on a parameter. This approach allows computing the $n$-th term in a recurrent sequence of suitable…

Symbolic Computation · Computer Science 2013-10-15 Fredrik Johansson

Hamiltonian Monte Carlo (HMC) sampling methods provide a mechanism for defining distant proposals with high acceptance probabilities in a Metropolis-Hastings framework, enabling more efficient exploration of the state space than standard…

Methodology · Statistics 2014-05-13 Tianqi Chen , Emily B. Fox , Carlos Guestrin

The new method for obtaining a variety of extensions of Hermite polynomials is given. As a first example a family of orthogonal polynomial systems which includes the generalized Hermite polynomials is considered. Apparently, either these…

Quantum Algebra · Mathematics 2007-05-23 Vadim V. Borzov

In this paper we describe various applications of the Riemann-Hilbert method to the theory of orthogonal polynomials on the line and on the circle.

Classical Analysis and ODEs · Mathematics 2007-05-23 Percy Deift

By holonomic guessing, we denote the process of finding a linear differential equation with polynomial coefficients satisfied by the generating function of a sequence, for which only a few first terms are known. Holonomic guessing has been…

Symbolic Computation · Computer Science 2022-07-05 Bertrand Teguia Tabuguia
‹ Prev 1 2 3 10 Next ›