Pricing Kernel Modeling

We propose a new method to estimate the empirical pricing kernel based on option data. We estimate the pricing kernel nonparametrically by using the ratio of the risk-neutral density estimator and the subjective density estimator. The risk-neutral density is approximated by a weighted kernel density estimator with varying unknown weights for different observations, and the subjective density is approximated by a kernel density estimator with equal weights. We represent the European call option price function by the second order integration of the risk-neutral density, so that the unknown weights are obtained through one-step penalized least squares estimation with the Kullback-Leibler divergence as the penalty function. Asymptotic results of the resulting estimators are established. The performance of the proposed method is illustrated empirically by simulation and real data application studies.

Recently Hazelton and Turlach (2009) proposed a weighted kernel density estimatorfor the deconvolution problem. In the case of Gaussian kernels and measurement er-ror, they argued that the weighted kernel density estimator is a competitive estimatorover the classical deconvolution kernel estimator. In this paper we consider weightedkernel density estimators when sample observations are contaminated by double expo-nentially distributed errors. The performance of the weighted kernel density estimatorsis compared over the classical deconvolution kernel estimator and the kernel density es-timator based on the support vector regression method by means of a simulation study.The weighted density estimator with the Gaussian kernel shows numerical instabilityin practical implementation of optimization function. However the weighted densityestimates with the double exponential kernel has very similar patterns to the classicalkernel density estimates in the simulations, but the shape is less satisfactory than theclassical kernel density estimator with the Gaussian kernel.Keywords: Deconvolution, kernel density estimator, support vector regression, weightedkernel density estimator.

This paper considers the problem of nonparametric deconvolution density estimation when sample observa-tions are contaminated by double exponentially distributed errors. Three different deconvolution density estima-tors are introduced: a weighted kernel density estimator, a kernel density estimator based on the support vector regression method in a RKHS, and a classical kernel density estimator. The performance of these deconvolution density estimators is compared by means of a simulation study.

Recently, Jewson and Rossell (2022) proposed a new approach for kernel density estimation using an exponentiated form of kernel density estimators. The density estimator contained two hyperparameters that flexibly controls the smoothness of the resulting density. We tune them in a data-driven manner by minimizing an objective function based on the Hyvärinen score to avoid the optimization involving the intractable normalizing constant caused by the exponentiation. We show the asymptotic properties of the proposed estimator and emphasize the importance of including the two hyperparameters for flexible density estimation. Our simulation studies and application to income data show that the proposed density estimator is promising when the underlying density is multi-modal or when observations contain outliers.

Pricing kernels implicit in option prices play a key role in assessing the risk aversion over equity returns. We deal with nonparametric estimation of the pricing kernel (Empirical Pricing Kernel) given by the ratio of the risk-neutral density estimator and the subjective density estimator. The former density can be represented as the second derivative w.r.t. the European call option price function, which we estimate by nonparametric regression. The subjective density is estimated nonparametrically too. In this framework, we develop the asymptotic distribution theory of the EPK in the L1 sense. Particularly, to evaluate the overall variation of the pricing kernel, we develop a uniform confidence band of the EPK. Furthermore, as an alternative to the asymptotic approach, we propose a bootstrap confidence band. The developed theory is helpful for testing parametric specifications of pricing kernels and has a direct extension to estimating risk aversion patterns. The established results are assessed and compared in a Monte-Carlo study. As a real application, we test risk aversion over time induced by the EPK.

Nonparametric estimation for a probability density function that describes multivariate data has typically been addressed by kernel density estimation (KDE). A novel density estimator recently developed by Farmer and Jacobs offers an alternative high-throughput automated approach to univariate nonparametric density estimation based on maximum entropy and order statistics, improving accuracy over univariate KDE. This article presents an extension of the single variable case to multiple variables. The univariate estimator is used to recursively calculate a product array of one-dimensional conditional probabilities. In combination with interpolation methods, a complete joint probability density estimate is generated for multiple variables. Good accuracy and speed performance in synthetic data are demonstrated by a numerical study using known distributions over a range of sample sizes from 100 to 106 for two to six variables. Performance in terms of speed and accuracy is compared to KDE. The multivariate density estimate developed here tends to perform better as the number of samples and/or variables increases. As an example application, measurements are analyzed over five filters of photometric data from the Sloan Digital Sky Survey Data Release 17. The multivariate estimation is used to form the basis for a binary classifier that distinguishes quasars from galaxies and stars with up to 94% accuracy.

