34,385 research outputs found
Sequential Monte Carlo pricing of American-style options under stochastic volatility models
We introduce a new method to price American-style options on underlying
investments governed by stochastic volatility (SV) models. The method does not
require the volatility process to be observed. Instead, it exploits the fact
that the optimal decision functions in the corresponding dynamic programming
problem can be expressed as functions of conditional distributions of
volatility, given observed data. By constructing statistics summarizing
information about these conditional distributions, one can obtain high quality
approximate solutions. Although the required conditional distributions are in
general intractable, they can be arbitrarily precisely approximated using
sequential Monte Carlo schemes. The drawback, as with many Monte Carlo schemes,
is potentially heavy computational demand. We present two variants of the
algorithm, one closely related to the well-known least-squares Monte Carlo
algorithm of Longstaff and Schwartz [The Review of Financial Studies 14 (2001)
113-147], and the other solving the same problem using a "brute force" gridding
approach. We estimate an illustrative SV model using Markov chain Monte Carlo
(MCMC) methods for three equities. We also demonstrate the use of our algorithm
by estimating the posterior distribution of the market price of volatility risk
for each of the three equities.Comment: Published in at http://dx.doi.org/10.1214/09-AOAS286 the Annals of
Applied Statistics (http://www.imstat.org/aoas/) by the Institute of
Mathematical Statistics (http://www.imstat.org
Sequential Design for Ranking Response Surfaces
We propose and analyze sequential design methods for the problem of ranking
several response surfaces. Namely, given response surfaces over a
continuous input space , the aim is to efficiently find the index of
the minimal response across the entire . The response surfaces are not
known and have to be noisily sampled one-at-a-time. This setting is motivated
by stochastic control applications and requires joint experimental design both
in space and response-index dimensions. To generate sequential design
heuristics we investigate stepwise uncertainty reduction approaches, as well as
sampling based on posterior classification complexity. We also make connections
between our continuous-input formulation and the discrete framework of pure
regret in multi-armed bandits. To model the response surfaces we utilize
kriging surrogates. Several numerical examples using both synthetic data and an
epidemics control problem are provided to illustrate our approach and the
efficacy of respective adaptive designs.Comment: 26 pages, 7 figures (updated several sections and figures
Particle algorithms for optimization on binary spaces
We discuss a unified approach to stochastic optimization of pseudo-Boolean
objective functions based on particle methods, including the cross-entropy
method and simulated annealing as special cases. We point out the need for
auxiliary sampling distributions, that is parametric families on binary spaces,
which are able to reproduce complex dependency structures, and illustrate their
usefulness in our numerical experiments. We provide numerical evidence that
particle-driven optimization algorithms based on parametric families yield
superior results on strongly multi-modal optimization problems while local
search heuristics outperform them on easier problems
- …