SearcharxivSearch

arXiv · 2608.24730

Learning to Prefer Reliably: Error-Augmented Emotion Preference Optimization with Calibrated Fusion

Abstract

Emotion preference learning uses pairwise comparisons between candidate descriptions to align multimodal large language models (MLLMs) with human judgments of open-ended emotion descriptions and to train reward models that capture human emotional preferences. However, conventional pairwise supervision is often sparse, typically providing only a single negative description for each positive description, and therefore offers limited coverage of the diverse ways in which an emotion description can be incorrect. In particular, models may be insufficiently exposed to semantically fluent but emotionally inconsistent descriptions. Beyond this data-level limitation, relying on a single MLLM judge introduces a distinct model-level concern: its judgments can be affected by model-specific biases when interpreting fine-grained or ambiguous multimodal emotional cues. To address these limitations, we propose Error-Augmented Preference Optimization (EAPO), a framework for improving the reliability of MLLM-based emotion preference judgment at both the data and model levels. First, we construct an error-augmented dataset by generating multiple controlled and emotion-aware negative descriptions from each preferred description. We then adapt multiple independent MLLM judges to this richer supervision and aggregate their preference margins using margin-calibrated soft fusion, which maps heterogeneous margins to a common scale before aggregation. Experiments on the MER2026-EmoPrefer Challenge dataset and our error-augmented dataset demonstrate that EAPO improves emotion preference prediction and enhances the robustness of MLLM judges when evaluating fluent descriptions that conflict with the video's multimodal emotional evidence. Our code is available at https://github.com/slash1028/EAPO-EmoPrefer.

Explore related subjects

Keep this discovery

BibTeXRIS

Zilong Huang, Junyi Peng, Junjie Li, Kai Li, Wenze Ren, Kong Aik Lee, Man-Wai Mak, Tatsuya Kawahara. 2026-08-29. Learning to Prefer Reliably: Error-Augmented Emotion Preference Optimization with Calibrated Fusion. https://doi.org/10.1145/3840474.3840521

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related discoveries

A Conceptual Framework for Modeling Team Adaptation in Cooperative Games Through Ludic Knowledge

With the increasing importance of teamwork skills for modern workplaces, development of teamwork training programs has received substantial attention. Game-based teamwork training is one promising approach that is engaging, cost-effective, and well-suited to increasingly decentralized workplaces. However, design of effective game-based teamwork training requires understanding how a game elicits specific desired teamwork behaviors. Significant progress has been made in characterizing these relationships. However, despite its critical importance, little work has examined how a game's design influences team adaptability behaviors. This paper presents a preliminary framework for analyzing adaptability in cooperative games by conceptualizing adaptive stimuli as retrieval or disruption of players' ludic knowledge. We illustrate this framework through a qualitative case study that applies interaction analysis methods to gameplay videos of a Overcooked!, a cooperative cooking game. We examined instances where game events led to players altering their behavior and connected the game's design features that resulted in each event with three adaptive stimulus cue categories. Although exploratory and limited to a small case study of a single game, the proposed framework is grounded in established theories across teamwork research and game studies, and it offers an initial vocabulary for describing how cooperative games can be designed to create demands for team adaptation. With this continued development, the framework may provide an analytic tool to help inform the design and evaluation of purpose-built game-based teamwork training environments.

cs.HC

A Cyber-Physical Machine Tool Framework with a Real-Time Machining Process Digital Twin

Digital Twins (DTs) have emerged as a key technology for improving the monitoring, optimization, and automation of manufacturing systems. However, existing Cyber-Physical Machine Tool (CPMT) implementations primarily represent the machine tool, while the machining process remains only partially synchronized with its physical counterpart. This paper extends a previously presented CPMT framework by introducing a hierarchical DT framework that simultaneously maintains DTs of both the machine tool and the machining process. The proposed framework integrates real-time CNC operational data, a voxel-based workpiece representation, synchronized process vibration measurements, and a persistent part DT repository for process replay, traceability, and future synthetic data generation. Experimental evaluation demonstrated real-time operation at a 20 Hz machining-state update rate, interactive visualization exceeding 100 frames per second, and a mean depth reconstruction error of 0.16 mm. The implementation provides a foundation for AI-assisted machining applications while preserving the machine tool monitoring and teleoperation capabilities.

cs.HC

The Exact MMS Guarantees of EFX and PMMS

Envy-freeness up to any good (EFX) and pairwise maximin share (PMMS) are standard local fairness criteria for indivisible goods, whereas maximin share (MMS) is a global benchmark. We determine the exact quantitative relationship between these local fairness notions and the global MMS guarantee under nonnegative additive valuations. We show that the optimal universal factor for both notions is $ρ^{\mathrm{EFX}\to\mathrm{MMS}}=ρ^{\mathrm{PMMS}\to\mathrm{MMS}}=\frac{10}{17}$. We prove the lower bound by a combinatorial charging argument. After an initial reduction, both EFX and PMMS imply the same local condition on every foreign bundle from the perspective of a focal agent: deleting its least valuable good leaves value at most the focal bundle. A three-piece concave weight function translates this local condition into the global $10/17$ guarantee. We then construct an explicit family of complete allocations that are simultaneously PMMS and EFX$_0$, whose MMS ratios converge to $10/17$, showing that both constants are tight even in the presence of zero-valued goods. The argument also gives $α$-EFX $\Rightarrow (10α/17)$-MMS. Finally, we establish an exact correspondence between these fair-division guarantees and scheduling equilibria. For every fixed number of agents $n$, the EFX-to-MMS extremal ratio equals the reciprocal of the pure price of anarchy for selfish identical-machine covering. Similarly, the PMMS-to-MMS ratio equals the reciprocal of a locality gap based on exact pairwise machine repartition. These correspondences explain why the constant $10/17$ governs both problems.

cs.GT