NathanGavenski commited on
Commit
90efc39
1 Parent(s): 9f2fa59

Update README.md

Browse files
Files changed (1) hide show
  1. README.md +44 -5
README.md CHANGED
@@ -1,6 +1,33 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
  # How Resilient are Imitation Learning Methods to Sub-Optimal Experts?
 
 
2
  Trajectories used in [How Resilient are Imitation Learning Methods to Sub-Optimal Experts?]()
 
3
 
 
4
  These trajectories are formed by using [Stable Baselines](https://stable-baselines.readthedocs.io/en/master/).
5
  Each file is a dictionary of a set of trajectories with the following keys:
6
 
@@ -8,10 +35,22 @@ Each file is a dictionary of a set of trajectories with the following keys:
8
  * obs: current state in the given timestamp `t`
9
  * rewards: reward retrieved after the action in the given timestamp `t`
10
  * episode_returns: The aggregated reward of each episode (each file consists of 5000 runs)
11
- * episode_Starts: Whether that `obs` is the first state of an episode (boolean list).
12
 
13
- The code that uses this data is on GitHub: https://github.com/NathanGavenski/How-resilient-IL-methods-are
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
14
 
15
- ---
16
- license: mit
17
- ---
 
1
+ ---
2
+ annotations_creators:
3
+ - machine-generated
4
+ language: []
5
+ language_creators:
6
+ - expert-generated
7
+ license:
8
+ - mit
9
+ multilinguality: []
10
+ pretty_name: How Resilient are Imitation Learning Methods to Sub-Optimal Experts?
11
+ size_categories:
12
+ - 100B<n<1T
13
+ source_datasets:
14
+ - original
15
+ tags:
16
+ - Imitation Learning
17
+ - Expert Trajectories
18
+ - Classic Control
19
+ task_categories:
20
+ - other
21
+ task_ids: []
22
+ ---
23
+
24
  # How Resilient are Imitation Learning Methods to Sub-Optimal Experts?
25
+
26
+ ## Related Work
27
  Trajectories used in [How Resilient are Imitation Learning Methods to Sub-Optimal Experts?]()
28
+ The code that uses this data is on GitHub: https://github.com/NathanGavenski/How-resilient-IL-methods-are
29
 
30
+ # Structure
31
  These trajectories are formed by using [Stable Baselines](https://stable-baselines.readthedocs.io/en/master/).
32
  Each file is a dictionary of a set of trajectories with the following keys:
33
 
 
35
  * obs: current state in the given timestamp `t`
36
  * rewards: reward retrieved after the action in the given timestamp `t`
37
  * episode_returns: The aggregated reward of each episode (each file consists of 5000 runs)
38
+ * episode_Starts: Whether that `obs` is the first state of an episode (boolean list)
39
 
40
+ ## Citation Information
41
+ ```
42
+ @inproceedings{gavenski2022how,
43
+ title={How Resilient are Imitation Learning Methods to Sub-Optimal Experts?},
44
+ author={Nathan Gavenski and Juarez Monteiro and Adilson Medronha and Rodrigo Barros},
45
+ booktitle={2022 Brazilian Conference on Intelligent Systems (BRACIS)},
46
+ year={2022},
47
+ organization={IEEE}
48
+ }
49
+ ```
50
+
51
+ ## Contact:
52
+ - [Nathan Schneider Gavenski](nathan.gavenski@edu.pucrs.br)
53
+ - [Juarez Monteiro](juarez.santos@edu.pucrs.br)
54
+ - [Adilson Medronha](adilson.medronha@edu.pucrs.br)
55
+ - [Rodrigo C. Barros](rodrigo.barros@pucrs.br)
56