Timezone: »

An Alternative Softmax Operator for Reinforcement Learning
Kavosh Asadi · Michael L. Littman

Mon Aug 07 01:30 AM -- 05:00 AM (PDT) @ Gallery #70

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.

Author Information

Kavosh Asadi (Brown University)
Michael L. Littman (Brown University)

Related Events (a corresponding poster, oral, or spotlight)

More from the Same Authors