arXiv subjects

Robert Kohn

Publications and source records attributed to Robert Kohn.

85 records · Page 5Linked to original sources

arXiv2013

A Bayesian changepoint methodology for high dimensional multivariate time series and space-time data: A study of structural change using remotely sensed data

A Bayesian approach is developed to analyze change points in multivariate time series and space-time data. The methodology is used to assess the impact of extended inundation on the ecosystem of the Gulf Plains bioregion in northern Australia. The proposed approach can be implemented for dynamic mixture models that have a conditionally Gaussian state space representation. Details are given on how to efficiently implement the algorithm for a general class of multivariate time series and space-time models. This efficient implementation makes it feasible to analyze high dimensional, but of realistic size, space-time data sets because our approach can be appreciably faster, possibly millions of times, than a standard implementation in such cases.

stat.ME↗

arXiv2013

Copula-type Estimators for Flexible Multivariate Density Modeling using Mixtures

Copulas are popular as models for multivariate dependence because they allow the marginal densities and the joint dependence to be modeled separately. However, they usually require that the transformation from uniform marginals to the marginals of the joint dependence structure is known. This can only be done for a restricted set of copulas, e.g. a normal copula. Our article introduces copula-type estimators for flexible multivariate density estimation which also allow the marginal densities to be modeled separately from the joint dependence, as in copula modeling, but overcomes the lack of flexibility of most popular copula estimators. An iterative scheme is proposed for estimating copula-type estimators and its usefulness is demonstrated through simulation and real examples. The joint dependence is is modeled by mixture of normals and mixture of normals factor analyzers models, and mixture of t and mixture of t factor analyzers models. We develop efficient Variational Bayes algorithms for fitting these in which model selection is performed automatically. Based on these mixture models, we construct four classes of copula-type densities which are far more flexible than current popular copula densities, and outperform them in simulation and several real data sets.

stat.ME↗

arXiv2012

A Copula Based Bayesian Approach for Paid-Incurred Claims Models for Non-Life Insurance Reserving

Our article considers the class of recently developed stochastic models that combine claims payments and incurred losses information into a coherent reserving methodology. In particular, we develop a family of Heirarchical Bayesian Paid-Incurred-Claims models, combining the claims reserving models of Hertig et al. (1985) and Gogol et al. (1993). In the process we extend the independent log-normal model of Merz et al. (2010) by incorporating different dependence structures using a Data-Augmented mixture Copula Paid-Incurred claims model. The utility and influence of incorporating both payment and incurred losses into estimating of the full predictive distribution of the outstanding loss liabilities and the resulting reserves is demonstrated in the following cases: (i) an independent payment (P) data model; (ii) the independent Payment-Incurred Claims (PIC) data model of Merz et al. (2010); (iii) a novel dependent lag-year telescoping block diagonal Gaussian Copula PIC data model incorporating conjugacy via transformation; (iv) a novel data-augmented mixture Archimedean copula dependent PIC data model. Inference in such models is developed via a class of adaptive Markov chain Monte Carlo sampling algorithms. These incorporate a data-augmentation framework utilized to efficiently evaluate the likelihood for the copula based PIC model in the loss reserving triangles. The adaptation strategy is based on representing a positive definite covariance matrix by the exponential of a symmetric matrix as proposed by Leonard et al. (1992).

q-fin.RM↗

arXiv2012

Bayesian inference for nonlinear structural time series models

This article discusses a partially adapted particle filter for estimating the likelihood of a nonlinear structural econometric state space models whose state transition density cannot be expressed in closed form. The filter generates the disturbances in the state transition equation and allows for multiple modes in the conditional disturbance distribution. The particle filter produces an unbiased estimate of the likelihood and so can be used to carry out Bayesian inference in a particle Markov chain Monte Carlo framework. We show empirically that when the signal to noise ratio is high, the new filter can be much more efficient than the standard particle filter, in the sense that it requires far fewer particles to give the same accuracy. The new filter is applied to several simulated and real examples and in particular to a dynamic stochastic general equilibrium model.

stat.ME↗

arXiv2011

A flexible observed factor model with separate dynamics for the factor volatilities and their correlation matrix

Our article considers a regression model with observed factors. The observed factors have a flexible stochastic volatility structure that has separate dynamics for the volatilities and the correlation matrix. The correlation matrix of the factors is time-varying and its evolution is described by an inverse Wishart process. The model specifies the evolution of the observed volatilities flexibly and is particularly attractive when the dimension of the observations is high. A Markov chain Monte Carlo algorithm is developed to estimate the model. It is straightforward to use this algorithm to obtain the predictive distributions of future observations and to carry out model selection. The model is illustrated and compared to other Wishart-type factor multivariate stochastic volatility models using various empirical data including monthly stock returns and portfolio weighted returns. The evidence suggests that our model has better predictive performance. The paper also allows the idiosyncratic errors to follow individual stochastic volatility processes in order to deal with more volatile data such as daily or weekly stock returns.

stat.OT↗

arXiv2010

Auxiliary Particle filtering within adaptive Metropolis-Hastings Sampling

