用复杂推理统一处理情感分析中的多类型标签难题。
NTDH: Complex Reasoning for Comprehensive Affective Analysis
- 将情感分析重构为需推理的复杂任务,统一不同输出格式
- 仅用1.6万条数据即超越多数指令调优系统,皮尔逊相关率达0.862
- 提出四类数据生成机制,有效避免错误信息泄露与误判
全面情感分析面临两大挑战:预测任务多样,涉及连续、序数和多标签输出;且情感意义依赖上下文,需协调矛盾线索而非直接映射标签。现有方法直接学习映射,未显式建模协调过程。本文将任务重新构想为复杂推理问题,实现跨异构标签空间的统一输出接口,并在推理轨迹上优化可验证奖励;据知这是首次涵盖情感与情绪的统一处理。难点在于数据:情感推理轨迹需合成,通用合成方式与情感目标、容差及现象不匹配,且会丢弃或泄露失败案例。为此提出NTDH,通过自然化设定训练答案为真实标签,确保正确性;容差感知门控检查每步答案是否符合任务评分阈值;领域感知策略引入情感科学思想优化推理;方向提示仅报告错误类型与方向,不暴露目标。使用16,302条训练样本(约仅为同类系统的1/14),以Qwen3-8B为基础进行SFT与GRPO训练,多标签子任务放宽构造门控。组件消融实验量化各模块对数据质量的影响。最终策略在六项官方测试指标中五项优于SFT基线,情感-情绪回归任务达到最强结果,皮尔逊相关系数为0.862。
原文摘要 · Abstract (English)
Comprehensive affective analysis is challenging for two reasons: it spans heterogeneous prediction tasks with continuous, ordinal, and multi-label outputs, and affective meaning is context-dependent, requiring conflicting cues to be reconciled rather than mapped directly to labels. Existing methods learn this mapping directly and do not model the reconciliation explicitly. We recast the task as a complex-reasoning problem, which yields one output interface across heterogeneous label spaces and a trajectory over which a verifiable reward can be optimised; to our knowledge, this is the first such treatment covering both sentiment and emotion. The obstacle is on the data side: affective reasoning traces must be synthesised, and generic synthesis is misaligned with the targets, tolerances, and phenomena of affect, and discards or leaks its failure cases. We propose NTDH, which addresses these four failures. Naturalisation sets the training answer to the gold label, so it is correct by construction. A Tolerance-aware gate checks each answer against the task's own scoring margin. Domain-aware strategies refine the reasoning using ideas from affective science. Directional Hints report only the type and direction of an error, without exposing the target. We train Qwen3-8B with SFT and then GRPO under the same tolerance used for verification (up to a more permissive construction gate on the multi-label subtask), and a component ablation quantifies the data-quality effect of each part. Using 16,302 training records, about 14x fewer than comparable instruction-tuned systems, the final policy improves over its SFT checkpoint on five of six official-test metrics and achieves the strongest EI-reg result among the compared systems, at a Pearson correlation of 0.862.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。