Abstract
The quasi-Monte Carlo method for financial valuation and other integration problems has error bounds of size O((log N)k N-1), or even O((log N)k N-3/2), which suggests significantly better performance than the error size O(N-1/2) for standard Monte Carlo. But in high-dimensional problems, this benefit might not appear at feasible sample sizes. Substantial improvements from quasi-Monte Carlo integration have, however, been reported for problems such as the valuation of mortgage-backed securities, in dimensions as high as 360. The authors believe that this is due to a lower effective dimension of the integrand in those cases. This paper defines the effective dimension and shows in examples how the effective dimension may be reduced by using a Brownian bridge representation.
Keywords
Related Publications
All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
Weighted paths in directed grid graphs of dimension (m X n) can be used to model the string edit problem, which consists of obtaining optimal (weighted) alignments between subst...
On coresets for k-means and k-median clustering
In this paper, we show the existence of small coresets for the problems of computing k-median and k-means clustering for points in low dimension. In other words, we show that gi...
Efficient projections onto the<i>l</i><sub>1</sub>-ball for learning in high dimensions
We describe efficient algorithms for projecting a vector onto the ℓ1-ball. We present two methods for projection. The first performs exact projection in O(n) expected time, wher...
Better streaming algorithms for clustering problems
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of stor...
Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means Method
We show a worst-case lower bound and a smoothed upper bound on the number of iterations performed by the iterative closest point (ICP) algorithm. First proposed by Besl and McKa...
Publication Info
- Year
- 1997
- Type
- article
- Volume
- 1
- Issue
- 1
- Pages
- 27-46
- Citations
- 511
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.21314/jcf.1997.005