Papers by Jun Lin

Dynamic Sampling that Adapts: Self-Aware Iterative Data Persistent Optimization for Mathematical Reasoning (2026.findings-acl)

Challenge:	SpanBERT model is more robust than RoBERTa, despite having similar accuracy on unperturbed test data.
Approach:	They propose a pipeline to replace entity names with names from a variety of sources.
Outcome:	The proposed model performs worse when entities are renamed, the authors show . SpanBERT, which is pretrained with span-level masking, is more robust than RoBERTa .

Copied to clipboard

Jun Rao, Xuebo Liu, Hexuan Deng, Zepeng Lin, Zixiong Yu, Jiansheng Wei, Xiaojun Meng, Min Zhang

Reasoning

Challenge:	Current data selection paradigms rely on static, externally defined metrics, which fail to adapt to the evolving capabilities of models during training.
Approach:	They propose a dynamic sampling framework that aligns training data with the model's intrinsic competence by iterating on real-time feedback.
Outcome:	Extensive experiments on eight benchmarks show that SAI-DPO outperforms static baselines at most nearly 6 points, achieving state-of-the-art efficiency with significantly less data.

Global Structure Knowledge-Guided Relation Extraction Method for Visually-Rich Document (2023.findings-emnlp)

Copied to clipboard

Xiangnan Chen, Qian Xiao, Juncheng Li, Duo Dong, Jun Lin, Xiaozhong Liu, Siliang Tang

Information Extraction & Text Mining

Challenge:	Existing methods focus on manipulating entity features to find pairwise relations, yet neglect the more fundamental structural information that links disparate entity pairs together.
Approach:	They propose a Visual Relation Extraction framework that generates relation predictions on entity pairs extracted from scanned images and incorporates global structural knowledge into the representations of the entities.
Outcome:	The proposed framework outperforms existing methods in fine-tuning setting and yields stronger data-efficient performance in the low-resource setting.

WebNovelBench: Placing LLM Novelists on the Web Novel Distribution (2026.findings-eacl)

Copied to clipboard

Liangtao Lin, Jun Zheng, Haidong Wang

Text Generation

Challenge:	Existing benchmarks for long-form novel generation lack scale, diversity, or objective measures.
Approach:	They propose a framework that assesses long-form novel generation using an LLM-as-Judge approach.
Outcome:	The proposed framework differentiates between human-written masterpieces, popular web novels, and LLM-generated content.

Selecting Demonstrations for Many-Shot In-Context Learning via Gradient Matching (2025.findings-acl)

Copied to clipboard

Jianfei Zhang, Bei Li, Jun Bai, Rumei Li, Yanmeng Wang, Chenghua Lin, Wenge Rong

CoMoL: Efficient Mixture of LoRA Experts via Dynamic Core Space Merging (2026.findings-acl)

Challenge:	In-Context Learning (ICL) empowers Large Language Models for rapid task adaptation without fine-tuning.
Approach:	They propose a method that aligns fine-tuning gradients between entire training set and selected examples to enable in-context learning and fine-uning.
Outcome:	The proposed method outperforms random selection on large LLMs from 4-shot to 128-shot scenarios across 9 datasets.

Copied to clipboard

Jie Cao, Zhenxuan Fan, Zhuonan Wang, Tianwei Lin, Ziyuan Zhao, Rolan Yan, Wenqiao Zhang, Feifei Shao, Hongwei Wang, Jun Xiao, Siliang Tang

Green & Sustainable NLP

Challenge:	Existing PEFT methods suffer from limited parameter efficiency and coarse-grained adaptation due to proliferation of LoRA experts and instance-level routing.
Approach:	They propose a new MoE-LoRA framework that incorporates expert diversity, parameter efficiency, and fine-grained adaptation.
Outcome:	The proposed framework outperforms existing methods on multiple tasks while maintaining parameter efficiency.

WR-One2Set: Towards Well-Calibrated Keyphrase Generation (2022.emnlp-main)

Copied to clipboard

