Summary
They present a method for training language models with in a goal conditioned way to solve text-game tasks. Their method involves training the LM to predict goal, action, next observation pairs. Unlike standard decision transformers, they sample the goal using a distribution exponentially tilted by the value of the goal. They demonstrate strong performance on text-game tasks and perform many ablations showing that their 1) their exponential tilt is very effective at choosing the right goal when \alpha is set high enough, 2) their next-observation auxiliary loss is necessary for maximizing performance, and 3) the choice of what goal representation to use can impact performance.
Strengths
* Their method preforms very well empirically on these challenging text-game tasks.
* They abate the important design decisions behind their method
* They compare their method against many different baselines, showing improvements over all of them
* Their method is clean and simple
Weaknesses
* The paper is not well written; the figures are low quality.
* The method has questionable novelty, as many of its ideas have been explored in some form in previous works. However, many of these works have not applied these specific ideas to text-games.
* Many of the baselines compared to are online methods, which likely perform worse than their offline method because of the exploration challenges presented by these long-horizon, sparse-reward text games. In the offline setting this challenge is alleviated because they are given at least 1 good trajectory and many partially good trajectories. This difference in difficulty is likely significant. It would be great if they could compare to some other offline methods, like filtered BC or [ILQL](https://arxiv.org/abs/2206.11871), trained on the same dataset.
Nitpicks:
* The statement “[offnline RL] is more difficult than online RL” is not necessarily true if your dataset is really good for example, then online RL will have many more challenges with exploration to catch up. Offline RL presents different challenges, but it is not fair to say that offline RL is strictly more difficult.
* "we convert distributions over discrete token representations of goal conditions into continuous ones": this statement was confusing to me because the distribution is still intently discrete after your exponential tilting.
Questions
* Do the baseline results come from the original papers, or did you run them yourself? And if so, how did you tune the baselines?
* How does the method perform as you change the dataset quality? If you collect more low quality trajectories to mix in with the data, does it still perform well?
Rating
3: reject, not good enough
Confidence
4: You are confident in your assessment, but not absolutely certain. It is unlikely, but not impossible, that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work.