Our article deals with Bayesian inference for a general state space model with the simulated likelihood computed by the particle filter. We show empirically that the partially or fully adapted particle filters can be much more efficient than the standard particle, especially when the signal to noise ratio is high. This is especially important because using the particle filter within MCMC sampling is O(T^2), where T is the sample size. We also show that an adaptive independent proposal for the unknown parameters based on a mixture of normals can be much more efficient than the usual optimal random walk methods because the simulated likelihood is not continuous in the parameters and the cost of constructing a good adaptive proposal is negligible compared to the cost of evaluating the simulated likelihood. Independent \MH proposals are also attractive because they are easy to run in parallel on multiple processors. The article also shows that the proposed \aimh sampler converges to the posterior distribution. We also show that the marginal likelihood of any state space model can be obtained in an efficient and unbiased manner by using the \pf making model comparison straightforward. Obtaining the marginal likelihood is often difficult using other methods. Finally, we prove that the simulated likelihood obtained by the auxiliary particle filter is unbiased. This result is fundamental to using the particle for MCMC sampling and is first obtained in a more abstract and difficult setting by Del Moral (2004). However, our proof is direct and will make the result accessible to readers.

stat.ME↗

arXiv2010

A copula based approach to adaptive sampling

Our article is concerned with adaptive sampling schemes for Bayesian inference that update the proposal densities using previous iterates. We introduce a copula based proposal density which is made more efficient by combining it with antithetic variable sampling. We compare the copula based proposal to an adaptive proposal density based on a multivariate mixture of normals and an adaptive random walk Metropolis proposal. We also introduce a refinement of the random walk proposal which performs better for multimodal target distributions. We compare the sampling schemes using challenging but realistic models and priors applied to real data examples. The results show that for the examples studied, the adaptive independent \MH{} proposals are much more efficient than the adaptive random walk proposals and that in general the copula based proposal has the best acceptance rates and lowest inefficiencies.

stat.ME↗

arXiv2010

Computationally Efficient Estimation of Factor Multivariate Stochastic Volatility Models

An MCMC simulation method based on a two stage delayed rejection Metropolis-Hastings algorithm is proposed to estimate a factor multivariate stochastic volatility model. The first stage uses kstep iteration towards the mode, with k small, and the second stage uses an adaptive random walk proposal density. The marginal likelihood approach of Chib (1995) is used to choose the number of factors, with the posterior density ordinates approximated by Gaussian copula. Simulation and real data applications suggest that the proposed simulation method is computationally much more efficient than the approach of Chib. Nardari and Shephard (2006}. This increase in computational efficiency is particularly important in calculating marginal likelihoods because it is necessary to carry out the simulation a number of times to estimate the posterior ordinates for a given marginal likelihood. In addition to the MCMC method, the paper also proposes a fast approximate EM method to estimate the factor multivariate stochastic volatility model. The estimates from the approximate EM method are of interest in their own right, but are especially useful as initial inputs to MCMC methods, making them more efficient computationally. The methodology is illustrated using simulated and real examples.

stat.CO↗

arXiv2009

Particle filtering within adaptive Metropolis Hastings sampling

We show that it is feasible to carry out exact Bayesian inference for non-Gaussian state space models using an adaptive Metropolis Hastings sampling scheme with the likelihood approximated by the particle filter. Furthermore, an adapyive independent Metropolis Hastings sampler based on a mixture of normals proposal is computationally much more efficient than an adaptive random walk proposal because the cost of constructing a good adaptive proposal is negligible compared to the cost of approximating the likelihood. Independent Metropolis Hastings proposals are also attractive because they are easy to run in parallel on multiple processors. We also show that when the particle filter is used, the marginal likelihood of any model is obtained in an efficient and unbiased manner, making model comparison straightforward.

stat.CO↗

arXiv2009

Flexible Multivariate Density Estimation with Marginal Adaptation

Our article addresses the problem of flexibly estimating a multivariate density while also attempting to estimate its marginals correctly. We do so by proposing two new estimators that try to capture the best features of mixture of normals and copula estimators while avoiding some of their weaknesses. The first estimator we propose is a mixture of normals copula model that is a flexible alternative to parametric copula models such as the normal and t copula. The second is a marginally adapted mixture of normals estimator that improves on the standard mixture of normals by using information contained in univariate estimates of the marginal densities. We show empirically that copula based approaches can behave much better or much worse than estimators based on mixture of normals depending on the properties of the data. We provide fast and reliable implementations of the estimators and illustrate the methodology on simulated and real data.

stat.ME↗

arXiv2007

Locally Adaptive Nonparametric Binary Regression

A nonparametric and locally adaptive Bayesian estimator is proposed for estimating a binary regression. Flexibility is obtained by modeling the binary regression as a mixture of probit regressions with the argument of each probit regression having a thin plate spline prior with its own smoothing parameter and with the mixture weights depending on the covariates. The estimator is compared to a single spline estimator and to a recently proposed locally adaptive estimator. The methodology is illustrated by applying it to both simulated and real examples.

stat.ME↗

arXiv2007

Variable Selection and Model Averaging in Semiparametric Overdispersed Generalized Linear Models

We express the mean and variance terms in a double exponential regression model as additive functions of the predictors and use Bayesian variable selection to determine which predictors enter the model, and whether they enter linearly or flexibly. When the variance term is null we obtain a generalized additive model, which becomes a generalized linear model if the predictors enter the mean linearly. The model is estimated using Markov chain Monte Carlo simulation and the methodology is illustrated using real and simulated data sets.

stat.ME↗

arXiv2007

Bayesian Covariance Matrix Estimation using a Mixture of Decomposable Graphical Models

A Bayesian approach is used to estimate the covariance matrix of Gaussian data. Ideas from Gaussian graphical models and model selection are used to construct a prior for the covariance matrix that is a mixture over all decomposable graphs. For this prior the probability of each graph size is specified by the user and graphs of equal size are assigned equal probability. Most previous approaches assume that all graphs are equally probable. We show empirically that the prior that assigns equal probability over graph sizes outperforms the prior that assigns equal probability over all graphs, both in identifying the correct decomposable graph and in more efficiently estimating the covariance matrix.

stat.ME↗