Binbin Xie, Xiangpeng Wei, Baosong Yang, Huan Lin, Jun Xie, Xiaoli Wang, Min Zhang, Jinsong Su

Text Generation

Challenge:	Experimental results show that keyphrase generation has serious calibration errors . ONE2SET generates short phrases summarizing an input document .
Approach:	They propose a paradigm for keyphrase generation that generates short phrases summarizing an input document.
Outcome:	The proposed model over-estimates tokens and makes it well-calibrated on common datasets.

Scalable Multi-Hop Relational Reasoning for Knowledge-Aware Question Answering (2020.emnlp-main)

Copied to clipboard

Yanlin Feng, Xinyue Chen, Bill Yuchen Lin, Peifeng Wang, Jun Yan, Xiang Ren

Question Answering

Challenge:	Existing work on augmenting question answering models with external knowledge (e.g., knowledge graphs) lacks transparency into the model’s prediction rationale.
Approach:	They propose a knowledge-aware approach that equips pre-trained language models with a multi-hop relational reasoning module that performs multi-relational reasoning over subgraphs extracted from external knowledge graphs.
Outcome:	The proposed model performs multi-hop, multi-relational reasoning over subgraphs extracted from external knowledge graphs.

Transfer Learning for Context-Aware Question Matching in Information-seeking Conversations in E-commerce (P18-2)

Copied to clipboard

Minghui Qiu, Liu Yang, Feng Ji, Wei Zhou, Jun Huang, Haiqing Chen, Bruce Croft, Wei Lin

HammerBench: Fine-Grained Function-Calling Evaluation in Real Mobile Assistant Scenarios (2025.findings-acl)

Challenge:	Recent researches focus on deep learning and reinforcement learning for multi-turn information seeking conversation systems.
Approach:	They propose an efficient and effective multi-turn conversation model based on convolutional neural networks and extend it to adapt the knowledge learned from a resource-rich domain to enhance the performance.
Outcome:	The proposed model performs better than the existing model on an industrial chatbot called AliMe Assist.

Copied to clipboard

Jun Wang, Jiamu Zhou, Xihuai Wang, Xiaoyun Mo, Haoyu Zhang, Qiqiang Lin, Jincheng Jincheng, Muning Wen, Weinan Zhang, Qiuying Peng, Jun Wang

A Semantic Mention Graph Augmented Model for Document-Level Event Argument Extraction (2024.lrec-main)

Challenge:	Evaluating the performance of LLMs in multi-turn interactions presents significant challenges due to the complexity and variability of user behavior.
Approach:	They propose a benchmark framework for assessing LLMs’ function-calling capabilities in multi-turn dialogues.
Outcome:	The proposed framework is based on a dataset derived from popular mobile apps and anonymized user logs.

Copied to clipboard

Jian Zhang, Changlin Yang, Haiping Zhu, Qika Lin, Fangzhi Xu, Jun Liu

IntactKV: Improving Large Language Model Quantization by Keeping Pivot Tokens Intact (2024.findings-acl)

Challenge:	Document-level Event Argument Extraction (DEAE) aims to identify arguments and their specific roles from unstructured document.
Approach:	They propose a document-prompt-based method for document-level event argument extraction that uses a semantic mention graph to capture relations between documents and prompts.
Outcome:	The proposed method surpasses baseline methods and achieves state-of-the-art performance on RAMS and WikiEvents datasets.

Copied to clipboard

Ruikang Liu, Haoli Bai, Haokun Lin, Yuening Li, Han Gao, Zhengzhuo Xu, Lu Hou, Jun Yao, Chun Yuan

A Diffusion Model for Event Skeleton Generation (2023.findings-acl)

Challenge:	Existing quantization methods are compromising performance of large language models (LLMs) despite their high computational intensity, LLMs are still demanding intensive computation.
Approach:	They propose to generate the KV cache of pivot tokens losslessly from the full-precision model.
Outcome:	The proposed method generates the KV cache of pivot tokens losslessly from the full-precision model with no extra inference overhead.

Copied to clipboard

Fangqi Zhu, Lin Zhang, Jun Gao, Bing Qin, Ruifeng Xu, Haiqin Yang

Structured Data in NLP

Challenge:	Existing methods for event schema generation are noise-sensitive and error-accumulating, e.g., inability to correct errors while generating schema.
Approach:	They propose a novel diffusion event graph model that embeds and roundes event graphs into learnable latent representations and a denoising process to maintain the model's robustness.
Outcome:	The proposed model achieves better results than existing state-of-the-art models on three IED bombing datasets.

Dual-Reasoner: Bridging Interleaved Atomicity and Streaming Latency via Thinking-while-Talking (2026.findings-acl)

Copied to clipboard

Yangzhuo Li, Shengpeng Ji, Yifu Chen, Tianle Liang, Haoyu Yang, null Junboli, Jun Fang, Lin Li, Qingyang Hong

MUR: Momentum Uncertainty guided Reasoning for Large Language Models (2026.acl-long)

Challenge:	Existing methods to integrate Chain-of-Thought into spoken dialogue models incur prohibitive latency.
Approach:	They propose a Streaming Masking Mechanism to ensure uninterrupted audio streaming . they use a quadruple-constraint system to reconstruct logical atomicity .
Outcome:	Experimental results show that Dual-Reasoner improves speech generation performance with low latency.

Copied to clipboard

Hang Yan, Fangzhi Xu, Rongman Xu, Yifei Li, Jian Zhang, Haoran Luo, Xiaobao Wu, Anh Tuan Luu, Haiteng Zhao, Qika Lin, Jun Liu

Using Customer Service Dialogues for Satisfaction Analysis with Context-Assisted Multiple Instance Learning (D19-1)

Challenge:	Existing methods for optimizing reasoning quality are limited by overthinking.
Approach:	They propose a method that allocates thinking budgets to critical reasoning steps by tracking and aggregating step-wise uncertainty over time.
Outcome:	The proposed method reduces computation by over 45% on average while improving accuracy by 0.33–3.46%.

Copied to clipboard

Kaisong Song, Lidong Bing, Wei Gao, Jun Lin, Lujun Zhao, Jiancheng Wang, Changlong Sun, Xiaozhong Liu, Qiong Zhang

Disentangling Preference Representation and Text Generation for Efficient Individual Preference Alignment (2025.coling-main)

Challenge:	Existing studies fail to provide comprehensive service satisfaction analysis . Existing models fail to include satisfaction polarity classification and sentimental utterance identification .
Approach:	They propose a model that predicts customer sentiments and aggregates them into service satisfaction polarity.
Outcome:	The proposed model predicts customer sentiments and aggregates them into service satisfaction polarity and reasoning clues.

Copied to clipboard

Jianfei Zhang, Jun Bai, Bei Li, Yanmeng Wang, Rumei Li, Chenghua Lin, Wenge Rong

TECHS: Temporal Logical Graph Networks for Explainable Extrapolation Reasoning (2023.acl-long)

Challenge:	Human values are inherently diverse, making it insufficient to align LLMs solely with general preferences.
Approach:	They propose a flexible paradigm for individual preference alignment that disentangles preference representation from text generation in LLMs.
Outcome:	The proposed method produces aligned quality and better than PEFT-based methods while reducing training time for each new individual preference by 80% to 90%.

Copied to clipboard

Qika Lin, Jun Liu, Rui Mao, Fangzhi Xu, Erik Cambria

OpenS2S: Advancing Fully Open-Source End-to-End Empathetic Large Speech Language Model (2025.emnlp-demos)

Challenge:	Existing frameworks for extrapolating knowledge graphs are incomplete and do not represent real-world knowledge.
Approach:	They propose an explainable extrapolation reasoning framework that integrates propositional reasoning and first-order reasoning by introducing a reasoning graph that iteratively expands to find the answer.
Outcome:	The proposed framework outperforms state-of-the-art baselines in explaining future facts based on past counterparts.

Copied to clipboard

Chen Wang, Tianyu Peng, Wen Yang, YiNan Bai, Guangfu Wang, Jun Lin, Lanpeng Jia, Lingxiang Wu, Jinqiao Wang, Chengqing Zong, Jiajun Zhang

How to Determine the Most Powerful Pre-trained Language Model without Brute Force Fine-tuning? An Empirical Survey (2023.findings-emnlp)

Challenge:	Empathetic speech models are increasingly closed off, leaving details about the architecture, data and development opaque to researchers.
Approach:	They propose an open-source empathetic speech-to-text model with a streaming interleaved decoding architecture and a data pipeline to enable end-to end training.
Outcome:	The proposed model is open-source and transparent, with no data or data required to build it.

Copied to clipboard

Jun Bai, Xiaofeng Zhang, Chen Li, Hanhua Hong, Xi Xu, Chenghua Lin, Wenge Rong

APT: Improving Specialist LLM Performance with Weakness Case Acquisition and Iterative Preference Training (2025.findings-acl)

Challenge:	Transferability estimation has been a topic of great interest in computer vision fields . a lack of a comprehensive comparison between these estimation methods is a problem .
Approach:	They conduct a thorough survey of existing methods to find the most suitable model . they also outline difficulties of consideration of training details and applicability to text generation .
Outcome:	The proposed methods perform well with superiorities in effectiveness and efficiency.

Copied to clipboard

Jun Rao, Zepeng Lin, Xuebo Liu, Xiaopeng Ke, Lian Lian, Dong Jin, Shengjun Cheng, Jun Yu, Min Zhang

Can Large Language Models Grasp Legal Theories? Enhance Legal Reasoning with Insights from Multi-Agent Collaboration (2024.findings-emnlp)

Challenge:	Large Language Models often require domain-specific fine-tuning to address targeted tasks, which risks degrading their general capabilities.
Approach:	They propose to use self-generated dis-preferred weakness data to enhance model performance with a targeted training approach that minimizes interference with existing knowledge base.
Outcome:	The proposed approach ensures no reduction in generic capacity and achieves superior performance on downstream tasks compared to existing methods.

Copied to clipboard

Weikang Yuan, Junjie Cao, Zhuoren Jiang, Yangyang Kang, Jun Lin, Kaisong Song, Tianqianjin Lin, Pengwei Yan, Changlong Sun, Xiaozhong Liu

RED: Unleashing Token-Level Rewards from Holistic Feedback via Reward Redistribution (2025.emnlp-main)

Challenge:	Existing studies have found that when LLMs are given criminal facts and legal rules, then asked whether cases constitute a certain charge, they struggle to understand legal theories and perform basic legal reasoning tasks.
Approach:	They propose a task to assess LLMs' understanding of legal theories and reasoning capabilities by using a novel framework: Multi-Agent framework for improving complex legal reasoning capability.
Outcome:	The proposed framework improves LLMs' understanding of legal theories and reasoning abilities in real-world scenarios.

Copied to clipboard

Jiahui Li, Lin Li, Tai-Wei Chang, Kun Kuang, Long Chen, Jun Zhou, Cheng Yang

EasyNLP: A Comprehensive and Easy-to-use Toolkit for Natural Language Processing (2022.emnlp-demos)

Challenge:	Experimental results demonstrate the superiority of our approach to aligning large language models with human preferences.
Approach:	They propose a method that evaluates and assigns specific credit to each token using an off-the-shelf reward model.
Outcome:	The proposed method evaluates and assigns specific credit to each token using an off-the-shelf reward model.

Copied to clipboard

Chengyu Wang, Minghui Qiu, Taolin Zhang, Tingting Liu, Lei Li, Jianing Wang, Ming Wang, Jun Huang, Wei Lin

Specificity-Driven Cascading Approach for Unsupervised Sentiment Modification (D19-1)

Challenge:	Pre-Trained Models (PTMs) have reshaped the development of natural language processing (NLP) but it is not easy to obtain high-performing PTMs without a large amount of labeled training data and deploy them online with fast inference speed.
Approach:	They propose to make it easy to build NLP applications with knowledge-enhanced pre-training and knowledge distillation.
Outcome:	EasyNLP supports a comprehensive suite of NLP algorithms and features knowledge-enhanced pre-training, knowledge distillation and few-shot learning functionalities.

Copied to clipboard

Pengcheng Yang, Junyang Lin, Jingjing Xu, Jun Xie, Qi Su, Xu Sun

Sentiment Analysis

Challenge:	Existing methods for unsupervised sentiment modification lack specific information in text generated without parallel data . specificity-driven cascading approach can improve specificity of generated text and content preservation .
Approach:	They propose a specificity-driven cascading approach for unsupervised sentiment modification . the method performs target sentiment addition and content reconstruction independently .
Outcome:	The proposed method outperforms competitive systems by a large margin on Yelp and Amazon datasets.

LLaDA 1.5: Variance-Reduced Preference Optimization for Large Language Diffusion Models (2026.acl-long)

Copied to clipboard

Fengqi Zhu, Rongzhen Wang, Shen Nie, Xiaolu Zhang, Chunwei Wu, Jun Zhou, Yankai Lin, Ji-Rong Wen, Chongxuan Li

Towards Effective and Efficient Continual Pre-training of Large Language Models (2025.acl-long)

Challenge:	Masked diffusion language models have achieved significant progress in language modeling . however, the systematic analysis and empirical validation of their alignment on general tasks remains underexplored.
Approach:	They propose a framework that analyzes the bias and variance of preference optimization loss and gradient based on Direct Preference Optimization.
Outcome:	The proposed model outperforms its SFT-only predecessor on general benchmarks . it consistently outperformed other strong language models and ARMs on general tasks .

Copied to clipboard

Jie Chen, Zhipeng Chen, Jiapeng Wang, Kun Zhou, Yutao Zhu, Jinhao Jiang, Yingqian Min, Xin Zhao, Zhicheng Dou, Jiaxin Mao, Yankai Lin, Ruihua Song, Jun Xu, Xu Chen, Rui Yan, Zhewei Wei, Di Hu, Wenbing Huang, Ji-Rong Wen

Rapid Diffusion: Building Domain-Specific Text-to-Image Synthesizers with Fast Inference Speed (2023.acl-industry)

Challenge:	Continual pre-training (CPT) has been an important approach for adapting language models to specific domains or tasks.
Approach:	They propose a Continual pre-training method that can greatly improve Chinese language ability and scientific reasoning ability of LLMs.
Outcome:	The proposed method can greatly improve Chinese language ability and scientific reasoning ability of LLMs.

Copied to clipboard

Bingyan Liu, Weifeng Lin, Zhongjie Duan, Chengyu Wang, Wu Ziheng, Zhang Zipeng, Kui Jia, Lianwen Jin, Cen Chen, Jun Huang

Symbol-LLM: Towards Foundational Symbol-centric Interface For Large Language Models (2024.acl-long)

Challenge:	Text-to-Image Synthesis (TIS) aims to generate images based on textual inputs . but, current diffusion-based models lack entity knowledge and low inference speed .
Approach:	They propose a framework for training and deploying latent diffusion models with rich entity knowledge injected and optimized networks.
Outcome:	The proposed framework improves image quality and inference speed and can be used in industrial applications.

Copied to clipboard

Fangzhi Xu, Zhiyong Wu, Qiushi Sun, Siyu Ren, Fei Yuan, Shuai Yuan, Qika Lin, Yu Qiao, Jun Liu

GUICourse: From General Vision Language Model to Versatile GUI Agent (2025.acl-long)

Challenge:	Large Language Models (LLMs) have limitations when it comes to comprehending and expressing world knowledge that extends beyond the boundaries of natural language.
Approach:	They propose a model that integrates symbolic data into LLM training without loss of generality ability.
Outcome:	The proposed model performs better on symbol- and NL-centric tasks.

Copied to clipboard

Wentong Chen, Junbo Cui, Jinyi Hu, Yujia Qin, Junjie Fang, Yue Zhao, Chongyi Wang, Jun Liu, Guirong Chen, Yupeng Huo, Yuan Yao, Yankai Lin, Zhiyuan Liu, Maosong Sun

Visual Data in NLP

Challenge:	Graphical User Interfaces (GUIs) are a pivotal medium for human-computer interaction.
Approach:	They propose a series of datasets for training visual-based GUI agents using general VLMs.
Outcome:	The proposed GUICourse datasets show that even a small-sized GUI agent performs better on GUI tasks.

Inductive Relation Prediction with Logical Reasoning Using Contrastive Representations (2022.emnlp-main)

Copied to clipboard

Yudai Pan, Jun Liu, Lingling Zhang, Tianzhe Zhao, Qika Lin, Xin Hu, Qianying Wang

Structured Data in NLP

Challenge:	Existing methods for relation prediction in knowledge graphs (KGs) are limited by the inductive setting because entities in training process are finite.
Approach:	They propose a graph convolutional network-based model LogCo with logical reasoning by contrastive representations that extracts subgraphs and relational paths between two entities to supply the entity-independence.
Outcome:	The proposed model outperforms existing methods on twelve inductive datasets.

SeaPO: Strategic Error Amplification for Robust Preference Optimization of Large Language Models (2025.findings-emnlp)

Copied to clipboard

Jun Rao, Yunjie Liao, Xuebo Liu, Zepeng Lin, Lian Lian, Dong Jin, Shengjun Cheng, Jun Yu, Min Zhang

Robustness in NLP

Challenge:	Existing methods for preference optimization of large language models use pairs of positive and negative samples, but the quality of positive samples may become similar during training, complicating preference learning.
Approach:	SeaPO introduces error types commonly occurring in large language models to improve preference learning.
Outcome:	SeaPO introduces error types into model Preference Optimization to improve model performance . negative samples are more erroneous than positive samples, and preference-based training mitigates errors .

Bridging the Domain Gaps in Context Representations for k-Nearest Neighbor Neural Machine Translation (2023.acl-long)

Copied to clipboard

Zhiwei Cao, Baosong Yang, Huan Lin, Suhang Wu, Xiangpeng Wei, Dayiheng Liu, Jun Xie, Min Zhang, Jinsong Su

Machine Translation

Challenge:	Existing methods to improve k-Nearest neighbor machine translation (kNN-MT) are based on the ability to non-parametrically adapt to new domains.
Approach:	They propose a method to boost the datastore retrieval of k-Nearest neighbor machine translation by reconstructing the original datastore.
Outcome:	The proposed method boosts the retrieval and translation quality of k-Nearest neighbor machine translation by reconstructing the original datastore.

PathReasoner: Modeling Reasoning Path with Equivalent Extension for Logical Question Answering (2024.acl-long)

Copied to clipboard

Fangzhi Xu, Qika Lin, Tianzhe Zhao, JiaweiHan JiaweiHan, Jun Liu

Leveraging Estimated Transferability Over Human Intuition for Model Selection in Text Ranking (2024.emnlp-main)

Challenge:	Existing logical reasoning tasks are challenging, especially for large language models.
Approach:	They propose a logic reasoning task model that transforms each logical sample into reasoning paths and propose an atom extension strategy supported by equivalent logical formulas to form new reasoning paths.
Outcome:	The proposed architecture achieves competitive performances on two logical reasoning benchmarks and great generalization abilities.

Copied to clipboard

Jun Bai, Zhuofan Chen, Zhenzi Li, Hanhua Hong, Jianfei Zhang, Chen Li, Chenghua Lin, Wenge Rong

Information Extraction & Text Mining

Challenge:	Existing methods for text ranking are based on intuition, but their estimated transferability may not align well with the objectives of text ranking.
Approach:	They propose to compute expected rank as transferability, explicitly reflecting the model’s ranking capability.
Outcome:	The proposed method shows significant improvements over previous classification-oriented TE methods, human intuition, and ChatGPT with minor time consumption.

LeCoDe: A Benchmark Dataset for Interactive Legal Consultation Dialogue Evaluation (2026.acl-long)

Copied to clipboard

Weikang Yuan, Kaisong Song, Zhuoren Jiang, Junjie Cao, Yujie Zhang, Jun Lin, Kun Kuang, Ji Zhang, Xiaozhong Liu

Dialogue Systems & Conversational Agents

Challenge:	Current systems for legal consultation are insufficient to handle the knowledge-intensive nature of real-world consultations.
Approach:	They propose a multi-turn benchmark dataset to evaluate LLMs in legal consultation settings.
Outcome:	The proposed framework assesses LLMs’ consultation capabilities in terms of (1) clarification capability and (2) professional advice quality.

Bridging the Gap between Training and Inference: Multi-Candidate Optimization for Diverse Neural Machine Translation (2022.findings-naacl)

Copied to clipboard

Huan Lin, Baosong Yang, Liang Yao, Dayiheng Liu, Haibo Zhang, Jun Xie, Min Zhang, Jinsong Su

Multilinguality

Challenge:	Existing diverse NMT models lack translation diversity due to a discrepancy between training and inference . despite the success of diverse NTM, there is still a lack of translation diversity .
Approach:	They propose a multi-candidate optimization framework for diverse NMT to deal with this defect.
Outcome:	The proposed framework is transparent to basic diverse NMT models, and universally makes better trade-off between diversity and quality.

COF: Adaptive Chain of Feedback for Comparative Opinion Quintuple Extraction (2025.coling-main)

Copied to clipboard

Qingting Xu, Kaisong Song, Chaoqun Liu, Yangyang Kang, Xiabing Zhou, Jun Lin, Yu Hong

Low-Resource NLP

Challenge:	Comparative Opinion Quintuple Extraction (COQE) aims to extract all comparative sentiment quintuples from product review text.
Approach:	They propose a model-unaware adaptive chain-of-feedback method to extract quintuples from product review text.
Outcome:	The proposed method improves performance on three benchmarks.

DICP: Deep In-Context Prompt for Event Causality Identification (2025.findings-emnlp)

Copied to clipboard

Lin Mu, Jun Shen, Li Ni, Lei Sang, Zhize Wu, Peiquan Jin, Yiwen Zhang

UEGP: Unified Expert-Guided Pre-training for Knowledge Rekindle (2024.findings-naacl)

Challenge:	Existing prompt-learning-based methods concatenate in-context examples only at the input layer, limiting the model’s ability to capture abstract semantic cues necessary for identifying complex causal relationships.
Approach:	They propose a model that injects in-context examples into the deeper layer of a pre-trained language model (PLM) this model leverages hierarchical semantic representations formed in deeper layers, thereby enhancing its capacity to learn high-level causal abstractions.
Outcome:	The proposed model improves on two widely used datasets and shows that it can learn high-level causal abstractions.

Copied to clipboard

Yutao Mou, Kexiang Wang, Jianhe Lin, Dehong Ma, Jun Fan, Daiting Shi, Zhicong Cheng, Gu Simiu, Dawei Yin, Weiran Xu

Language Modeling with Sparse Product of Sememe Experts (D18-1)

Challenge:	Existing paradigms for pre-training and fine-tuning have limitations . knowledge rekindle aims to break through performance upper bounds of experts without introducing additional annotated data.
Approach:	They propose a new paradigm for pre-training and fine-tuning that aims to re-incorporate the fine- tuned expert model into the training cycle and break through performance upper bounds of experts.
Outcome:	The proposed model breaks through performance upper bounds of experts without additional annotated data.

Copied to clipboard

Yihong Gu, Jun Yan, Hao Zhu, Zhiyuan Liu, Ruobing Xie, Maosong Sun, Fen Lin, Leyu Lin