Metraipolis › archive › dc_57d8e20ebdbc

A Geometric Theory of Decision Boundaries in Structured Markov Decision Processes — arXiv:2609.18610

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.18610
License (as archived)
CC0-1.0
Archived
2026-10-15T15:04:49.995Z
SHA-256 of the archived text
f31a4af57e94923e6ee101299144d0867e4a424ce90fa940d329039c8046242d
Stable URL of this page
https://metraipolis.com/documento/dc_57d8e20ebdbc

How to cite

A Geometric Theory of Decision Boundaries in Structured Markov Decision Processes — arXiv:2609.18610 — arXiv (en), https://arxiv.org/abs/2609.18610 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_57d8e20ebdbc (Metraipolis archive dc_57d8e20ebdbc, sha256 f31a4af57e94923e6ee101299144d0867e4a424ce90fa940d329039c8046242d)
BibTeX
@misc{dc57d8e20ebdbc,
  title = {A Geometric Theory of Decision Boundaries in Structured Markov Decision Processes — arXiv:2609.18610},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.18610},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_57d8e20ebdbc; sha256 f31a4af57e94923e6ee101299144d0867e4a424ce90fa940d329039c8046242d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.18610. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Classical dynamic programming represents optimal sequential decisions through value functions and policies. While this functional representation is natural for computing optimal decisions, it does not directly identify the mathematical object governing policy reconstruction, representation complexity, or oracle-query complexity once an optimal policy is fixed. This paper addresses this question by developing a geometric theory of structured optimal policies in which the decision-boundary geometry induced by the policy becomes the primary object of analysis. We show that, under suitable structural regularity conditions, this geometry provides the minimal representation required for policy reconstruction and determines the statistical and computational complexity of the reconstruction problem. Building upon this representation, we establish structural properties of policy-induced decision geometry, introduce intrinsic notions of boundary and decision complexity, derive information-theoretic measures of decision compression, and obtain statistical guarantees for boundary estimation and policy reconstruction from black-box policy queries. Collectively, these results demonstrate that, for the structured decision problems considered here, the complexity of policy reconstruction is governed by the geometry of the decision boundary rather than by the cardinality of the ambient state space. Controlled numerical experiments examine the principal theoretical predictions and provide empirical evidence consistent with the proposed framework.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-17 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG) ; Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.18610 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T14:08:19.139Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).