Low-rank kernel methods for American option pricing
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910198577233920 |
|---|---|
| author | Multerer, Michael Schneider, Paul Segala, Chiara |
| author_facet | Multerer, Michael Schneider, Paul Segala, Chiara |
| contents | We propose a scalable and theoretically grounded low-rank conditional expectation model for recursive Monte Carlo optimal stopping problems, in particular American option pricing. Our method reformulates the estimation of continuation values as a learning problem in a reproducing kernel Hilbert space, in which the conditional expectation is represented as a linear operator acting on future payoffs. This perspective yields an offline-online decomposition: the operator is learned once from simulated data and subsequently reused across all exercise dates, eliminating the need to recompute regression models at each step of the backward recursion. We establish convergence guarantees and derive bounds quantifying the approximation errors across exercise dates. Numerical experiments demonstrate the speed and accuracy of the proposed approach relative to extant methods. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_06349 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Low-rank kernel methods for American option pricing Multerer, Michael Schneider, Paul Segala, Chiara Numerical Analysis Statistics Theory 91G60, 91G20, 60G40, 46E22, 65F55 We propose a scalable and theoretically grounded low-rank conditional expectation model for recursive Monte Carlo optimal stopping problems, in particular American option pricing. Our method reformulates the estimation of continuation values as a learning problem in a reproducing kernel Hilbert space, in which the conditional expectation is represented as a linear operator acting on future payoffs. This perspective yields an offline-online decomposition: the operator is learned once from simulated data and subsequently reused across all exercise dates, eliminating the need to recompute regression models at each step of the backward recursion. We establish convergence guarantees and derive bounds quantifying the approximation errors across exercise dates. Numerical experiments demonstrate the speed and accuracy of the proposed approach relative to extant methods. |
| title | Low-rank kernel methods for American option pricing |
| topic | Numerical Analysis Statistics Theory 91G60, 91G20, 60G40, 46E22, 65F55 |
| url | https://arxiv.org/abs/2605.06349 |