AI 速览：作者提出首个面向多模态有状态交互的大规模多轮对话数据集 YANAMI-400K 与评测基准 YANAMI-Bench，并报告微调 BAGEL 后在图像编辑、生成与有状态交互上均有提升。
Unified Multimodal Models (UMMs) integrate visual understanding, generation, and editing within a single unified framework. However, existing unified multimodal datasets and benchmarks remain dominated by single-turn tasks. Even in recent multi-turn datasets, many turns can be solved independently without tracking information across turns. Consequently, they provide limited supervision and evaluation for multimodal stateful interaction, which requires models to understand, maintain, update, and faithfully realize evolving dialogue states across turns. To address this gap, we introduce YANAMI, the first large-scale multimodal dialogue dataset and benchmark for stateful interaction, comprising YANAMI-400K and YANAMI-Bench. YANAMI-400K contains 400K multi-turn multimodal dialogues, with more than 2M images and 2.6M dialogue turns. The dialogues span four representative scenarios: Multi-Image Fusion, Image Editing, World Modeling, and Visual Reasoning, and require models to continuously track, preserve, and revise evolving multimodal dialogue states across turns. YANAMI-Bench comprises 400 multi-turn dialogues for systematically evaluating multimodal stateful interaction. It jointly evaluates Dialogue State Understanding and Visual Realization, characterizing the gap between models' ability to understand evolving dialogue states and their ability to faithfully realize them in visual outputs. Experiments show that fine-tuning BAGEL on YANAMI-400K improves image editing, generation, and multimodal stateful interaction by 10.3%, 2.0%, and 13.23%, respectively, while preserving its general visual understanding capabilities. Evaluations on YANAMI-Bench further reveal that existing UMMs still struggle to maintain, update, and visually realize evolving multimodal dialogue states.
An image that is hard to classify on its own may have a helpful neighbor in the same unlabeled batch. Zero-shot vision-language models (VLMs) score images independently and leave this evidence unused. We study small unlabeled query batches with no labeled examples. Visual similarity can reflect pose or background, so it may connect images from different classes. Each image's scores over the class vocabulary offer another way to choose neighbors. We introduce Behavioral Affinity Transduction (BAT), which builds a sparse graph from these class-response profiles. The graph supplies neighbor evidence during prediction. For EM-Dirichlet, it also screens candidate classes and initializes assignments. BAT plugs into direct and iterative readouts of a frozen VLM. Across diverse datasets, BAT improves the mean accuracy of every tested readout. In the main RN50 comparison, soft and hard EM-Dirichlet gain $4.22$ and $2.72$ percentage points.
Xiucheng Wang, Nan Cheng, Zhisheng Yin, Conghao Zhou, Ruijin Sun
Dense low-Earth-orbit (LEO) networks increasingly reuse spectrum across moving satellites and overlapping beams, making a spatial radio map essential for interference diagnosis and coordination. Constructing such a map from sparse ground power measurements is difficult because the active satellite subset and its cardinality are unknown, candidate footprints can be highly coherent, and beam pointing, width, effective power, Doppler, and background must be inferred jointly. Known ephemerides do more than enumerate visible candidates. Propagated positions determine candidate-specific ranges, viewing geometry, and spatial footprints, while radial velocities induce distinct time-frequency signatures. Their joint spatial--Doppler structure rejects candidates whose geometry or time--frequency signature conflicts with the observations before continuous beam inference. SateBeam therefore screens all candidates through Doppler-resolved nonnegative fitting. GPU-accelerated grid correlations initialize continuous off-grid refinement; a Gamma-likelihood Bayesian information criterion (BIC) selects model cardinality, and backward deletion and exchange repair greedy support errors. Across paired real-ephemeris scenarios, SateBeam recovers the exact support in every case and reduces independent-query RMSE from $0.655$ to $0.050$ dB relative to orthogonal matching pursuit, with consistent advantages under model mismatch and larger candidate sets. The code is available at https://github.com/UNIC-Lab/SateBeam.
Shuai Zhen Beijing University of Posts and Telecommunications, Yanhua Yu Beijing University of Posts and Telecommunications, Ruopei Guo, Nan Cheng, Yang Deng Singapore Management University
Large language model (LLM) agents have demonstrated strong capabilities in complex interactive decision-making tasks. However, existing LLM agents typically rely on increasingly long interaction histories, resulting in high computational cost and limited scalability. In this paper, we propose STEP-HRL, a hierarchical reinforcement learning (HRL) framework that enables step-level learning by conditioning only on single-step transitions rather than full interaction histories. STEP-HRL structures tasks hierarchically, using completed subtasks to represent global progress of overall task. By introducing a local progress module, it also iteratively and selectively summarizes interaction history within each subtask to produce a compact summary of local progress. Together, these components yield augmented step-level transitions for both high-level and low-level policies. Experimental results on ScienceWorld and ALFWorld benchmarks consistently demonstrate that STEP-HRL substantially outperforms baselines in terms of performance and generalization while reducing token usage. Our code is available at https://github.com/TonyStark042/STEP-HRL.
尚无 AI 解读，展示原文摘要
cs.CL
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · 2026 · 正式发表