Feihu Huang, Shangqian Gao, Jian Pei, Heng Huang
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.
In the paper, we propose a class of efficient momentum-based policy gradient methods for the model-free reinforcement learning, which use adaptive learning rates and do not require any large batches. Specifically, we propose a fast important-sampling momentum-based policy gradient (IS-MBPG) method based on a new momentum-based variance reduced technique and the importance sampling technique. We also propose a fast Hessian-aided momentum-based policy gradient (HA-MBPG) method based on the momentum-based variance reduced technique and the Hessian-aided technique. Moreover, we prove that both the IS-MBPG and HA-MBPG methods reach the best known sample complexity of O( -3 ) for finding an -stationary point of the nonconcave performance function, which only require one trajectory at each iteration. In particular, we present a non-adaptive version of IS-MBPG method, i.e., IS-MBPG*, which also reaches the best known sample complexity of O( -3 ) without any large batches. In the experiments, we apply four benchmark tasks to demonstrate the effectiveness of our algorithms.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2007.06680")
get_code_for_paper("2007.06680")
have("2007.06680")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2007.06680.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2007.06680)
Connect an agent — have() is free.