1,308 research outputs found
Monotonicity preserving approximation of multivariate scattered data
This paper describes a new method of monotone interpolation and smoothing of multivariate scattered data. It is based on the assumption that the function to be approximated is Lipschitz continuous. The method provides the optimal approximation in the worst case scenario and tight error bounds. Smoothing of noisy data subject to monotonicity constraints is converted into a quadratic programming problem. Estimation of the unknown Lipschitz constant from the data by sample splitting and cross-validation is described. Extension of the method for locally Lipschitz functions is presented.<br /
Recommended from our members
Modelling the joint distribution of competing risks survival times using copula functions
The problem of modelling the joint distribution of survival times in a competing risks model, using copula functions is considered. In order to evaluate this joint distribution and the related overall survival function, a system of non-linear differential equations is solved, which relates the crude and net survival functions of the modelled competing risks, through the copula. A similar approach to modelling dependent multiple decrements was applied by Carriere (1994) who used a Gaussian copula applied to an incomplete double decrement model which makes it difficult to calculate any actuarial functions and draw relevant conclusions. Here, we extend this methodology by studying the effect of complete and partial elimination of up to four competing risks on the overall survival function, the life expectancy and life annuity values. We further investigate how different choices of the copula function affect the resulting joint distribution of survival times and in particular the actuarial functions which are of importance in pricing life insurance and annuity products. For illustrative purposes, we have used a real data set and used extrapolation to prepare a complete multiple decrement model up to age 120. Extensive numerical results illustrate the sensitivity of the model with respect to the choice ofcopula and its parameter(s)
Solving Dynamic Discrete Choice Models Using Smoothing and Sieve Methods
We propose to combine smoothing, simulations and sieve approximations to
solve for either the integrated or expected value function in a general class
of dynamic discrete choice (DDC) models. We use importance sampling to
approximate the Bellman operators defining the two functions. The random
Bellman operators, and therefore also the corresponding solutions, are
generally non-smooth which is undesirable. To circumvent this issue, we
introduce a smoothed version of the random Bellman operator and solve for the
corresponding smoothed value function using sieve methods. We show that one can
avoid using sieves by generalizing and adapting the `self-approximating' method
of Rust (1997) to our setting. We provide an asymptotic theory for the
approximate solutions and show that they converge with root-N-rate, where
is number of Monte Carlo draws, towards Gaussian processes. We examine their
performance in practice through a set of numerical experiments and find that
both methods perform well with the sieve method being particularly attractive
in terms of computational speed and accuracy
Estimating the Distribution of Random Parameters in a Diffusion Equation Forward Model for a Transdermal Alcohol Biosensor
We estimate the distribution of random parameters in a distributed parameter
model with unbounded input and output for the transdermal transport of ethanol
in humans. The model takes the form of a diffusion equation with the input
being the blood alcohol concentration and the output being the transdermal
alcohol concentration. Our approach is based on the idea of reformulating the
underlying dynamical system in such a way that the random parameters are now
treated as additional space variables. When the distribution to be estimated is
assumed to be defined in terms of a joint density, estimating the distribution
is equivalent to estimating the diffusivity in a multi-dimensional diffusion
equation and thus well-established finite dimensional approximation schemes,
functional analytic based convergence arguments, optimization techniques, and
computational methods may all be employed. We use our technique to estimate a
bivariate normal distribution based on data for multiple drinking episodes from
a single subject.Comment: 10 page
B-spline techniques for volatility modeling
This paper is devoted to the application of B-splines to volatility modeling,
specifically the calibration of the leverage function in stochastic local
volatility models and the parameterization of an arbitrage-free implied
volatility surface calibrated to sparse option data. We use an extension of
classical B-splines obtained by including basis functions with infinite
support. We first come back to the application of shape-constrained B-splines
to the estimation of conditional expectations, not merely from a scatter plot
but also from the given marginal distributions. An application is the Monte
Carlo calibration of stochastic local volatility models by Markov projection.
Then we present a new technique for the calibration of an implied volatility
surface to sparse option data. We use a B-spline parameterization of the
Radon-Nikodym derivative of the underlying's risk-neutral probability density
with respect to a roughly calibrated base model. We show that this method
provides smooth arbitrage-free implied volatility surfaces. Finally, we sketch
a Galerkin method with B-spline finite elements to the solution of the partial
differential equation satisfied by the Radon-Nikodym derivative.Comment: 25 page
Shape preserving approximation using least squares splines
Least squares polynomial splines are an effective tool for data fitting, but they may fail to preserve essential properties of the underlying function, such as monotonicity or convexity. The shape restrictions are translated into linear inequality conditions on spline coefficients. The basis functions are selected in such a way that these conditions take a simple form, and the problem becomes non-negative least squares problem, for which effecitive and robust methods of solution exist. Multidimensional monotone approximation is achieved by using tensor-product splines with the appropriate restrictions. Additional inter polation conditions can also be introduced. The conversion formulas to traditional B-spline representation are provided. <br /
- …