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.
A softmax operator applied to a set of values acts somewhat like the maximization function and somewhat like an average. In sequential decision making, softmax is often used in settings where it is necessary to maximize utility but also to hedge against problems that arise from putting all of one's weight behind a single maximum utility decision. The Boltzmann softmax operator is the most commonly used softmax operator in this setting, but we show that this operator is prone to misbehavior. In this work, we study a differentiable softmax operator that, among other properties, is a non-expansion ensuring a convergent behavior in learning and planning. We introduce a variant of SARSA algorithm that, by utilizing the new operator, computes a Boltzmann policy with a state-dependent temperature parameter. We show that the algorithm is convergent and that it performs favorably in practice.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1612.05628")
get_code_for_paper("1612.05628")
have("1612.05628")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1612.05628.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1612.05628)
Connect an agent — have() is free.