On Stopping Sets and Continuous-Time Decision Trees
Abstract
We study stopping sets and continuous-time decision trees (CTDTs) for Poisson point processes. We prove that every μ-continuous CTDT has an explicit exploration representation: between successive discoveries, the explored set grows according to a deterministic rule depending on the points already observed. If μ is diffuse, we prove that the points are revealed one by one almost surely; this need not be imposed as a separate assumption. We also allow atoms of μ, in which case all points at one location are revealed together. For diffuse μ, we also prove that a locally bounded stopping set that reveals at most one Poisson point is attainable by a μ-continuous exploration. More generally, an increasing sequence of locally bounded stopping sets, each revealing at most one additional point, can be attained by a single exploration viewed at successive stopping times. Finally, we prove the spatial Markov property of the Poisson point process without assuming that the stopping set contains finitely many points or admits a finite approximation. The proof is based on a general criterion for characterizing conditionally Poisson point processes using moment measures, and uses the multivariate Mecke formula on the complement of the stopping set.
Related
- Continuous-time q-Learning for Finite-Horizon Portfolio Choice with Optimal Stopping in Jump-Diffusion Markets
- Minimax-Optimal Early Stopping for Continuous-Time SGD via the Discrepancy Principle
- Largest Rashomon sets of decision trees for robust contextual optimization
- ArborEnum: Decision Tree Rashomon Sets over Continuous Features
- Behaviour near explosion in continuous-time Galton-Watson trees
BibTeX
@misc{khezeli2026stopping,
title = {{On Stopping Sets and Continuous-Time Decision Trees}},
author = {Ali Khezeli},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.22011},
eprint = {2610.22011},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.22011},
}
RIS
TY - UNPB
TI - On Stopping Sets and Continuous-Time Decision Trees
AU - Ali Khezeli
PY - 2026
DA - 2026/10/21
PB - arXiv
DO - 10.48550/arxiv.2610.22011
UR - https://arxiv.org/abs/2610.22011
AB - We study stopping sets and continuous-time decision trees (CTDTs) for Poisson point processes. We prove that every μ-continuous CTDT has an explicit exploration representation: between successive discoveries, the explored set grows according to a deterministic rule depending on the points already observed. If μ is diffuse, we prove that the points are revealed one by one almost surely; this need not be imposed as a separate assumption. We also allow atoms of μ, in which case all points at one location are revealed together. For diffuse μ, we also prove that a locally bounded stopping set that reveals at most one Poisson point is attainable by a μ-continuous exploration. More generally, an increasing sequence of locally bounded stopping sets, each revealing at most one additional point, can be attained by a single exploration viewed at successive stopping times. Finally, we prove the spatial Markov property of the Poisson point process without assuming that the stopping set contains finitely many points or admits a finite approximation. The proof is based on a general criterion for characterizing conditionally Poisson point processes using moment measures, and uses the multivariate Mecke formula on the complement of the stopping set.
ER -