arXiv Machine Learning

Learning Unknown Constraints without Unsafe Data via Optimality and Counterfactual Regularization

The paper introduces Counterfactual KKT (CF‑KKT), a framework that learns unknown constraints from locally optimal demonstrations without requiring known dynamics or risky exploration. CF‑KKT uses a learned differentiable dynamics model to apply KKT‑inspired optimality conditions and generates counterfactual behaviors that reveal infeasible data, enabling safer and more data‑efficient constraint recovery. Experiments on high‑dimensional robotic control tasks show that neural constraint representations learned with CF‑KKT achieve better safety and data efficiency than state‑of‑the‑art offline inverse constrained reinforcement learning baselines.

arXiv Computer Vision
Sep 30

RoXDrive: Closed-Loop Reinforcement Learning for End-to-End Autonomous Driving via Action-Faithful Rollouts

arXiv:2609.36851v1 Announce Type: new Abstract: End-to-end autonomous driving policies are commonly trained via imitation learning on logged demonstrations without observing the consequences of their...

By Hongbin Lin, Chaoda Zheng, Yiming Yang, Xiangyu Li, Shijia Chen, Jinhao Deng, Kangjie Chen, Dongbin Zhang, Jie Feng, Yu Zhang, Xianming Liu, Shuguang Cui, Boyang Wang, Zhen Li
arXiv AI
Oct 12

Sampling-Based Safe Reinforcement Learning

Sampling-Based Safe Reinforcement Learning (SBSRL) is a model‑based RL algorithm that enforces safety by jointly constraining a finite set of dynamics samples, approximating a worst‑case optimization over uncertain dynamics. It introduces an exploration strategy that limits epistemic uncertainty, removing the need for explicit exploration bonuses. The authors provide high‑probability safety guarantees and a finite‑time sample complexity bound, and demonstrate safe, efficient exploration in both simulation and real robotic hardware, with extensions to deep‑ensemble implementations for high‑dimensional continuous control.

By Luca Vignola, Bruce D. Lee, Manish Prajapat, Manuel Wendl, Melanie Zeilinger, Andreas Krause, Yarden As
Hugging Face Trending Papers
Sep 28

Q-learning Penalized Transformer for Safe Offline Reinforcement Learning

The paper introduces Q-learning Penalized Transformer (QPT), a training–inference consistent framework for safe offline reinforcement learning. QPT trains a Transformer policy that generates actions conditioned on trajectory context and target return/cost while incorporating a Q-shaped penalty to balance safety, reward maximization, and behavior regularization. The method consistently outperforms strong baselines on 38 DSRL benchmark tasks and adapts robustly to varying constraint thresholds.

arXiv Machine Learning
Sep 30

Global Optimality for Constrained Exploration via Penalty Regularization

The paper introduces Policy Gradient Penalty (PGP), a single‑loop policy‑space method that enforces convex occupancy‑measure constraints via quadratic‑penalty regularization. PGP constructs pseudo‑rewards to estimate gradients of the penalized objective and uses the classical Policy Gradient Theorem, establishing smoothness and global last‑iterate convergence guarantees for an ε‑optimal constrained entropy value with ε‑bounded constraint violation. The authors validate PGP with ablations on a grid‑world benchmark and demonstrate scalability on two challenging continuous‑control tasks.

By Florian Wolf, Ilyas Fatkhullin, Niao He