Yining Wang
Author directoryOther people with similar names: Yining Wang, Yining Wang, Yining Wang
Unverified author pages with similar names: Yining Wang
2026
AEMAgent: Cognition-Inspired Active Memory Formation for Very-Long Video Understanding
Xian Zhao | Jiaming Zhang | Haonan Chu | Weihao Bo | Xu Chen | Delai Qiu | Yining Wang | Yi Zhang | Shengping Liu | Jian Yu | Jitao Sang
Findings of the Association for Computational Linguistics: EMNLP 2026
Xian Zhao | Jiaming Zhang | Haonan Chu | Weihao Bo | Xu Chen | Delai Qiu | Yining Wang | Yi Zhang | Shengping Liu | Jian Yu | Jitao Sang
Findings of the Association for Computational Linguistics: EMNLP 2026
Embodied AI and wearable assistants require agents to retrieve sparse evidence from continuous days-level videos. Existing memory-based methods typically follow a passive recording paradigm based on fixed-window captioning and periodic memory construction, which produces redundant memories and inefficient long-horizon reasoning. Inspired by human memory formation, we propose Active Explore Memory Agent (AEMAgent), which transforms passive recording into active memory formation by deciding when to remember, how to explore events, and when to reflect. These decisions are instantiated as a coherent pipeline: Surprise-guided Event Selection detects salient event changes for selective memory writing, Exploratory Episodic Memory Encoding enriches accepted events through self-questioning, Predictive-Coding-Guided Reflection updates knowledge from expectation-observation mismatches, and Semantic Memory Consolidation distills noisy episodic updates into compact long-term memory. Experiments on multiple benchmarks show that AEMAgent achieves the best overall performance among all compared methods while maintaining lower storage overhead than strong full-memory baselines, demonstrating the effectiveness of selective and efficient memory formation for scalable very-long video understanding.
Taming the Thinker: Conditional Entropy Shaping for Adaptive LLM Reasoning
Shuyu Wei | Jian Sun | Delai Qiu | Yining Wang | Shengping Liu | Jerry Liang | Ying Fu | Wei Huang | Jitao Sang
Findings of the Association for Computational Linguistics: EMNLP 2026
Shuyu Wei | Jian Sun | Delai Qiu | Yining Wang | Shengping Liu | Jerry Liang | Ying Fu | Wei Huang | Jitao Sang
Findings of the Association for Computational Linguistics: EMNLP 2026
Entropy-based deep reasoning has emerged as a promising direction for improving the reasoning capabilities of Large Language Models (LLMs), but existing methods often either increase response length indiscriminately or shorten responses at the cost of accuracy. To better balance this trade-off, we introduce Conditional Entropy Shaping (CES), a framework that dynamically controls token-level response entropy, enabling LLMs to produce concise solutions on simple problems while encouraging deeper exploration on hard ones. Built on DAPO, CES uses token-level entropy as an uncertainty signal and applies a conditional bidirectional policy: it penalizes high-entropy "forking point" tokens on correct reasoning paths to improve conciseness, and rewards them on incorrect paths to encourage exploration and error correction. We implement CES on DeepSeek-R1-Distill-Qwen-7B and evaluate it on 12 mathematical benchmarks. CES consistently improves average accuracy while reducing response length relative to DAPO, and supplementary experiments show similar trends on a smaller 1.5B backbone and on out-of-domain benchmarks.
Beyond Modality Collapse: Taming Guided Modality Entropy for Omni-modal Emotion Reasoning
Xian Zhao | Rui Hu | Yuxiang Zhang | Delai Qiu | Yining Wang | Shengping Liu | Jian Yu | Jitao Sang
Findings of the Association for Computational Linguistics: ACL 2026
Xian Zhao | Rui Hu | Yuxiang Zhang | Delai Qiu | Yining Wang | Shengping Liu | Jian Yu | Jitao Sang
Findings of the Association for Computational Linguistics: ACL 2026
Omni-modal Large Language Models (OLLMs) excel in diverse tasks but struggle with complex emotional reasoning, which requires integrating textual, visual, and acoustic signals. We attribute this limitation to modality collapse, where models over-rely on a dominant modality while neglecting complementary cues. To address this issue, we introduce OmniCoT, a data paradigm that interleaves guided tokens (e.g., [vision], [audio]) into reasoning traces to enforce structured evidence extraction. To further internalize the reasoning behaviors instilled by OmniCoT and facilitate adaptive modality prioritization, we propose Dynamic Modality-Entropy GRPO (DyME-GRPO), which utilizes entropy-based uncertainty estimates over Guided Tokens (GTs) to regulate modality usage, thereby mitigating collapse and informational redundancy. By applying supervised fine-tuning with OmniCoT followed by DyME-GRPO, we develop EmoOmni based on the Qwen2.5-Omni-7B backbone. Extensive experiments demonstrate that EmoOmni achieves state-of-the-art performance on multiple emotion recognition and reasoning benchmarks while preserving the general capabilities of the base model. These findings highlight the potential of our work for omni-modal reasoning across a broader range of complex tasks.
FocalOrder: Focal Preference Optimization for Reading Order Detection
Fuyuan Liu | Dianyu Yu | He Ren | Nayu Liu | Xiaomian Kang | Delai Qiu | Fa Zhang | Genpeng Zhen | Shengping Liu | Liang Jiaen | Weihuang | Yining Wang | Junnan Zhu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Fuyuan Liu | Dianyu Yu | He Ren | Nayu Liu | Xiaomian Kang | Delai Qiu | Fa Zhang | Genpeng Zhen | Shengping Liu | Liang Jiaen | Weihuang | Yining Wang | Junnan Zhu
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Reading order detection is the foundation of document understanding.Most existing methods rely on uniform supervision, implicitly assuming a constant difficulty distribution across layout regions. In this work, we challenge this assumption by revealing a critical flaw: Positional Disparity, a phenomenon where models demonstrate mastery over the deterministic start and end regions but suffer a performance collapse in the complex intermediate sections.This degradation arises because standard training allows the massive volume of easy patterns to drown out the learning signals from difficult layouts.To address this, we propose FocalOrder, a framework driven by Focal Preference Optimization (FPO).Specifically, FocalOrder employs adaptive difficulty discovery with exponential moving average mechanism to dynamically pinpoint hard-to-learn transitions, while introducing a difficulty-calibrated pairwise ranking objective to enforce global logical consistency.Extensive experiments demonstrate that FocalOrder establishes new state-of-the-art results on OmniDocBench v1.0 and Comp-HRDoc.Our compact model not only outperforms competitive specialized baselines but also significantly surpasses large-scale general VLMs.These results demonstrate that aligning the optimization with intrinsic structural ambiguity of documents is critical for mastering complex document structures.
VAPO: End-to-end Slide-Enhanced Speech Recognition with Omni-modal Large Language Models
Rui Hu | Delai Qiu | Yining Wang | Shengping Liu | Jitao Sang
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Rui Hu | Delai Qiu | Yining Wang | Shengping Liu | Jitao Sang
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Omni-modal large language models (OLLMs) offer a promising end-to-end solution for slide-enhanced speech recognition due to their inherent multimodal capabilities. However, we found a fundamental issue faced by OLLMs: Visual Interference, where models show a bias towards visible text over auditory signals, causing them to hallucinate slide content that was never spoken. To address this, we propose Visually-Anchored Policy Optimization (VAPO), which aims to reshape models’ inference process to follow the human-like “Look-then-Listen” inference chain. Specifically, we design a temporally decoupled policy: the model first extracts visual priors in a think> block to serve as semantic anchors, then generates the transcription in an answer> block. The policy is optimized via multi-objective reinforcement learning. Furthermore, we introduce SlideASR-Bench, a comprehensive benchmark designed to address the scarcity of entity-rich data, comprising a large-scale synthetic corpus for training and a challenging real-world test set for evaluation. We conduct extensive evaluations demonstrating that VAPO effectively eliminates visual interference and achieves state-of-the-art performance on SlideASR-Bench and public datasets, significantly reducing entity recognition errors in specialized domains.
GuideTree: Guideline-Induced Review Trees for Long Medical Records
Chengze Ge | Ruiqing Zhang | Yining Wang | Shengping Liu | Liang Jiaen | Weihuang | Weihua Chen
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 6: Industry Track)
Chengze Ge | Ruiqing Zhang | Yining Wang | Shengping Liu | Liang Jiaen | Weihuang | Weihua Chen
Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 6: Industry Track)
Reviewing medical records for clinical and insurance decisions must handle long, heterogeneous documents while producing consistent, traceable, guideline-compliant outcomes under strict latency and cost constraints. We propose GuideTree, which compiles textual guidelines into a fixed review tree of evidence-grounded verification primitives. GuideTree uses short per-document summaries only for routing each check to a minimal set of document types and candidates; final verification always reads full document text and returns structured evidence. The tree is induced offline via a cost-aware split-and-prune search and updated safely through regression-tested, versioned patches. Across 1,000 cases from four industrial review scenarios and four LLM backbones, GuideTree achieves 84.5–92.8 Macro-F1, outperforming the strongest non-expert baselines by 3.3–7.6 points and matching ExpertTree within 0.2–0.6 points (avg. 0.38). On chronic disease with Qwen3-235B-A22B-Instruct, GuideTree reduces average I/O volume to 74K input+output characters (-82% vs. long-context prompting) and average latency to 22s (-83% vs. long-context prompting), while reaching 99% decision consistency over K=5 reruns.
2025
Investigating and Enhancing Vision-Audio Capability in Omnimodal Large Language Models
Rui Hu | Delai Qiu | Shuyu Wei | Jiaming Zhang | Yining Wang | Shengping Liu | Jitao Sang
Findings of the Association for Computational Linguistics: ACL 2025
Rui Hu | Delai Qiu | Shuyu Wei | Jiaming Zhang | Yining Wang | Shengping Liu | Jitao Sang
Findings of the Association for Computational Linguistics: ACL 2025
Omnimodal Large Language Models (OLLMs) have shown significant progress in integrating vision and text, but still struggle with integrating vision and audio, often exhibiting suboptimal performance when processing audio queries compared to text queries. This disparity is primarily due to insufficient alignment between vision and audio modalities during training, leading to inadequate attention to visual information when using audio queries. To mitigate this issue, we propose a Self-Knowledge Distillation (Self-KD) training method where the vision-text component of the OLLM serves as the teacher and the vision-audio component as the student. This enables the model to process audio in a manner analogous to its text processing. Our experimental results demonstrate that Self-KD is an effective method for enhancing the vision-audio capabilities of OLLMs by learning from the vision-text components, which subsequently improves the interaction between audio and images and results in improved performance on multimodal tasks.
TROVE: A Challenge for Fine-Grained Text Provenance via Source Sentence Tracing and Relationship Classification
Junnan Zhu | Min Xiao | Yining Wang | Feifei Zhai | Yu Zhou | Chengqing Zong
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Junnan Zhu | Min Xiao | Yining Wang | Feifei Zhai | Yu Zhou | Chengqing Zong
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
LLMs have achieved remarkable fluency and coherence in text generation, yet their widespread adoption has raised concerns about content reliability and accountability. In high-stakes domains, it is crucial to understand where and how the content is created. To address this, we introduce the Text pROVEnance (TROVE) challenge, designed to trace each sentence of a target text back to specific source sentences within potentially lengthy or multi-document inputs. Beyond identifying sources, TROVE annotates the fine-grained relationships (quotation, compression, inference, and others), providing a deep understanding of how each target sentence is formed.To benchmark TROVE, we construct our dataset by leveraging three public datasets covering 11 diverse scenarios (e.g., QA and summarization) in English and Chinese, spanning source texts of varying lengths (0–5k, 5–10k, 10k+), emphasizing the multi-document and long-document settings essential for provenance. To ensure high-quality data, we employ a three-stage annotation process: sentence retrieval, GPT-4o provenance, and human provenance. We evaluate 11 LLMs under direct prompting and retrieval-augmented paradigms, revealing that retrieval is essential for robust performance, larger models perform better in complex relationship classification, and closed-source models often lead, yet open-source models show significant promise, particularly with retrieval augmentation. We make our dataset available here: https://github.com/ZNLP/ZNLP-Dataset.
Cracking Factual Knowledge: A Comprehensive Analysis of Degenerate Knowledge Neurons in Large Language Models
Yuheng Chen | Pengfei Cao | Yubo Chen | Yining Wang | Shengping Liu | Kang Liu | Jun Zhao
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Yuheng Chen | Pengfei Cao | Yubo Chen | Yining Wang | Shengping Liu | Kang Liu | Jun Zhao
Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
Knowledge neuron theory provides a key approach to understanding the mechanisms of factual knowledge in Large Language Models (LLMs), which suggests that facts are stored within multi-layer perceptron neurons. This paper further explores Degenerate Knowledge Neurons (DKNs), where distinct sets of neurons can store identical facts, but unlike simple redundancy, they also participate in storing other different facts. Despite the novelty and unique properties of this concept, it has not been rigorously defined and systematically studied. Our contributions are: (1) We pioneer the study of structures in knowledge neurons by analyzing weight connection patterns, providing a comprehensive definition of DKNs from both functional and structural aspects. (2) Based on this definition, we develop the Neuronal Topology Clustering method, leading to a more accurate DKN identification. (3) We demonstrate the practical applications of DKNs in two aspects: guiding LLMs to learn new knowledge and relating to LLMs’ robustness against input errors.
Search
Fix author
Co-authors
- Shengping Liu 8
- Delai Qiu 6
- Jitao Sang (桑基韬) 5
- Rui Hu 3
- Weihuang 3
- Liang Jiaen 2
- Shuyu Wei 2
- Jian Yu (于剑) 2
- Jiaming Zhang 2
- Xian Zhao 2
- Junnan Zhu 2
- Weihao Bo 1
- Pengfei Cao (鹏飞 曹) 1
- Weihua Chen 1
- Xu Chen 1
- Yubo Chen 1
- Yuheng Chen 1
- Haonan Chu 1
- Ying Fu 1
- Chengze Ge 1
- Xiaomian Kang 1
- Jerry Liang 1
- Fuyuan Liu 1
- Kang Liu 1
- Nayu Liu 1
- He Ren 1
- Jian Sun 1
- Min Xiao 1
- Dianyu Yu 1
- Feifei Zhai 1
- Fa Zhang 1
- Ruiqing Zhang 1
- Yi Zhang 1
- Yuxiang Zhang 1
- Jun Zhao 1
- Genpeng Zhen 1
- Yu Zhou 1
- Chengqing Zong 1