arXiv Machine Learning

What Must Survive? Exact Task-Information--State Frontiers for Resource-Sufficient Learning

arXiv Machine Learning
Oct 23

Primal-Dual Representation Learning for Low-Rank Constrained MDPs

The paper introduces REP-PD-TEG, a representation‑learning algorithm for low‑rank continuous‑state constrained Markov Decision Processes (CMDPs) that achieves optimal ≥O(√K) regret in the soft cumulative‑violation setting while maintaining a ≥O(K^{3/4}) sample bound when exploratory actions are penalised. For the stricter hard cumulative‑violation scenario, REP-PD-H-TEG is proposed, which uses a bonus‑corrected lower‑confidence utility certificate and a stabilized dual search to guarantee both regret and hard‑violation bounds. Together, these methods provide the first theoretically guaranteed representation‑learning framework for low‑rank continuous‑state CMDPs with both soft and hard violation controls.

By Chenhao Zhou, Chao Zhang, Wensong Bai, Hanbin Zhao, Hui Qian
arXiv Machine Learning
Jun 30

SMaRT: Online Reusable Resource Assignment and an Application to Mediation in the Kenyan Judiciary

arXiv:2602. 18431v2 Announce Type: replace-cross Abstract: Motivated by the problem of assigning mediators to cases in the Kenyan judicial system, we study an online resource allocation problem where incoming tasks (cases) must be immediately assigned to available, capacity-constrained resources (mediators).

By Shafkat Farabi, Didac Marti Pinto, Wei Lu, Manuel Ramos-Maqueda, Sanmay Das, Antoine Deeb, Anja Sautmann