2019
DOI: 10.1515/mcma-2019-2049
|View full text |Cite
|
Sign up to set email alerts
|

An aspect of optimal regression design for LSMC

Abstract: Practitioners sometimes suggest to use a combination of Sobol sequences and orthonormal polynomials when applying an LSMC algorithm for evaluation of option prices or in the context of risk capital calculation under the Solvency II regime. In this paper, we give a theoretical justification why good implementations of an LSMC algorithm should indeed combine these two features in order to assure numerical stability. Moreover, an explicit bound for the number of outer scenarios necessary to guarantee a prescribed… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
3
2
1

Relationship

3
3

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 15 publications
0
3
0
Order By: Relevance
“…McLean (2014) justifies that from the perspective of numerical stability performing a QR decomposition on a monomial design matrix Z is asymptotically equivalent to using a Legendre design matrix Z and transforming the resulting coefficient estimator into the monomial one. Under the assumption of an orthonormal basis, Weiß and Nikolić (2019) have derived an explicit upper bound for the condition number of non-diagonal matrix 1 N (Z ) T (Z ) for N < ∞, where the factor 1 N is used for technical reasons. This upper bound increases in (1) the number of basis functions, (2) the Hardy-Krause variation of the basis, (3) the convergence constant of the low-discrepancy sequence, and (4) the outer scenario dimension.…”
Section: Numerical Stabilitymentioning
confidence: 99%
“…McLean (2014) justifies that from the perspective of numerical stability performing a QR decomposition on a monomial design matrix Z is asymptotically equivalent to using a Legendre design matrix Z and transforming the resulting coefficient estimator into the monomial one. Under the assumption of an orthonormal basis, Weiß and Nikolić (2019) have derived an explicit upper bound for the condition number of non-diagonal matrix 1 N (Z ) T (Z ) for N < ∞, where the factor 1 N is used for technical reasons. This upper bound increases in (1) the number of basis functions, (2) the Hardy-Krause variation of the basis, (3) the convergence constant of the low-discrepancy sequence, and (4) the outer scenario dimension.…”
Section: Numerical Stabilitymentioning
confidence: 99%
“…in computational finance (see e.g. [CMO97], [GW09], [Gla03], [Pas94], [WN19]). Therefore, it is of interest to know sharp bounds for the smallest achievable star-discrepancy…”
Section: Discrepancymentioning
confidence: 99%
“…McLean (2014) justifies that from the perspective of numerical stability performing a QR decomposition on a monomial design matrix Z is asymptotically equivalent to using a Legendre design matrix Z and transforming the resulting coefficient estimator into the monomial one. Under the assumption of an orthonormal basis, Weiß & Nikolić (2018) have derived an explicit upper bound for the condition number of non-diagonal matrix 1 N (Z ) T (Z ) for N < ∞, where the factor 1 N is used for technical reasons. This upper bound increases in (1) the number of basis functions, (2) the Hardy-Krause variation of the basis, (3) the convergence constant of the low-discrepancy sequence, and (4) the outer scenario dimension.…”
Section: Numerical Stabilitymentioning
confidence: 99%