Stanford-ILIAD / batch-active-preference-based-learningLinks
Companion code to CoRL 2018 paper: E Bıyık, D Sadigh. "Batch Active Preference-Based Learning of Reward Functions". Conference on Robot Learning (CoRL), Zurich, Switzerland, Oct. 2018.
☆30Updated 6 years ago
Alternatives and similar repositories for batch-active-preference-based-learning
Users that are interested in batch-active-preference-based-learning are comparing it to the libraries listed below
Sorting:
- QMDP-Net implementation☆65Updated 5 years ago
- ☆68Updated 4 years ago
- ☆54Updated 7 years ago
- Guided-Meta Policy Search☆39Updated 2 years ago
- Autoregressive policies for continuous control reinforcement learning☆32Updated 6 years ago
- Code repository for Active Domain Randomization (CoRL 2019, https://arxiv.org/abs/1904.04762)☆100Updated 4 years ago
- ☆66Updated 5 years ago
- Algorithmic Framework for Model-based Deep Reinforcement Learning with Theoretical Guarantees☆55Updated 6 years ago
- Meta-Inverse Reinforcement Learning with Probabilistic Context Variables☆74Updated 2 years ago
- Code for "Calibrated Model-Based Deep Reinforcement Learning", ICML 2019.☆55Updated 6 years ago
- ☆99Updated 2 years ago
- Code for CORL'18 paper "Risk-Aware Active Inverse Reinforcement Learning"☆16Updated 6 years ago
- accompanying code for neurips submission "Goal-conditioned Imitation Learning"☆73Updated 2 years ago
- Library for model based RL in robotics☆37Updated 7 years ago
- Contains the code for "BaRC: Backward Reachability Curriculum for Robotic Reinforcement Learning" by Boris Ivanovic, James Harrison, Apoo…☆12Updated 7 years ago
- Code for "Divide-and-Conquer Reinforcement Learning"☆61Updated 6 years ago
- Code for Environment Probing Interaction Policies [ICLR 2019]☆29Updated 6 years ago
- Learning Off-Policy with Online Planning [CoRL 2021 Best Paper Finalist]☆41Updated 3 years ago
- Source code for our NIPS 2017 paper, InfoGAIL: Interpretable Imitation Learning from Visual Demonstrations☆42Updated 7 years ago
- ☆20Updated 4 years ago
- Infer how suboptimal agents are suboptimal while planning, for example if they are hyperbolic time discounters.☆25Updated 5 years ago
- The MAGICAL benchmark suite for robust imitation learning (NeurIPS 2020)☆78Updated last year
- ☆49Updated 5 years ago
- Code for reproducing experiments in Model-Based Active Exploration, ICML 2019☆79Updated 6 years ago
- Repository for the paper "Long-Horizon Visual Planning with Goal-Conditioned Hierarchical Predictors"☆45Updated 2 years ago
- Efficient Exploration via State Marginal Matching (2019)☆69Updated 6 years ago
- OpenAI Gym Wrapper for DeepMind Control Suite☆72Updated 3 years ago
- ☆30Updated 5 years ago
- A library of probabilistic model based RL algorithms in pytorch☆107Updated 4 years ago
- DHER: Hindsight Experience Replay for Dynamic Goals (ICLR-2019)☆66Updated 5 years ago