Ning Jia, Xianhui Liu, Weidong Zhao, Gao Gong
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.
Existing value-based online reinforcement learning (RL) algorithms suffer from slow policy exploitation due to ineffective exploration and delayed policy updates. To address these challenges, we propose an algorithm called Instant Retrospect Action (IRA). Specifically, we propose Q-Representation Discrepancy Evolution (RDE) to facilitate Q-network representation learning, enabling discriminative representations for neighboring state-action pairs. In addition, we adopt an explicit method to policy constraints by enabling Greedy Action Guidance (GAG). This is achieved through backtracking historical actions, which effectively enhances the policy update process. Our proposed method relies on providing the learning algorithm with accurate k-nearest-neighbor action value estimates and learning to design a fast-adaptable policy through policy constraints. We further propose the Instant Policy Update (IPU) mechanism, which enhances policy exploitation by systematically increasing the frequency of policy updates. We further discover that the earlystage training conservatism of the IRA method can alleviate the overestimation bias problem in value-based RL. Experimental results show that IRA can significantly improve the learning efficiency and final performance of online RL algorithms on eight MuJoCo continuous control tasks. The code is available at https://github.com/2706853499/IRA.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2601.19720")
get_code_for_paper("2601.19720")
have("2601.19720")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2601.19720.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2601.19720)
Connect an agent — have() is free.