---
title: Emotion Similarity-Weighted Reward (ESWR)
url: https://www.emergentmind.com/topics/emotion-similarity-weighted-reward-eswr
type: topic
---

# Emotion Similarity-Weighted Reward (ESWR)

Searching arXiv for the cited papers to ground the article in current preprints.
Emotion Similarity-Weighted Reward (ESWR) is a reinforcement-learning reward-shaping mechanism introduced for generalized speech emotion recognition in the EMO-RL framework. Its central purpose is to replace brittle binary correctness signals with a psychologically structured reward that assigns partial credit to emotionally similar predictions, using Plutchik’s wheel of emotions as the similarity geometry. In the literature considered here, ESWR is explicit in EMO-RL, while adjacent mechanisms appear in open-vocabulary multimodal emotion recognition, empathetic dialogue, and cross-domain retrieval as related but non-identical forms of emotion-aware optimization [2509.15654] [2508.01318] [2507.03112] [2303.10539].

## 1. Emergence and problem setting

ESWR was proposed in response to a specific failure mode of applying generic RL objectives to Speech Emotion Recognition (SER): ordinary classification-style rewards are sparse and overly punitive when emotion categories have ambiguous boundaries. In the EMO-RL formulation, the conventional binary classification reward gives reward \(1\) only for an exact emotion match and \(0\) otherwise. The paper argues that this is poorly matched to affective structure, because some prediction errors are psychologically closer to the target than others. Its motivating example is that predicting “sad” instead of “neutral” is less severe than predicting “happy” instead of “angry” [2509.15654].

The paper further states that direct GRPO with binary rewards is too sparse for SER. On MELD, about \(60\%\) of accuracy rewards are \(0\), which makes policy updates unstable. This sparsity is especially problematic under ambiguous emotional boundaries and noisy annotations. ESWR is designed to densify the reward while preserving discriminative pressure, thereby turning reinforcement learning from a strict right-or-wrong supervision signal into an affect-aware signal grounded in inter-emotion similarity [2509.15654].

Within EMO-RL, ESWR is one of two central design components, the other being Explicit Structured Reasoning (ESR). The broader framework targets Large Audio-Language Models (LALMs), where the paper identifies two obstacles to direct RL application in SER: convergence instability caused by ambiguous emotional boundaries, and limited reasoning ability when using relatively small models such as \(7\)B-parameter architectures [2509.15654].

## 2. Formal definition

The mathematical core of ESWR is an emotion-state-transition matrix \(S \in \mathbb{R}^{C \times C}\), where \(C\) is the number of emotion classes. The matrix encodes pairwise similarity between emotions using Plutchik’s wheel. If either emotion is “neutral,” similarity is fixed to \(\frac{1}{2}\). Otherwise, similarity is computed from the angular distance on the wheel and normalized into \([0,1]\) through a cosine transform [2509.15654].

A concise rendering of the similarity definition is:

