Finite Gaussian Mixture Approximations to Analytically Intractable Density Kernels

Natalia Khorunzhina, Jean-Francois Richard

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

Resumé

The objective of the paper is that of constructing finite Gaussian mixture approximations to analytically intractable density kernels. The proposed method is adaptive in that terms are added one at the time and the mixture is fully re-optimized at each step using a distance measure that approximates the corresponding importance sampling variance. All functions of interest are evaluated under Gaussian product rules. Since product rules suffer from an obvious curse of dimensionality, the proposed algorithm as presented is only applicable to models whose non-linear and/or non-Gaussian subspace is of dimension up to three. Extensions to higher-dimensional applications would require the use of sparse grids, as discussed in the paper. Examples include a sequential (filtering) evaluation of the likelihood function of a stochastic volatility model where all relevant densities (filtering, predictive and likelihood) are closely approximated by mixtures.
The objective of the paper is that of constructing finite Gaussian mixture approximations to analytically intractable density kernels. The proposed method is adaptive in that terms are added one at the time and the mixture is fully re-optimized at each step using a distance measure that approximates the corresponding importance sampling variance. All functions of interest are evaluated under Gaussian product rules. Since product rules suffer from an obvious curse of dimensionality, the proposed algorithm as presented is only applicable to models whose non-linear and/or non-Gaussian subspace is of dimension up to three. Extensions to higher-dimensional applications would require the use of sparse grids, as discussed in the paper. Examples include a sequential (filtering) evaluation of the likelihood function of a stochastic volatility model where all relevant densities (filtering, predictive and likelihood) are closely approximated by mixtures.
SprogEngelsk
TidsskriftComputational Economics
Vol/bind53
Udgave nummer3
Sider991-1017
Antal sider27
ISSN0927-7099
DOI
StatusUdgivet - mar. 2019

Emneord

  • Finite mixture
  • Distance measure
  • Gaussian quadrature
  • Importance sampling
  • Adaptive algorithm
  • Stochastic volatility
  • Density kernel

Citer dette

@article{543632a8c23f4bbea61f432016993b63,
title = "Finite Gaussian Mixture Approximations to Analytically Intractable Density Kernels",
abstract = "The objective of the paper is that of constructing finite Gaussian mixture approximations to analytically intractable density kernels. The proposed method is adaptive in that terms are added one at the time and the mixture is fully re-optimized at each step using a distance measure that approximates the corresponding importance sampling variance. All functions of interest are evaluated under Gaussian product rules. Since product rules suffer from an obvious curse of dimensionality, the proposed algorithm as presented is only applicable to models whose non-linear and/or non-Gaussian subspace is of dimension up to three. Extensions to higher-dimensional applications would require the use of sparse grids, as discussed in the paper. Examples include a sequential (filtering) evaluation of the likelihood function of a stochastic volatility model where all relevant densities (filtering, predictive and likelihood) are closely approximated by mixtures.",
keywords = "Finite mixture, Distance measure, Gaussian quadrature, Importance sampling, Adaptive algorithm, Stochastic volatility, Density kernel, Finite mixture, Distance measure, Gaussian quadrature, Importance sampling, Adaptive algorithm, Stochastic volatility, Density kernel",
author = "Natalia Khorunzhina and Jean-Francois Richard",
year = "2019",
month = "3",
doi = "10.1007/s10614-017-9777-2",
language = "English",
volume = "53",
pages = "991--1017",
journal = "Computational Economics",
issn = "0927-7099",
publisher = "Springer",
number = "3",

}

Finite Gaussian Mixture Approximations to Analytically Intractable Density Kernels. / Khorunzhina, Natalia; Richard, Jean-Francois.

I: Computational Economics, Bind 53, Nr. 3, 03.2019, s. 991-1017.

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

TY - JOUR

T1 - Finite Gaussian Mixture Approximations to Analytically Intractable Density Kernels

AU - Khorunzhina,Natalia

AU - Richard,Jean-Francois

PY - 2019/3

Y1 - 2019/3

N2 - The objective of the paper is that of constructing finite Gaussian mixture approximations to analytically intractable density kernels. The proposed method is adaptive in that terms are added one at the time and the mixture is fully re-optimized at each step using a distance measure that approximates the corresponding importance sampling variance. All functions of interest are evaluated under Gaussian product rules. Since product rules suffer from an obvious curse of dimensionality, the proposed algorithm as presented is only applicable to models whose non-linear and/or non-Gaussian subspace is of dimension up to three. Extensions to higher-dimensional applications would require the use of sparse grids, as discussed in the paper. Examples include a sequential (filtering) evaluation of the likelihood function of a stochastic volatility model where all relevant densities (filtering, predictive and likelihood) are closely approximated by mixtures.

AB - The objective of the paper is that of constructing finite Gaussian mixture approximations to analytically intractable density kernels. The proposed method is adaptive in that terms are added one at the time and the mixture is fully re-optimized at each step using a distance measure that approximates the corresponding importance sampling variance. All functions of interest are evaluated under Gaussian product rules. Since product rules suffer from an obvious curse of dimensionality, the proposed algorithm as presented is only applicable to models whose non-linear and/or non-Gaussian subspace is of dimension up to three. Extensions to higher-dimensional applications would require the use of sparse grids, as discussed in the paper. Examples include a sequential (filtering) evaluation of the likelihood function of a stochastic volatility model where all relevant densities (filtering, predictive and likelihood) are closely approximated by mixtures.

KW - Finite mixture

KW - Distance measure

KW - Gaussian quadrature

KW - Importance sampling

KW - Adaptive algorithm

KW - Stochastic volatility

KW - Density kernel

KW - Finite mixture

KW - Distance measure

KW - Gaussian quadrature

KW - Importance sampling

KW - Adaptive algorithm

KW - Stochastic volatility

KW - Density kernel

UR - https://sfx-45cbs.hosted.exlibrisgroup.com/45cbs?url_ver=Z39.88-2004&url_ctx_fmt=info:ofi/fmt:kev:mtx:ctx&ctx_enc=info:ofi/enc:UTF-8&ctx_ver=Z39.88-2004&rfr_id=info:sid/sfxit.com:azlist&sfx.ignore_date_threshold=1&rft.object_id=954927382296&rft.object_portfolio_id=&svc.holdings=yes&svc.fulltext=yes

U2 - 10.1007/s10614-017-9777-2

DO - 10.1007/s10614-017-9777-2

M3 - Journal article

VL - 53

SP - 991

EP - 1017

JO - Computational Economics

T2 - Computational Economics

JF - Computational Economics

SN - 0927-7099

IS - 3

ER -