We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Offline goal-conditioned reinforcement learning (GCRL) can be challenging due to overfitting to the given dataset. To generalize agents' skills outside the given dataset, we propose a goal-swapping procedure that generates additional trajectories. To alleviate the problem of noise and extrapolation errors, we present a general offline reinforcement learning method called deterministic Q-advantage policy gradient (DQAPG). In the experiments, DQAPG outperforms state-of-the-art goal-conditioned offline RL methods in a wide range of benchmark tasks, and goal-swapping further improves the test results. It is noteworthy, that the proposed method obtains good performance on the challenging dexterous in-hand manipulation tasks for which the prior methods failed.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2302.08865")
get_code_for_paper("2302.08865")
have("2302.08865")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2302.08865.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2302.08865)
Connect an agent — have() is free.