Youngchul Sung, Seungyul Han
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 this paper, we propose a max-min entropy framework for reinforcement learning (RL) to overcome the limitation of the soft actor-critic (SAC) algorithm implementing the maximum entropy RL in model-free sample-based learning. Whereas the maximum entropy RL guides learning for policies to reach states with high entropy in the future, the proposed max-min entropy framework aims to learn to visit states with low entropy and maximize the entropy of these low-entropy states to promote better exploration. For general Markov decision processes (MDPs), an efficient algorithm is constructed under the proposed max-min entropy framework based on disentanglement of exploration and exploitation. Numerical results show that the proposed algorithm yields drastic performance improvement over the current state-of-the-art RL algorithms.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2106.10517")
get_code_for_paper("2106.10517")
have("2106.10517")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2106.10517.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2106.10517)
Connect an agent — have() is free.