A Geometric Theory of Decision Boundaries in Structured Markov Decision Processes
Read the original on arXiv Machine Learning →The paper develops a geometric theory of decision boundaries for structured Markov Decision Processes, treating the geometry induced by optimal policies as the key analytical object. It shows that, under structural regularity, this geometry yields the minimal representation needed for policy reconstruction and dictates the statistical and computational complexity of the reconstruction problem. The authors introduce intrinsic notions of boundary and decision complexity, derive information-theoretic measures of decision compression, and provide statistical guarantees for boundary estimation and policy reconstruction from black-box queries, supported by controlled numerical experiments.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.