Goto

Collaborating Authors

 Reinforcement Learning


Appendix A Visual Reinforcement Learning Baselines DrQ: This model-free, off-policy reinforcement learning algorithm, is based on Soft Actor-Critic (SAC) [

Neural Information Processing Systems

Meanwhile, we utilize the 3D scenes from the Gibson dataset as our map for all experiments. Autonomous driving: We choose the stable version of CARLA 0.9.10 for simulation.


RL-ViGen: A Reinforcement Learning Benchmark for Visual Generalization

Neural Information Processing Systems

Visual Reinforcement Learning (Visual RL), coupled with high-dimensional observations, has consistently confronted the long-standing challenge of out-of-distribution generalization.


Grounded ReinforcementLearning: LearningtoWintheGameunderHumanCommands SupplementaryMaterials

Neural Information Processing Systems

Inthis section, we describe the details ofMiniRTSEnvironment and human dataset. The data do not contain any personally identifiable information or offensivecontent. Figure 1: MiniRTS [2]implements the rockpaper-scissors attack graph, each army type has some units it is effective against and vulnerableto. "swordman","spearman"and"cavalry"allare effectiveagainst"archer" Figure 2: Building units can produce different army units using resources. Resource Units: Resource units are stationary and neutral.


Grounded ReinforcementLearning: LearningtoWintheGameunderHumanCommands

Neural Information Processing Systems

From the RL perspective, it is extremely challenging to derive a precise rewardfunction forhuman preferences since thecommands areabstract and the valid behaviors are highly complicated and multi-modal.




A Learning and Sampling

Neural Information Processing Systems

A.1 Deep generative modelling A complete trajectory is denoted by ζ " t s The log-likelihood function is: Lpθ q " ÿ Applying this simple identiy, we also have: 0 " E On the other hand, it discourages action samples directly sampled from the prior. To ensure the transition model's validity, it needs to be grounded in real-world dynamics when jointly learned with the policy. Otherwise, the agent would be purely hallucinating based on the demonstrations. It would not be a problem if the action space is quantized. Intuitively, action samples at each step are updated with the energy of all subsequent actions and a single-step forward by back-propagation. To train the policy, Eq. (8) can now be rewritten as δ Eq. (5) is an empirical estimate of E We first prove the construction above is valid at optimality.