• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 938
Next 10 →

ROBUST ADAPTIVE FILTERS USING STUDENT-T DISTRIBUTION

by Guang Deng
"... An important application of adaptive filters is in sys-tem identification. Robustness of the adaptive filters to impulsive noise has been studied. In this paper, we pro-pose an alternative way to developing robust adaptive filters. Our approach is based on formulating the prob-lem as a maximum penal ..."
Abstract - Add to MetaCart
penalized likelihood (MPL) prob-lem. We use student-t distribution to model the noise and a quadratic penalty function to play a regulariza-tion role. The minorization-maximization principle is used to solve the optimization problem. Based on the solution, we propose two LMS-type of algorithms called MPL

Original article Bayesian QTL mapping using skewed Student-t distributions

by Peter Von Rohr A, Ina Hoeschele A , 2001
"... Abstract – In most QTL mapping studies, phenotypes are assumed to follow normal distributions. Deviations from this assumption may lead to detection of false positive QTL. To improve the robustness of Bayesian QTL mapping methods, the normal distribution for residuals is replaced with a skewed Stude ..."
Abstract - Add to MetaCart
Student-t distribution. The latter distribution is able to account for both heavy tails and skewness, and both components are each controlled by a single parameter. The Bayesian QTL mapping method using a skewed Student-t distribution is evaluated with simulated data sets under five different scenarios

EFFICIENT ESTIMATION AND SIMULATION OF THE TRUNCATED MULTIVARIATE STUDENT-t DISTRIBUTION

by Zdravko I. Botev
"... We propose an exponential tilting method for exact simulation from the truncated multivariate student-t distribution in high dimensions as an alternative to approximate Markov Chain Monte Carlo sampling. The method also allows us to accurately estimate the probability that a random vector with multi ..."
Abstract - Add to MetaCart
We propose an exponential tilting method for exact simulation from the truncated multivariate student-t distribution in high dimensions as an alternative to approximate Markov Chain Monte Carlo sampling. The method also allows us to accurately estimate the probability that a random vector

Forecasting expected shortfall with a generalized asymmetric Student-t distribution

by Dongming Zhu, John W. Galbraith , 2009
"... Financial returns typically display heavy tails and some skewness, and conditional variance models with these features often outperform more limited models. The difference in performance may be espe-cially important in estimating quantities that depend on tail features, including risk measures such ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
such as the expected shortfall. Here, using a recent generalization of the asymmetric Student-t distribution to allow separate parameters to control skewness and the thickness of each tail, we fit daily financial returns and forecast expected shortfall for the S&P 500 index and a number of individual company

Efficient Simulation from the Multivariate Normal and Student-t Distributions Subject to Linear Constraints and the Evaluation of Constraint Probabilities

by John Geweke , 1991
"... The construction and implementation of a Gibbs sampler for efficient simulation from the truncated multivariate normal and Student-t distributions is described. It is shown how the accuracy and convergence of integrals based on the Gibbs sample may be constructed, and how an estimate of the probabil ..."
Abstract - Cited by 211 (10 self) - Add to MetaCart
The construction and implementation of a Gibbs sampler for efficient simulation from the truncated multivariate normal and Student-t distributions is described. It is shown how the accuracy and convergence of integrals based on the Gibbs sample may be constructed, and how an estimate

Adaptive Mixture of Student-t Distributions as a Flexible Candidate Distribution for Efficient Simulation: The R Package AdMit

by David Ardia, Lennart F. Hoogerheide, Herman K. Van Dijk
"... This introduction to the R package AdMit is a shorter version of Ardia et al. (2009), published in the Journal of Statistical Software. The package provides flexible functions to approximate a certain target distribution and to efficiently generate a sample of random draws from it, given only a kern ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
kernel of the target density function. The core algorithm consists of the function AdMit which fits an adaptive mixture of Student-t distributions to the density of interest. Then, importance sampling or the independence chain Metropolis-Hastings algorithm is used to obtain quantities of interest

Efficient Sampling Methods for Truncated Multivariate Normal and Student-t Distributions Subject to Linear Inequality Constraints

by Yifang Li, Sujit K. Ghosh
"... Sampling from a truncated multivariate normal distribution subject to multiple linear inequality constraints is a recurring problem in many areas in statistics and econometrics, such as the order restricted regressions, censored data models, and shape-restricted nonparametric regressions. However, t ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
the Gibbs sampler for sampling from a truncated multivariate normal distribution with convex polytope restriction regions. We also generalize the sampling method to truncated multivariate Student-t distributions. Empirical results 1 are presented to illustrate the superior performance of our proposed Gibbs

NEW METHODS FOR SIMULATING THE STUDENT T-DISTRIBUTION- DIRECT USE OF THE INVERSE CUMULATIVE DISTRIBUTION

by William T. Shaw
"... We explore the Student T-Distribution and present some new techniques for simulation. In particular, an explicit and accurate approximation for the inverse, F −1 n of the CDF, Fn, is presented, as well as some simple exact and iterative techniques for defining this function. The methods presented ar ..."
Abstract - Add to MetaCart
We explore the Student T-Distribution and present some new techniques for simulation. In particular, an explicit and accurate approximation for the inverse, F −1 n of the CDF, Fn, is presented, as well as some simple exact and iterative techniques for defining this function. The methods presented

AdMit: Adaptive Mixture of Student-t Distributions for Efficient Simulation in R, 2008. URL http:// CRAN.R-project.org/package=AdMit. R package version

by David Ardia, Lennart F. Hoogerheide, Herman K, Van Dijk
"... This note presents the package AdMit (Ardia et al., 2008, 2009), an R implementation of the adaptive mixture of Student-t distributions (AdMit) procedure developed by Hoogerheide (2006); see also ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
This note presents the package AdMit (Ardia et al., 2008, 2009), an R implementation of the adaptive mixture of Student-t distributions (AdMit) procedure developed by Hoogerheide (2006); see also

Linearization coefficients of Bessel polynomials and properties of Student t-distributions

by Christian Berg, Christophe Vignat - ORNSTEIN-UHLENBECK PROCESSES IN PHYSICS AND ENGINEERING WULFSOHN, AUBREY University of , 2006
"... We prove positivity results about linearization and connection coefficients for Bessel polynomials. The proof is based on a recursion formula and explicit formulas for the coefficients in special cases. The result implies that the distribution of a convex combination of independent Studentt random v ..."
Abstract - Cited by 6 (2 self) - Add to MetaCart
variables with arbitrary odd degrees of freedom has a density which is a convex combination of certain Student-t densities with odd degrees of freedom. 2000 Mathematics Subject Classification: primary 33C10; secondary 60E05
Next 10 →
Results 1 - 10 of 938
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University