ABSTRACTKernel density estimation has been applied in many computational subjects. In this paper, we propose a density estimation procedure from a Bayesian nonparametric perspective using Dirichlet process prior for the length-biased data under an unknown kernel function. In this situation, the kernel within the Dirichlet process mixture model will be approximated by the kernel density estimator. We present a Bayesian nonparametric method for finding the bandwidth parameter in the kernel density estimation using a Markov chain Monte Carlo approach. Then, this approach is used to the simulated and real data set. Finally, we compare the proposed bandwidth estimation with the other estimations like cross-validation and Bayes based on the mean integrated squared error criterion.

Probability density estimation is the problem of inferring an underlying probability from a sampling of points. This study introduces smoothDE, an algorithm that uses Bayesian Field Theory to optimize non-parametric density estimation. smoothDE deterministically finds an optimal density function based on the probability of observed data, subject to a smoothing constraint and its associated prior probability. smoothDE's predicted densities have almost universally lower Kullback-Leibler divergences from simulated Gaussian Mixtures densities when compared to similar Bayesian Field Theory methods and Kernel Density Estimators. smoothDE was even able to outperform a specialized Bayesian Gaussian Mixture density estimator at lower samplings. smoothDE's ability to quickly fit arbitrary densities allowed it to be used as a preprocessing step for classification algorithm, in certain cases boosting classifier performance.

This paper introduces an approach to select the bandwidth or smoothing parameter in multiresolution (MR) density estimation and nonparametric density estimation. It is based on the evolution of the second, third and fourth central moments and the shape of the estimated densities for different bandwidths and resolution levels. The proposed method has been applied to density estimation by means of multiresolution densities as well as kernel density estimation (MRDE and KDE respectively). The results of the simulations and the empirical application demonstrate that the level of resolution resulting from the moments method performs better with multimodal densities than the Bayesian Information Criterion (BIC) for multiresolution densities estimation and the plug-in for kernel densities estimation.

Kernel Density Estimators (KDEs) are a non-parametric density estimation technique that has recently been applied to Monte Carlo radiation transport simulations. Kernel density estimators are an alternative to histogram tallies for obtaining global solutions in Monte Carlo tallies. With KDEs, a single event, either a collision or particle track, can contribute to the score at multiple tally points with the uncertainty at those points being independent of the desired resolution of the solution. Thus, KDEs show potential for obtaining estimates of a global solution with reduced variance when compared to a histogram. Previously, KDEs have been applied to neutronics for one-group reactor physics problems and fixed source shielding applications. However, little work was done to obtain reaction rates using KDEs. This paper introduces a new form of the MFP KDE that is capable of handling general geometries. Furthermore, extending the MFP KDE to 2-D problems in continuous energy introduces inaccuracies to the solution. An ad-hoc solution to these inaccuracies is introduced that produces errors smaller than 4% at material interfaces.

In recent years a number of methods have been developed to infer implied state price densities (SPD) from cross sectional option prices, Chapter 7 and 8. Instead of comparing this density to a historical density extracted from the observed time series of the underlying asset prices, i.e. a risk neutral density to an actual density, Ait-Sahalia, Wang and Yared (2000) propose to compare two risk neutral densities, one obtained from cross sectional S&P 500 option data and the other from the S&P 500 index time series. Furthermore, they propose trading strategies designed to exploit differences in skewness and kurtosis of both densities. The goal of this article is to apply the procedure to the german DAX index. While the option implied SPD is estimated by means of the Barle and Cakici, Barle and Cakici (1998), implied binomial tree version, the time series density is inferred from the time series of the DAX index by applying a method used by Ait-Sahalia, Wang and Yared (2000). Based on the comparison of both SPDs the performance of skewness and kurtosis trades is investigated.

