When Can an Infinite-Stream Evaluation Support Dynamic Programming? Compatibility, Recursive Compression, and Generalized Summation
Abstract
Dynamic programming for nonstandard infinite-horizon criteria requires more than finite stream values: one-step control substitutions must remain evaluable, and continuation information must propagate recursively. For expected stage-reward streams, we separate domain admissibility, finite-dimensional continuous autonomous realizability, scalar sufficiency, and contextual order consistency. For absolutely summable weighted criteria, we prove that the minimum Euclidean dimension of an exact continuous autonomous continuation state equals the temporal Hankel rank. Thus finite Hankel rank exactly characterizes when temporal nonstationarity can be replaced by finite endogenous state augmentation; the lower bound applies even to nonlinear continuous encoders and already holds in a one-state MDP. For literal Candelpergher Ramanujan summation, the same common-continuation test fails earlier: changing only the current action can leave the evaluation domain. Abel summation provides a contrasting prefix-closed benchmark.
Related
- Inertial parameterized Douglas-Rachford for generalized DC programming problems
- Generalized Semi-Infinite Programming for Robust Optimal Control with Decision-Dependent Uncertainty
- Solution Methods for Infinite-Dimensional Generalized Disjunctive Programming
- H-PDLP: GPU-Accelerated Linear Programming via Generalized PDHG and Homogeneous Self-Dual Embedding
- Q-MMR: Off-Policy Evaluation via Recursive Reweighting and Moment Matching
BibTeX
@misc{xu2026when,
title = {{When Can an Infinite-Stream Evaluation Support Dynamic Programming? Compatibility, Recursive Compression, and Generalized Summation}},
author = {Yingzhe Xu},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.02842},
eprint = {2610.02842},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.02842},
}
RIS
TY - UNPB
TI - When Can an Infinite-Stream Evaluation Support Dynamic Programming? Compatibility, Recursive Compression, and Generalized Summation
AU - Yingzhe Xu
PY - 2026
DA - 2026/10/02
PB - arXiv
DO - 10.48550/arxiv.2610.02842
UR - https://arxiv.org/abs/2610.02842
AB - Dynamic programming for nonstandard infinite-horizon criteria requires more than finite stream values: one-step control substitutions must remain evaluable, and continuation information must propagate recursively. For expected stage-reward streams, we separate domain admissibility, finite-dimensional continuous autonomous realizability, scalar sufficiency, and contextual order consistency. For absolutely summable weighted criteria, we prove that the minimum Euclidean dimension of an exact continuous autonomous continuation state equals the temporal Hankel rank. Thus finite Hankel rank exactly characterizes when temporal nonstationarity can be replaced by finite endogenous state augmentation; the lower bound applies even to nonlinear continuous encoders and already holds in a one-state MDP. For literal Candelpergher Ramanujan summation, the same common-continuation test fails earlier: changing only the current action can leave the evaluation domain. Abel summation provides a contrasting prefix-closed benchmark.
ER -