Hugging Face Trending Papers June 24, 2026

Low-Complexity Policy Tessellations in Structured Markov Decision Processes

Read the original on Hugging Face Trending Papers →

We study optimal-policy geometry in structured Markov decision processes. While approximate dynamic programming and reinforcement learning typically approximate high-dimensional value functions, we show that optimal policies induce simpler decision tessellations.

Summary generated by The Flow from the publisher's feed. The full article lives at Hugging Face Trending Papers.

reinforcement-learning

arXiv Machine Learning

Jun 25

Low-Complexity Policy Tessellations in Structured Markov Decision Processes

arXiv:2606. 25593v1 Announce Type: new Abstract: We study optimal-policy geometry in structured Markov decision processes.

By Fredy Pokou (CRIStAL)

reinforcement-learning

arXiv AI

Jun 10

Bellman-Taylor Score Decoding for Markov Decision Processes with State-Dependent Feasible Action Sets

arXiv:2606. 10979v1 Announce Type: new Abstract: Many Markov decision processes (MDPs) in operations research have feasible actions that are state dependent and defined implicitly by various operational constraints.

By Yi Chen (Lucy), Rushuai Yang (Lucy), Qiang Chen (Lucy), Dongyan (Lucy), Huo

reinforcement-learning benchmarks

arXiv Machine Learning

Jun 9

Bellman Residual Minimization for Control: Geometry, Stationarity, and Convergence

arXiv:2601. 18840v4 Announce Type: replace Abstract: Markov decision problems are most commonly solved via dynamic programming.

By Donghwan Lee, Hyukjun Yang

reinforcement-learning

arXiv Machine Learning

Jun 17

Performance-Driven Environment Abstraction with Multi-Timescale Learning

arXiv:2606. 17377v1 Announce Type: new Abstract: We study performance-driven environment abstraction for decision-making in large Markov decision processes.

By Yue Guan, Dipankar Maity, Panagiotis Tsiotras

reinforcement-learning

arXiv Machine Learning

Jul 28

Online Policy Evaluation for MDPs with Dynamic UBSR Measures

arXiv:2607. 23030v1 Announce Type: new Abstract: Developing efficient function-approximation methods for policy evaluation is a fundamental challenge in risk-aware reinforcement learning.

By Weikai Wang, Erick Delage

reinforcement-learning

arXiv Machine Learning

Jul 1

End-to-End Efficient RL for Linear Bellman Complete MDPs with Deterministic Transitions

arXiv:2603. 23461v2 Announce Type: replace Abstract: We study reinforcement learning (RL) with linear function approximation in Markov Decision Processes (MDPs) satisfying \emph{linear Bellman completeness} -- a fundamental setting where the Bellman backup of any linear value function remains linear.

By Zakaria Mhammedi, Alexander Rakhlin, Nneka Okolo

reinforcement-learning

Related stories

Low-Complexity Policy Tessellations in Structured Markov Decision Processes

Bellman-Taylor Score Decoding for Markov Decision Processes with State-Dependent Feasible Action Sets

Bellman Residual Minimization for Control: Geometry, Stationarity, and Convergence

Performance-Driven Environment Abstraction with Multi-Timescale Learning

Online Policy Evaluation for MDPs with Dynamic UBSR Measures

End-to-End Efficient RL for Linear Bellman Complete MDPs with Deterministic Transitions