Composite spatial data on administrative area level are often presented by maps. The aim is to detect regional differences in the concentration of subpopulations, like elderly persons, ethnic minorities, low-educated persons, voters of a political party or persons with a certain disease. Thematic collections of such maps are presented in different atlases. The standard presentation is by Choropleth maps where each administrative unit is represented by a single value. These maps can be criticized under three aspects: the implicit assumption of a uniform distribution within the area, the instability of the resulting map with respect to a change of the reference area and the discontinuities of the maps at the borderlines of the reference areas which inhibit the detection of regional clusters.In order to address these problems we use a density approach in the construction of maps. This approach does not enforce a local uniform distribution. It does not depend on a specific choice of area reference system and there are no discontinuities in the displayed maps. A standard estimation procedure of densities are Kernel density estimates. However, these estimates need the geo-coordinates of the single units which are not at disposal as we have only access to the aggregates of some area system. To overcome this hurdle, we use a statistical simulation concept. This can be interpreted as a Simulated Expectation Maximisation (SEM) algorithm of Celeux et al (1996). We simulate observations from the current density estimates which are consistent with the aggregation information (S-step). Then we apply the Kernel density estimator to the simulated sample which gives the next density estimate (E-Step).This concept has been first applied for grid data with rectangular areas, see Groß et al (2017), for the display of ethnic minorities. In a second application we demonstrated the use of this approach for the so-called “change of support” (Bradley et al 2016) problem. Here Groß et al (2020) used the SEM algorithm to recalculate case numbers between non-hierarchical administrative area systems. Recently Rendtel et al (2021) applied the SEM algorithm to display spatial-temporal clusters of Corona infections in Germany.Here we present three modifications of the basic SEM algorithm: 1) We introduce a boundary correction which removes the underestimation of kernel density estimates at the borders of the population area. 2) We recognize unsettled areas, like lakes, parks and industrial areas, in the computation of the kernel density. 3) We adapt the SEM algorithm for the computation of local percentages which are important especially in voting analysis.We evaluate our approach against several standard maps by means of the local voting register with known addresses. In the empirical part we apply our approach for the display of voting results for the 2016 election of the Berlin parliament. We contrast our results against Choropleth maps and show new possibilities for reporting spatial voting results.

In this paper, we consider using nonparametric mixtures for density estimation. The mixture density estimation problem simply reduces to the problem of estimating a mixing distribution in the nonparametric mixture model. We focus on the least squares method for mixture density estimation problem. In a simulation experiment, the performance of the least squares mixture density estimator (MDE) and the kernel density estimator (KDE) is assessed by the mean integrated squared error. The performance improvement of MDE over KDE for some common densities is achieved by using cross-validation method for bandwidth selection.

Naïve Bayes (NB) Classifier is considered one of the most widely used algorithms to solve classification problems due to its simplicity, high performance and fast computational process, which assumes that feature variables are independent and continuous variables follow gaussian distribution. Due to that most real-life applications may have feature variables that can’t be modeled by gaussian distribution, or may violate the independence assumption, Flexible Naïve Bayes (FNB) Classifier becomes more suitable, which estimates the densities using a non-parametric Kernel Density Estimator (KDE). In this paper, we introduce K-Nearest Neighbor Naïve Bayes (KNNB) Classifier, an improved flexible classifier which uses K-Nearest Neighbor Density Estimator (KNNDE) instead of KDE, such classifier would solve both NB problems, where the independence assumption is removed and the likelihood density is estimated for all feature variables together. Practical applications using R programming language on datasets from different fields were made for both FNB and KNNB classifiers with and without the independence assumption using 10-folds repeated cross validation, despite that FNB achieved greater accuracy than KNNB when dealing with the feature variables separately, the results showed that KNNB classifier performs better than FNB when the independence assumption is removed, meaning that KNNB is more efficient and suitable than FNB in real-life applications, where the independence assumption can be dropped.

The issue of monitoring non-normally distributed data with principal component analysis (PCA) is addressed through the application of density estimation for evaluating the quality of the principal component scores. Although kernel density estimation has been previously cited as a method for monitoring such data, mixture models are proposed here in order to reduce model complexity and computational effort. Furthermore, several adaptation strategies for the density estimators are developed and suggestions are provided on their use. A rapid thermal anneal case study demonstrates how the estimators outperform the traditional Hotelling's T <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> statistic due to the presence of a first wafer effect.