$$
S_{i,j} =
\begin{cases}
\frac{1}{2}, & \text{if either emotion is `neutral'} \\
\frac{1}{2}\left(\cos\left(\mathrm{Pl}(y_i,y_j)\right)+1\right), & \text{otherwise}
\end{cases}
$$

where \(y_i\) and \(y_j\) are emotion types and \(\mathrm{Pl}(y_i,y_j)\) denotes their angular distance on Plutchik’s wheel. The cosine term maps angular distance into a similarity score in \([0,1]\), and the special handling of “neutral” treats it as moderately similar or ambiguous rather than strongly aligned or opposed [2509.15654].

ESWR then converts similarity into a piecewise reward:

$$
\mathcal{R}_{\mathrm{ESWR}} =
\begin{cases}
1, & S(\hat{y}, y)=1 \\
\alpha \cdot S(\hat{y}, y), & S(\hat{y}, y)>\gamma \\
0, & S(\hat{y}, y)\le \gamma
\end{cases}
$$

where \(\hat{y}\) is the predicted emotion, \(y\) is the ground-truth emotion, \(\alpha\) is the partial-matching coefficient, and \(\gamma\) is the contradiction threshold. The paper sets \(\gamma = 0.7\), and \(\alpha\) is dynamically adjusted from \(1\) to \(0\) during training [2509.15654].

This definition establishes three reward regimes. Exact matches receive reward \(1\). Predictions that are sufficiently similar but not identical receive fractional reward \(\alpha \cdot S(\hat{y},y)\). Predictions that are emotionally contradictory or sufficiently dissimilar receive \(0\). ESWR is therefore not a globally continuous similarity reward; it is a thresholded partial-credit mechanism that preserves a hard exclusion region for low-similarity predictions [2509.15654].

## 3. Integration into GRPO-based optimization

EMO-RL is built on Group Relative Policy Optimization (GRPO) with emotion constraints. For each input state \(s=(x,Q)\), the policy samples a group of actions,

$$
a_i \sim \pi_\theta(a \mid x,Q), \quad i=1,2,\ldots,G,
$$

where each \(a_i\) is a full generated response containing reasoning and a final answer. Each sampled response receives a total reward defined as the sum of a format reward and an accuracy reward:

$$
\mathcal{R}(a_i)=\mathcal{R}_{\mathrm{format}}(a_i)+\mathcal{R}_{\mathrm{acc}}(a_i).
$$

Under ESWR-based training, the accuracy term becomes the emotion similarity-weighted reward, so \(\mathcal{R}_{\mathrm{acc}}(a_i)=\mathcal{R}_{\mathrm{ESWR}}\) [2509.15654].

The group reward is normalized into relative advantages:

$$
A_i=\frac{r_i-\operatorname{mean}\{r_1,r_2,\ldots,r_G\}}{\operatorname{std}\{r_1,r_2,\ldots,r_G\}},
$$

and these normalized advantages drive the GRPO update. The paper also states that the policy is constrained by KL divergence to a reference model \(\pi_{\mathrm{ref}}\), providing regularization against unstable drift [2509.15654].

In the full EMO-RL formulation, ESWR is coupled with a format reward that enforces valid reasoning/answer structure, and in the ESR setting the model must both follow the structured reasoning template and receive emotion-aware reward for the predicted label. This pairing is significant because it places ESWR within a composite reward design rather than treating emotion similarity as the sole optimization target. A common misconception is therefore to read ESWR as a standalone reward; in the implemented RL system it operates as the accuracy component of a broader reward function [2509.15654].

## 4. Empirical characterization

The main quantitative evidence for ESWR comes from controlled comparisons on MELD and IEMOCAP. On MELD, the paper reports the following progression: GRPO + IR achieves UA \(31.60\), WA \(55.41\), F1 \(33.22\); adding ESWR gives UA \(36.23\), WA \(63.85\), F1 \(38.57\); combining ESWR with ESR yields UA \(39.46\), WA \(69.56\), F1 \(41.87\). On IEMOCAP, the corresponding values are \(81.74/80.00/80.71\), then \(84.12/83.90/83.11\), then \(87.42/87.28/87.40\). These comparisons show that ESWR improves over GRPO even before the full reasoning enhancement is applied [2509.15654].

The reward-mechanism ablation on MELD isolates ESWR more directly. The paper reports: GRPO+IR with UA \(18.22\), WA \(38.32\), F1 \(18.96\); GRPO+EUR with \(25.55/49.12/26.36\); GRPO+ESR with \(29.19/53.53/30.61\); GRPO+BCR with \(33.62/55.42/35.57\); and GRPO+ESWR with \(35.02/62.93/37.73\). The specific comparison between GRPO+BCR and GRPO+ESWR is the clearest evidence that similarity-weighted reward contributes beyond ordinary binary correctness [2509.15654].

The paper also reports cross-dataset generalization improvements. When training on MELD and testing on RAVDESS, SAVEE, and IEMOCAP, GRPO+BCR improves modestly over SFT+IR, GRPO+ESWR improves more, and combining ESWR with ESR gives the best results overall. This suggests that ESWR is not merely increasing in-domain fit, but is helping the model internalize relations among emotion labels that transfer across datasets [2509.15654].

A plausible implication is that ESWR functions partly as reward densification and partly as inductive bias over emotional geometry. The empirical pattern is consistent with the paper’s claim that psychologically grounded partial credit reduces instability and promotes generalization, especially when exact category boundaries are ambiguous [2509.15654].

## 5. Adjacent formulations and terminological scope

The explicit term “Emotion Similarity-Weighted Reward” appears in EMO-RL, but several nearby works use related mechanisms that illuminate what ESWR is and is not.

| Work | Signal | Relation to ESWR |
|---|---|---|
| EMO-RL [2509.15654] | Thresholded similarity reward from Plutchik-based matrix \(S\) | Canonical ESWR formulation |
| AffectGPT-R1 [2508.01318] | EW-based accuracy reward plus format reward via GRPO | Close equivalent in spirit |
| RLVER [2507.03112] | Deterministic simulator emotion score \(e_t\), terminal \(e_T/100\) | Emotion-based reward, not similarity-weighted |
| EmoSim [2303.10539] | Similarity regularization term \(\lambda \mathcal{L}_{\text{EmoSim}}\) | Regularization analogue, not RL reward |

AffectGPT-R1 is the closest analogue. It does not introduce a separately named ESWR module, but it replaces token-level supervision with an EW-based accuracy reward taken directly from the official open-vocabulary emotion recognition protocol, combines it with a format reward, and optimizes the result with GRPO. The paper’s rationale is that token-level loss is misaligned with EW-based evaluation, and that EW-based metrics cannot be directly optimized via gradient backpropagation. Its reward is therefore evaluation-as-reward:

$$
R_{\text{accuracy}}(o,y \mid v,q)=\mathrm{EW}(o \rightarrow a, y),
$$

with total reward

$$
R(o,y \mid v,q)=R_{\text{accuracy}}(o,y \mid v,q)+\beta R_{\text{format}}(o \mid v,q).
$$

Because the EW metric gives partial credit according to closeness on the emotion wheel, the mechanism can reasonably be interpreted as emotion-similarity-weighted even though no explicit wheel-distance formula is exposed in the paper. AffectGPT-R1 reports a main comparison of \(62.52\) for AffectGPT versus \(66.35\) for AffectGPT-R1, and states that RL improves sampling quality and performance by more than \(3\%\) [2508.01318].

RLVER occupies a different position. It does not define ESWR and does not compare predicted and target emotions via a similarity kernel. Instead, it trains against a self-consistent affective user simulator that produces a deterministic emotion score \(e_t \in [0,100]\), with terminal reward normalized as \(r_\phi(x,y)=e_T/100\). Conceptually, this is an emotion-state reward or verifiable affective reward rather than a similarity-weighted reward [2507.03112].

The 2023 retrieval paper on textless speech-to-music retrieval is further removed from RL, but its Emotion Similarity Regularization (EmoSim) is a relevant precursor in functional terms. There, the model adds a similarity-matching loss,

$$
\mathcal{L}_{\text{EmoSim}} = \frac{1}{N}\sum_{i=1}^{N}\ell(S_i^y,S_i^z),
$$

and optimizes

$$
\mathcal{L}_{\text{Triplet+EmoSim}} = \mathcal{L}_{\text{Cross}} + \lambda \mathcal{L}_{\text{EmoSim}},
$$

with \(\lambda = 0.5\). EmoSim is not a reward in the RL sense, but it similarly preserves graded emotional neighborhood structure rather than treating labels as isolated categories [2303.10539].

## 6. Reproducibility, limitations, and interpretive boundaries

Several implementation details are essential for reproducing ESWR as reported in EMO-RL. The backbone model is Qwen2-Audio-7B-Instruct. RL training uses 8 NVIDIA RTX A6000 GPUs, per-device batch size \(1\), gradient accumulation \(2\), \(300\) optimization steps, learning rate \(1\times 10^{-6}\), softmax temperature \(1.0\), and \(6\) sampled responses per sample at each RL step. The contradiction threshold is \(\gamma = 0.7\), and \(\alpha\) decreases dynamically from \(1\) to \(0\) during training [2509.15654].

The paper also leaves several reproduction-relevant points underspecified. It does not fully spell out the schedule for \(\alpha\), so exact replication may require guesswork. The exact emotion categories and the full emotion-state-transition matrix are not printed explicitly, which means reconstruction must proceed from the dataset labels and Plutchik’s wheel. Neutral is treated specially with fixed similarity \(\frac{1}{2}\). The paper also notes higher inference and training complexity from using LALMs and RL [2509.15654].

These details delimit the scope of the method. ESWR is tailored to speech emotion labels and to a manually specified similarity geometry. It is therefore not a task-agnostic reward recipe. A plausible implication is that transfer to other affective tasks would require redefining the similarity structure, the contradiction threshold, and possibly the role of neutrality. The same boundary appears in AffectGPT-R1, where the closest ESWR-like mechanism delegates similarity structure to the official EW metric without exposing its internal geometry [2508.01318].

A further interpretive caution concerns nomenclature. In the literature surveyed here, “emotion similarity-weighted reward” is not yet a universal label for all emotion-aware reward shaping. The explicit ESWR name belongs to EMO-RL. AffectGPT-R1 uses an effectively equivalent EW-based partial-credit reward, RLVER uses deterministic simulator emotion scores without similarity matching, and EmoSim provides a loss-based rather than reward-based analogue. The common thread is alignment of optimization with graded affective structure, but the mechanisms differ in whether they operate over categorical similarity, simulator state, or embedding-space regularization [2509.15654] [2508.01318] [2507.03112] [2303.10539].

Source: https://www.emergentmind.com/topics/emotion-similarity-weighted-reward-eswr