Pith. sign in

REVIEW 1 cited by

Fast Convergence of Regress-Later Estimates in Least Squares Monte Carlo

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1309.5274 v2 pith:B3G5DC2C submitted 2013-09-20 q-fin.CP

classification q-fin.CP
keywords regress-laterintervalmethodacrossbasiscarloconditionalconvergence
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Many problems in financial engineering involve the estimation of unknown conditional expectations across a time interval. Often Least Squares Monte Carlo techniques are used for the estimation. One method that can be combined with Least Squares Monte Carlo is the "Regress-Later" method. Unlike conventional methods where the value function is regressed on a set of basis functions valued at the beginning of the interval, the "Regress-Later" method regresses the value function on a set of basis functions valued at the end of the interval. The conditional expectation across the interval is then computed exactly for each basis function. We provide sufficient conditions under which we derive the convergence rate of Regress-Later estimators. Importantly, our results hold on non-compact sets. We show that the Regress-Later method is capable of converging significantly faster than conventional methods and provide an explicit example. Achieving faster convergence speed provides a strong motivation for using Regress-Later methods in estimating conditional expectations across time.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. `Regression Anytime' with Brute-Force SVD Truncation

    math.ST 2019-08 conditional novelty 7.0 of 10

    RAWBFST, a least-squares Monte Carlo method with brute-force SVD truncation, provably approximates conditional expectations with derivative weights at any prescribed polynomial convergence rate under sufficient smoothness.

Pith tools