Sign inGet started
Paper · arXiv

Continuous-time Optimal Stopping through Deep Reinforcement Learning

Simulation based solvers for optimal stopping problems must discretize the stopping decision. Under classical dynamic programming, a coarse exercise grid with only a few stopping opportunities can materially undervalue the optimal expected reward, whereas on a very fine grid, approximation errors accumulate through the backward recursion. To remove this limitation, we develop a new reinforcement-learning inspired algorithm that enables us to learn the exercise rule at arbitrarily fine time resolution. Our CARLOS (Continuous-time Adaptive Reinforcement Learning for Optimal Stopping) algorithm utilizes an aggregate deep neural network (ADNN) to learn a joint space-time decision boundary. St...

AuthorsCosmin Borsa, Michael Ludkovski
Primary categorycs.LG
Published16 June 2026
Last updated at source16 June 2026
cs.LGq-fin.CPq-fin.PR
Embed this entry
<iframe src="https://silytics.si/embed/item/cd6a6a2d-f653-4a6f-bb2d-ac71fe09c7f0" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.