pith. sign in

hub

Emergence of Locomotion Behaviours in Rich Environments

11 Pith papers cite this work. Polarity classification is still indexing.

11 Pith papers citing it
abstract

The reinforcement learning paradigm allows, in principle, for complex behaviours to be learned directly from simple reward signals. In practice, however, it is common to carefully hand-design the reward function to encourage a particular solution, or to derive it from demonstration data. In this paper explore how a rich environment can help to promote the learning of complex behavior. Specifically, we train agents in diverse environmental contexts, and find that this encourages the emergence of robust behaviours that perform well across a suite of tasks. We demonstrate this principle for locomotion -- behaviours that are known for their sensitivity to the choice of reward. We train several simulated bodies on a diverse set of challenging terrains and obstacles, using a simple reward function based on forward progress. Using a novel scalable variant of policy gradient reinforcement learning, our agents learn to run, jump, crouch and turn as required by the environment without explicit reward-based guidance. A visual depiction of highlights of the learned behavior can be viewed following https://youtu.be/hx_bgoTF7bs .

hub tools

representative citing papers

Benchmarking Model-Based Reinforcement Learning

cs.LG · 2019-07-03 · accept · novelty 7.0

Introduces a benchmark suite of over 18 MBRL environments, evaluates multiple algorithms under consistent settings, and identifies three core challenges: dynamics bottleneck, planning horizon dilemma, and early-termination dilemma.

Exploring Model-based Planning with Policy Networks

cs.LG · 2019-06-20 · unverdicted · novelty 7.0

POPLIN combines policy networks with model-predictive planning by optimizing either action sequences or policy parameters, yielding 3x better sample efficiency than PETS, TD3 and SAC on MuJoCo locomotion tasks.

rePIRL: Learn PRM with Inverse RL for LLM Reasoning

cs.LG · 2026-02-08 · unverdicted · novelty 6.0

rePIRL learns effective process reward models for LLM reasoning via a dual policy-PRM update process inspired by inverse RL, unifying online and offline methods with reported gains over prior approaches on math and coding datasets.

ANO: A Principled Approach to Robust Policy Optimization

cs.AI · 2026-05-04 · unverdicted · novelty 6.0

ANO derives a robust policy optimizer from geometric principles that replaces clipping with a smooth redescending gradient, showing better performance and stability than PPO, SPO, and GRPO in MuJoCo, Atari, and RLHF experiments.

Remote Action Generation: Remote Control with Minimal Communication

cs.IT · 2026-05-03 · unverdicted · novelty 6.0

GRASP reduces communication in remote control by 12-fold on average (50-fold for continuous actions) by having actors generate actions via guided sampling and local policy learning instead of receiving full actions or rewards.

Ratio-Variance Regularized Policy Optimization

cs.LG · 2026-05-26 · unverdicted · novelty 5.0

R²VPO uses ratio-variance regularization as a distributional soft brake on policy updates, claiming better performance than PPO on math reasoning and robotic control without hard clipping.

citing papers explorer

Showing 11 of 11 citing papers.

  • Promptbreeder: Self-Referential Self-Improvement Via Prompt Evolution cs.CL · 2023-09-28 · unverdicted · none · ref 144 · internal anchor

    Promptbreeder evolves both task prompts and the mutation prompts that improve them using LLMs, outperforming Chain-of-Thought and Plan-and-Solve on arithmetic and commonsense reasoning benchmarks.

  • Randomized Advantage Transformation (RAT): Computing Natural Policy Gradients via Direct Backpropagation cs.LG · 2026-05-18 · unverdicted · none · ref 125 · internal anchor

    RAT reformulates regularized natural policy gradients as vanilla gradients with a transformed advantage, computed efficiently via randomized block Kaczmarz iterations on on-policy data.

  • Benchmarking Model-Based Reinforcement Learning cs.LG · 2019-07-03 · accept · none · ref 20 · internal anchor

    Introduces a benchmark suite of over 18 MBRL environments, evaluates multiple algorithms under consistent settings, and identifies three core challenges: dynamics bottleneck, planning horizon dilemma, and early-termination dilemma.

  • Exploring Model-based Planning with Policy Networks cs.LG · 2019-06-20 · unverdicted · none · ref 16 · internal anchor

    POPLIN combines policy networks with model-predictive planning by optimizing either action sequences or policy parameters, yielding 3x better sample efficiency than PETS, TD3 and SAC on MuJoCo locomotion tasks.

  • rePIRL: Learn PRM with Inverse RL for LLM Reasoning cs.LG · 2026-02-08 · unverdicted · none · ref 9 · internal anchor

    rePIRL learns effective process reward models for LLM reasoning via a dual policy-PRM update process inspired by inverse RL, unifying online and offline methods with reported gains over prior approaches on math and coding datasets.

  • Reinforcement Learning with Competitive Ensembles of Information-Constrained Primitives cs.LG · 2019-06-25 · unverdicted · none · ref 16 · internal anchor

    RL policies decompose into information-regularized primitives that compete by requesting state information amounts, with the greediest one acting, yielding better generalization than flat or hierarchical baselines.

  • ANO: A Principled Approach to Robust Policy Optimization cs.AI · 2026-05-04 · unverdicted · none · ref 9

    ANO derives a robust policy optimizer from geometric principles that replaces clipping with a smooth redescending gradient, showing better performance and stability than PPO, SPO, and GRPO in MuJoCo, Atari, and RLHF experiments.

  • Remote Action Generation: Remote Control with Minimal Communication cs.IT · 2026-05-03 · unverdicted · none · ref 7

    GRASP reduces communication in remote control by 12-fold on average (50-fold for continuous actions) by having actors generate actions via guided sampling and local policy learning instead of receiving full actions or rewards.

  • Advantage-Weighted Regression: Simple and Scalable Off-Policy Reinforcement Learning cs.LG · 2019-10-01 · conditional · none · ref 5

    AWR learns policies via advantage-weighted supervised regression on actions, achieving competitive off-policy performance on Gym tasks and strong results from static data alone.

  • Ratio-Variance Regularized Policy Optimization cs.LG · 2026-05-26 · unverdicted · none · ref 4 · internal anchor

    R²VPO uses ratio-variance regularization as a distributional soft brake on policy updates, claiming better performance than PPO on math reasoning and robotic control without hard clipping.

  • An Actor-Critic-Attention Mechanism for Deep Reinforcement Learning in Multi-view Environments cs.LG · 2019-07-19 · unverdicted · none · ref 7 · internal anchor

    An attention-augmented actor-critic agent learns to dynamically weight multiple environment views by importance and outperforms baselines on TORCS and three other 3D simulators under noise and partial observability.