arXiv:2603. 05296v2 Announce Type: replace-cross Abstract: Offline reinforcement learning (RL) allows robots to learn from offline datasets without risky exploration.
arXiv:2606. 03017v1 Announce Type: cross Abstract: Reward transfer in Inverse Reinforcement Learning (IRL) is unreliable when policies must generalize to unseen combinations of environment dynamics and task goals.
arXiv:2606. 15306v1 Announce Type: cross Abstract: We envision continually learning agentic systems that become more useful over time: as they encounter sequences of related tasks, they should infer the hidden structure shared across those tasks and use it to improve future decisions.
arXiv:2606. 00780v1 Announce Type: cross Abstract: Offline meta-reinforcement learning leverages static datasets to enable agents to generalize to unseen environments by combining offline efficiency with meta-learning adaptability, yet it faces key challenges from context and policy distribution shifts.
arXiv:2607. 15880v1 Announce Type: cross Abstract: Imitation Learning aims to learn skills from extensive observations and demonstrations for robots, so it suffers from data scarcity and environment generalization.
arXiv:2607. 00811v1 Announce Type: new Abstract: Unsupervised pre-training on large-scale datasets has demonstrated significant potential for improving the sample efficiency and performance of Reinforcement Learning (RL).
arXiv:2603. 22281v2 Announce Type: replace-cross Abstract: Recent progress in latent world models (e.
The paper introduces GLiBRL, a deep Bayesian reinforcement learning framework that uses generalized linear task models with learnable nonlinear basis functions. GLiBRL performs exact, sequential Bayesian inference without variational approximations, providing closed‑form posterior updates and a marginal likelihood. The method is permutation‑invariant, compatible with both off‑ and on‑policy algorithms, and achieves the best zero‑shot performance among eight meta‑RL baselines on MuJoCo locomotion and MetaWorld manipulation tasks.
arXiv:2606. 15099v1 Announce Type: cross Abstract: Existing Vision-Language-Action (VLA) models predominantly rely on explicit Chain-of-Thought (CoT) reasoning to bridge perception and action.
The paper introduces a neurosymbolic world model that separates observation reconstruction from reward prediction, enabling the model to adapt zero‑shot to new reward functions defined over a shared symbolic state space. This approach addresses the task‑dependency of traditional neural world models, which learn latent representations tied to specific training tasks. Experiments show that the neurosymbolic formulation generalises more strongly than purely neural methods.
arXiv:2606. 18132v1 Announce Type: new Abstract: Meta-reinforcement learning enables fast adaptation by extracting shared structure from related tasks, but existing end-to-end methods often couple task inference with embodiment-specific control.
arXiv:2602. 12643v2 Announce Type: replace-cross Abstract: We present Unified Latent Dynamics (ULD), a novel reinforcement learning algorithm that unifies the efficiency of model-free methods with the representational strengths of model-based approaches, without incurring planning overhead.