Papers › An Alternative Softmax Operator for Reinforcement Learning

An Alternative Softmax Operator for Reinforcement Learning

16 Dec 2016ICML 2017 8arXiv:1612.05628archive 2025-07-28

Kavosh Asadi, Michael L. Littman

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.

PaperPDFConference PDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

grayswanai/nanogcg mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Universal and Transferable Adversarial Attacks on Aligned Language Models (arXiv:2307.15043; that paper's own run record: 39 ran (of which 7 constructed an object rather than computing a result; 19 with no instrument failure: 4 honoured, 1 violated, 14 with no contract checked; 20 where Syntology's instrument failed) · 22 unverified) and Accelerating Greedy Coordinate Gradient and General Prompt Optimization via Probe Sampling (arXiv:2403.01251; that paper's own run record: 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified); nothing checks that they implement this paper's method. report
sudh1976/ECE510_DeepLearning_Project mentioned on GitHubpytorchSyntology: not harvested report
thompsonj/nanoGCG mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Universal and Transferable Adversarial Attacks on Aligned Language Models (arXiv:2307.15043; that paper's own run record: 39 ran (of which 7 constructed an object rather than computing a result; 19 with no instrument failure: 4 honoured, 1 violated, 14 with no contract checked; 20 where Syntology's instrument failed) · 22 unverified); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Decision MakingReinforcement LearningReinforcement Learning (RL)Sequential Decision Makingreinforcement-learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Softmax

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections