Papers by Yi Yu

71 papers
Rethinking Data Selection at Scale: Random Selection is Almost All You Need (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing data selection techniques are designed for small data pools, a study finds . filtering data by token length is an efficient method for improving results .
Approach: They use self-scoring methods that do not rely on external help to perform fine-tuning . they also find that filtering data by token length offers a stable and efficient method .
Outcome: The proposed methods outperform random selection on large datasets on large data pools.
ESGenius: Benchmarking LLMs on Environmental, Social, and Governance (ESG) and Sustainability Knowledge (2025.emnlp-main)

Copied to clipboard

Challenge: ESGenius is a comprehensive benchmark for evaluating Large Language Models on ESG and sustainability knowledge.
Approach: They introduce ESGenius, a benchmark for evaluating and enhancing ESG proficiency . they use a rigorous two-stage evaluation protocol and a repository of foundational frameworks .
Outcome: ESGenius is a benchmark for evaluating and enhancing the proficiency of Large Language Models (LLMs) in ESG and sustainability-focused question answering.
Knowledge-Grounded Dialogue Generation with a Unified Knowledge Representation (2022.naacl-main)

Copied to clipboard

Challenge: Existing knowledge-grounded dialogue systems perform poorly on unseen topics due to limited topics covered in training data.
Approach: They propose a language model that homogenizes different knowledge sources to a unified knowledge representation for knowledge-grounded dialogue generation tasks.
Outcome: The proposed language model generalizes well across knowledge-grounded dialogue tasks.
FLAIR: Steering LLM Mathematical Problem Solving based on A Fuzzy-Logic-AssIsted Reasoner (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to mathematical reasoning rely on static heuristics or pre-determined reasoning strategies.
Approach: They propose an adaptive framework that integrates fuzzy theory into LLM-based mathematical reasoning.
Outcome: The proposed framework outperforms state-of-the-art models while offering effective and interpretable diagnostics of intermediate problem-solving states.
Agentic Memory: Learning Unified Long-Term and Short-Term Memory Management for Large Language Model Agents (2026.acl-long)

Copied to clipboard

Challenge: Existing methods handle long-term memory (LTM) and short-term (STM) as separate components, relying on heuristics or auxiliary controllers, which limits adaptability and end-to-end optimization.
Approach: They propose a framework that integrates LTM and STM management directly into the agent's policy and propose 'agentic memory' to train such unified behaviors.
Outcome: The proposed framework outperforms strong memory-augmented baselines on five long-horizon benchmarks and achieves higher-quality long-term memory and more efficient context usage.
Interactive Text-to-Image Retrieval with Large Language Models: A Plug-and-Play Approach (2024.acl-long)

Copied to clipboard

Challenge: primarily addressed in text-to-image retrieval task using dialogue-form context query . conventionally, text-based retrieval methods rely on initial text descriptions .
Approach: They propose a plug-based retrieval method that uses large language models as questioners to generate non-redundant questions about the attributes of the target image.
Outcome: The proposed method performs better than zero-shot and fine-tuned baselines in benchmarks.
Dropping Experts, Recombining Neurons: Retraining-Free Pruning for Sparse Mixture-of-Experts LLMs (2025.findings-emnlp)

Copied to clipboard

Challenge: Sparse Mixture-of-Experts (SMoE) architectures require loading all expert parameters . previous work focused on expert pruning and merging but focused on neuron-level structure .
Approach: They propose a task-agnostic framework for expert pruning and reconstruction . it prunes redundant experts using router statistics, then decomposes them into neuron-level expert segments .
Outcome: The proposed framework reduces the number of experts and memory usage, making it easier to deploy.
Subtle Errors in Reasoning: Preference Learning via Error-injected Self-editing (2025.acl-long)

Copied to clipboard

Challenge: Existing studies to improve mathematical ability typically involve applying preference learning to step-wise solution pairs, but they overlook critical subtle errors.
Approach: They propose a preference learning framework that injects predefined subtle errors into pivotal tokens to construct hard pairs for error mitigation.
Outcome: Extensive experiments show that the proposed framework improves on Qwen2-7B-Instruct and MATH with 4.5K training samples.
JECC: Commonsense Reasoning Tasks Derived from Interactive Fictions (2023.findings-acl)

Copied to clipboard

Challenge: Existing benchmarks focus on a single reasoning type and ask human annotators to write candidate statements related to the particular type of commonsense.
Approach: They propose a new commonsense reasoning dataset based on human’s Interactive Fiction (IF) gameplaywalkthroughs.
Outcome: The proposed dataset is challenging to previous machine reading models and large language models with a significant 20%performance gap compared to human experts.
MAPS: Motivation-Aware Personalized Search via LLM-Driven Consultation Alignment (2025.acl-long)

Copied to clipboard

Challenge: Existing personalized product search methods assume that users’ query fully captures their real motivation, but in practice, user's queries do not always articulate the requirements.
Approach: They propose a Motivation-Aware Personalized Search method that embeds queries and consultations into a unified semantic space via LLMs and utilizes a Mixture of Attention Experts (MoAE) to prioritize critical semantics.
Outcome: Extensive experiments on real and synthetic data show that the proposed method outperforms existing methods in retrieval and ranking tasks.
Tiny-NewsRec: Effective and Efficient PLM-based News Recommendation (2022.emnlp-main)

Copied to clipboard

Challenge: Existing work fine tunes the PLM with the news recommendation task, which can cause a domain shift problem.
Approach: They propose a self-supervised method to adapt general PLM to news domain with a contrastive matching task between news titles and news bodies.
Outcome: The proposed method can improve both the effectiveness and efficiency of the large PLM-based news recommendation model while maintaining its performance.
PsyChain: A Collaborative Chain-of-Agents Framework for Generating Personalized and Professional Counseling Dialogues (2026.findings-acl)

Copied to clipboard

Challenge: Existing psychological counseling datasets suffer from monolithic client personas, insufficient therapeutic depth, and a lack of process controllability.
Approach: They propose a framework that evolves static counseling corpora into high-fidelity dialogues . they use a Client Profiler that pairs life scenarios with psychological personality archetypes based on client personality and stage progression .
Outcome: The proposed framework achieves 61-91% win rates against domain-specific baselines in pairwise evaluation and the highest average score in human evaluation, indicating potential for real-world counseling.
Multi-Turn Response Selection for Chatbots with Deep Attention Matching Network (P18-1)

Copied to clipboard

Challenge: Existing models for matching dialogue responses rely on semantic and functional dependencies . a recent study only uses the last utterance in context for matching a reply .
Approach: They propose a model that matches a response with its multi-turn context using attention.
Outcome: The proposed model outperforms the state-of-the-art models on two large-scale multi-turn response selection tasks.
Reframe Your Life Story: Interactive Narrative Therapist and Innovative Moment Assessment with Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Existing approaches to mental health support lack realism and capture therapeutic progression over time.
Approach: They propose a framework that simulates expert narrative therapists by planning therapeutic stages, guiding reflection levels, and generating contextually appropriate responses through retrieval-augmentation.
Outcome: The proposed framework outperforms standard methods in quality and depth on 260 simulated clients and 230 human participants.
One Refiner to Unlock Them All: Inference-Time Reasoning Elicitation via Reinforcement Query Refinement (2026.acl-long)

Copied to clipboard

Challenge: Existing alignment methods for Large Language Models (LLMs) are expensive and lack the flexibility to fully activate their latent reasoning capabilities.
Approach: They propose a modular framework that treats reasoning elicitation as an inference-time alignment task.
Outcome: The proposed framework outperforms baselines by 2.1% on average across diverse architectures and benchmarks.
SRF: Enhancing Document-Level Relation Extraction with a Novel Secondary Reasoning Framework (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods for document-level relation extraction ignore bidirectional mention interaction when generating relational features for entity pairs.
Approach: They propose a document-level relation extraction model that incorporates bidirectional mention fusion and a simple yet effective evidence extraction module for relation prediction.
Outcome: The proposed model achieves SOTA performance and the proposed method is effective and general when integrated into existing models.
Towards Database-Free Text-to-SQL Evaluation: A Graph-Based Metric for Functional Correctness (2025.coling-main)

Copied to clipboard

Challenge: Existing metrics for evaluating functional correctness of SQL queries are prone to false positives due to inadequately prepared test databases.
Approach: They propose a graph-based metric that uses a relational operator tree to extract rich semantic information from the logical execution plan of SQL queries and embed it into a diagram.
Outcome: The proposed method eliminates the need for extensive test database preparation and performs graph matching on unseen SQL queries.
SEAD: A Surrogate-free Label-only Membership Inference Attack against Pre-trained LLMs with Semantic-Aware Density (2026.findings-acl)

Copied to clipboard

Challenge: Existing membership inference attacks require access to complete logits, but such access is often unavailable in real-world deployments where only the generated text is exposed.
Approach: They propose a surrogate-free label-only MIA approach that directly estimates token probabilities through Monte Carlo sampling of the target model.
Outcome: The proposed approach outperforms existing label-only attacks and serves as a foundational density estimator in the label-exclusive setting.
Crossing the Reward Bridge: Expanding Reinforcement Learning with Verifiable Rewards Across Diverse Domains (2026.acl-long)

Copied to clipboard

Challenge: Reinforcement learning with verifiable rewards (RLVR) has been effective on structured tasks, but its reliance on simple, rule-based verifiers creates a bottleneck.
Approach: They propose a framework that uses a generative verifier to provide soft, probabilistic rewards.
Outcome: The proposed framework outperforms existing models up to 10x their size and can be scalable and effective.
Document Modeling with External Attention for Sentence Extraction (P18-1)

Copied to clipboard

Challenge: Document modeling is essential to a variety of natural language understanding tasks.
Approach: They propose to use external information to improve document modeling for sentence extraction problems.
Outcome: The proposed model outperforms baseline models on document summarization and answer selection tasks and achieves state-of-the-art results on WikiQA and NewsQA.
Prompt-Guided Internal States for Hallucination Detection of Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) generate incorrect or logically incorrect responses, which is known as LLM hallucinations.
Approach: They propose a framework for supervised hallucination detection using in-domain data by prompting changes to the structure related to text truthfulness in LLMs’ internal states.
Outcome: The proposed framework enhances the cross-domain generalization of existing hallucination detection methods.
PlotGen-Bench: Evaluating VLMs on Generating Visualization Code from Diverse Plots across Multiple Libraries (2026.findings-acl)

Copied to clipboard

Challenge: PlotGen-Bench evaluates vision-language models' ability to generate executable visualization code from plots under realistic and complex visualization requirements.
Approach: They propose a benchmark to evaluate plot-to-code generation in vision-language models . they use Matplot, Matplos, Mat3D, Mat4D, and Mat4E to evaluate their performance .
Outcome: The proposed benchmark covers 9 major categories, 30 subcategories, and 3 core tasks . it covers 2D, 3D and animated plots across 5 widely used visualization libraries.
AutoPKG: An Automated Framework for Dynamic E-commerce Product-Attribute Knowledge Graph Construction (2026.findings-acl)

Copied to clipboard

Challenge: Product attribute extraction in e-commerce is bottlenecked by ontologies that are inconsistent, incomplete, and costly to maintain.
Approach: They propose a multi-agent Large Language Model framework that constructs a Product-attribute Knowledge Graph from multimodal product content.
Outcome: The proposed framework achieves 0.953 WKE for product types, 0.724 WKEs for attribute keys, and 0.531 edge-level accuracy for value assertions after canonicalization on a large real-world marketplace catalog dataset from Lazada (Alibaba).
MoKA:Parameter Efficiency Fine-Tuning via Mixture of Kronecker Product Adaption (2025.coling-main)

Copied to clipboard

Challenge: Low-Rank Adaptation (LoRA) is one of the most popular PEFT methods . low-rank update mechanism of LoRA somewhat limits its ability to approximate full-parameter fine-tuning during training process.
Approach: They propose a parameter-efficient fine-tuning framework that combines Kronecker product with the Mixture-of-Experts method to achieve parameter efficiency and better model performance.
Outcome: The proposed framework outperforms existing methods on the GLUE benchmark and instruction tuning tasks for large language models.
RESIN: A Dockerized Schema-Guided Cross-document Cross-lingual Cross-media Information Extraction and Event Tracking System (2021.naacl-demos)

Copied to clipboard

Challenge: We present a new information extraction system that can construct temporal event graphs from news documents.
Approach: They propose a temporal event graph extraction system that can extract news documents . they extend the system from sentence-level event extraction to cross-document cross-media event extraction .
Outcome: The proposed system can extract temporal event graphs from news documents in multiple languages and multiple data modalities.
PLAWBENCH: A Rubric-Based Benchmark for Evaluating LLMs in Real-World Legal Practice (2026.acl-long)

Copied to clipboard

Challenge: Existing benchmarks for large language models (LLMs) are coarse, single-dimensional metrics and do not explicitly assess fine-grained legal reasoning.
Approach: They propose a Practical Law Benchmark to evaluate large language models in real-world legal practice scenarios.
Outcome: The proposed model is based on 850 questions and 13 scenarios with expert-designed evaluation rubrics.
EvoBench: Towards Real-world LLM-Generated Text Detection Benchmarking for Evolving Large Language Models (2025.findings-acl)

Copied to clipboard

Challenge: Existing methods to detect LLM-generated texts rely on static benchmarks that neglect the evolving nature of LLMs.
Approach: They propose a benchmark to evaluate the generalization of LLM-generated text detection methods.
Outcome: The proposed benchmark measures generalization of 14 detection methods across LLMs.
WebAggregator: Enhancing Compositional Reasoning Capabilities of Deep Research Agent Foundation Models (2026.acl-long)

Copied to clipboard

Challenge: Existing agentic systems are retrieval-heavy but reasoning-light . current systems lack compositional reasoning, a key component of deep research .
Approach: They propose a data synthesis pipeline WebAggregator to shift agentic paradigm . they use Proactive Explorer to collect interconnected knowledge and Compositional Logic Proposer to weave knowledge into complex questions .
Outcome: The proposed pipeline surpasses GPT-4.1 and matches Claude-3.7-Sonnet on GAIA, WebWalkerQA, and XBench.
OMIBench: Benchmarking Olympiad-Level Multi-Image Reasoning in Large Vision-Language Models (2026.acl-long)

Copied to clipboard

Challenge: Existing multimodal reasoning benchmarks for large vision-language models emphasize single-image analysis and fail to exploit contextual information across multiple images.
Approach: They propose a benchmark to evaluate Olympiad-level reasoning when evidence is distributed over multiple images.
Outcome: The proposed model outperforms existing models on bi-image Olympiads and Gemini-3-Pro on multimodal Olympiad-level reasoning tasks.
A Structured Framework for Evaluating and Enhancing Interpretive Capabilities of Multimodal LLMs in Culturally Situated Tasks (2025.findings-emnlp)

Copied to clipboard

Challenge: Using a zero-shot classification model, we extracted multi-dimensional evaluative features from human expert critiques and used them to evaluate selected VLMs such as Llama, Qwen, or Gemini.
Approach: They constructed a quantitative framework for Chinese painting critique by extracting multi-dimensional evaluative features from human expert critiques using a zero-shot classification model.
Outcome: The framework was constructed by extracting features from human critiques using a zero-shot classification model.
Natural-Language Policies to Executable Decisions: An Interpretable Large Language Model Framework (2026.acl-industry)

Copied to clipboard

Challenge: a production-grade pricing system for tourism is challenging due to unstructured nature of travel orders and ever-evolving pricing policies.
Approach: They propose a production-grade pricing system with a strict decision boundary . they propose to combine structured extraction and bounded policy/path selection with interpretable condition trees .
Outcome: The proposed system processed 3,960 orders in six months and reduced the order management team from 15-20 to 3 . the system reduced the per-order handling time from 10 minutes to 2 minutes.
Domain Incremental Lifelong Learning in an Open World (2023.findings-acl)

Copied to clipboard

Challenge: Existing approaches to lifelong learning (LL) models require access to task identities in the testing phase or cannot handle samples from unseen tasks.
Approach: They propose a dynamic architecture-based lifelong learning model that tries to learn a sequence of tasks with a prompt-enhanced language model.
Outcome: The proposed model outperforms state-of-the-art models in handling unseen tasks and focuses on task-level prompts to capture knowledge from different granularities.
Eval-RAR: Evaluation-Driven Retrieval-Augmented Reasoning via Reinforcement Learning (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for retrieval-augmented generation fail to provide explicit supervision for internal reasoning process.
Approach: They propose an Evaluation-driven Retrieval-Augmented Reasoning framework that uses reinforcement learning and a fine-grained evaluation reward to optimize the process.
Outcome: Eval-RAR outperforms existing methods on QA benchmarks on seven single-hop and multi-hop tasks.
CITE: Benchmarking Heterogeneous Text-Attributed Graph Models (2026.acl-long)

Copied to clipboard

Challenge: Recent advances in large language models and text-aware graph learning have increased interest in reasoning over text-attributed graphs.
Approach: They propose a large-scale heterogeneous text-attributed graph benchmark for catalytic materials that contains over 438K nodes and 1.2M edges . they establish standardized evaluation protocols for node classification and link prediction and conduct ablation studies to assess the impact of graph heterogenity and textual attributes.
Outcome: The proposed benchmarks are compared to existing methods and provide a baseline for the evaluation of four classes of learning paradigms.
Refining Sample Embeddings with Relation Prototypes to Enhance Continual Relation Extraction (2021.acl-long)

Copied to clipboard

Challenge: Existing methods to extract relationships from texts depend on memory size and replay these memorized samples in subsequent tasks.
Approach: They propose to use a model to extract relations between entities from texts where the samples of different relations are delivered into the model continuously.
Outcome: The proposed model outperforms the state-of-the-art models and avoids catastrophic forgetting.
PUPPET: Neural-Symbolic Standardized Patients for Mental Health (2026.acl-long)

Copied to clipboard

Challenge: Existing LLM-based training approaches lack faithful responses to clinical errors and explainable feedback.
Approach: They propose a neural-symbolic virtual standardized patient governed by an OBSERVE-THINK-BEHAVE architecture that embeds LLM reasoning into a symbolic system where experts implant causal associations between intervention logic and patient mental states.
Outcome: The proposed model outperforms baselines in faithfulness and pedagogical value.
What You Say and How You Say It Matters: Predicting Stock Volatility Using Verbal and Vocal Cues (P19-1)

Copied to clipboard

Challenge: Existing studies have shown that textual information in a firm’s financial statement can be used to predict its stock’s risk level.
Approach: They propose to model CEO’s verbal (from text) and vocal (from audio) information in a conference call.
Outcome: The proposed model reduces the error rate by comparing CEO’s verbal and vocal information in a conference call with other models.
PRA-RAG: Provably Robust Aggregation in Retrieval-Augmented Generation against Retrieval Corruption (2026.findings-acl)

Copied to clipboard

Challenge: Existing defense mechanisms lack theoretical robustness guarantees and perform unreliably when the LLM has limited knowledge of the retrieved content.
Approach: They propose a provably robust retrieval aggregation algorithm designed to defend against poisoning attacks on retrieved texts.
Outcome: Experiments show that PRA-RAG reduces the attack success rate to as low as 1% while maintaining an accuracy of 71%, significantly outperforming representative state-of-the-art (SOTA) methods.
MMLF: Multi-query Multi-passage Late Fusion Retrieval (2025.findings-naacl)

Copied to clipboard

Challenge: Existing approaches to query expansion are limited in terms of lexical overlap.
Approach: They propose a query expansion pipeline that generates sub-queries, expands them into pseudo-documents, retrieves them individually and aggregates results using reciprocal rank fusion.
Outcome: The proposed pipeline improves on five BEIR benchmark datasets and achieves a maximum gain of up to 8%.
Chunks as Arms: Multi-Armed Bandit-Guided Sampling for Long-Context LLM Preference Optimization (2026.acl-long)

Copied to clipboard

Challenge: Recent studies have explored fine-tuning Large Language Models with synthetic data to enhance their long-context capabilities.
Approach: They propose a framework that leverages a Multi-Armed Bandit rollout strategy to identify the most informative chunks from the given long context for sampling high-quality and diverse responses.
Outcome: The proposed framework achieves 4% improvement on long-context reasoning benchmarks on Llama and Qwen.
Syllable-level lyrics generation from melody exploiting character-level language model (2024.findings-eacl)

Copied to clipboard

Challenge: Pre-trained language models specifically designed at the syllable level are not available.
Approach: They propose to exploit character-level language models for syllable-level lyrics generation from symbolic melody.
Outcome: The proposed system improves coherence and correctness of generated lyrics without training expensive language models.
Causal-Debias: Unifying Debiasing in Pretrained Language Models and Fine-tuning via Causal Invariant Learning (2023.acl-long)

Copied to clipboard

Challenge: Existing methods to remove unwanted stereotypical associations from pretrained language models (PLMs) are often focused on removing unwanted stereotypes from PLMs.
Approach: They propose a framework to remove unwanted stereotypical associations in pretrained language models . they propose bias-relevant factors are causal, while labelrelevant factors causal .
Outcome: The proposed framework reduces stereotypical associations after PLMs are fine-tuned . the proposed framework mitigates bias from a causal invariant perspective .
Defining a New NLP Playground (2023.findings-emnlp)

Copied to clipboard

Challenge: Recent explosion of performance of large language models (LLMs) has changed the field more abruptly and seismically than any other shift in the field’s 80 year history.
Approach: They propose 20+ PhD-dissertation-worthy research directions to define a new NLP playground by combining theoretical analysis, new and challenging problems, learning paradigms and interdisciplinary applications.
Outcome: The proposed research will cover theoretical analysis, new and challenging problems, learning paradigms and interdisciplinary applications.
X-Boundary: Establishing Exact Safety Boundary to Shield LLMs from Jailbreak Attacks without Compromising Usability (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for enhancing LLM security compromise usability, study finds . boundary-safe representations close to harmful representations are disrupted, resulting in usability decline .
Approach: They propose a method to push harmful representations away from boundary-safe representations and obtain an exact distinction boundary.
Outcome: The proposed method reduces over-refusal rate and maintains general capability . it pushes harmful representations away from boundary-safe representations, thereby reducing usability.
ToHRE: A Top-Down Classification Strategy with Hierarchical Bag Representation for Distantly Supervised Relation Extraction (2020.coling-main)

Copied to clipboard

Challenge: Existing methods to find relational facts from texts lack hierarchical information of relations.
Approach: They propose a hierarchical classification framework which extracts relation in a top-down manner.
Outcome: The proposed method significantly outperforms state-of-the-art methods on NYT dataset . the proposed method generates large amounts of training data by aligning KBs with unlabeled corpora .
Action-Based Conversations Dataset: A Corpus for Building More In-Depth Task-Oriented Dialogue Systems (2021.naacl-main)

Copied to clipboard

Challenge: Existing goal-oriented dialogue datasets focus on identifying slots and values, but in reality, customer service agents follow multi-step procedures derived from explicit company policies.
Approach: They propose to use a fully-labeled dataset to study customer service dialogue systems in real-world scenarios.
Outcome: The proposed dataset outperforms existing models but still lacks 50.8% absolute accuracy to reach human-level performance on the dataset.
Fin-STAR: Structure-as-Semantics to Resolve Implicitness in Financial Retrieval (2026.findings-acl)

Copied to clipboard

Challenge: Existing Retrieval-Augmented Generation systems treat structure as a physical navigational skeleton rather than intrinsic semantic knowledge.
Approach: They propose a framework that redefining hierarchy as intrinsic semantics and uses snippets to enrich hierarchical lineage.
Outcome: The proposed framework outperforms state-of-the-art hierarchical and graph-based benchmarks on FinTierQA Gold.
Language Models can Evaluate Themselves via Probability Discrepancy (2024.findings-acl)

Copied to clipboard

Challenge: Existing evaluation frameworks focus on superficial text differences and fail to align with human judgment.
Approach: They propose a new method to evaluate the performance of Large Language Models (LLMs) by calculating probability discrepancies between original response generation and revised versions of LLMs.
Outcome: The proposed method eliminates the need for training an additional evaluation model or relying on external proprietary models such as GPT-4 as a judger.
UniCorn: Towards Self-Improving Unified Multimodal Models through Self-Generated Supervision (2026.acl-long)

Copied to clipboard

Challenge: Unified Multimodal Models have achieved remarkable success in cross-modal comprehension, but a gap persists in their ability to translate internal knowledge into faithful and controllable synthesis.
Approach: They propose a self-improvement framework that partitions a single UMM into three collaborative roles: Proposer, Solver, and Judge.
Outcome: The proposed framework improves on TIIF, DPG, CompBench and UniCycle benchmarks.
Multi-TimeLine Summarization (MTLS): Improving Timeline Summarization by Generating Multiple Summaries (2021.acl-long)

Copied to clipboard

Challenge: Existing work on Time-Line Summarization (TLS) has focused on improving the performance of summarization but its drawbacks are as follows: a homogeneous dataset makes it hard to generalize; output is usually a single timeline regardless of the size and complexity of the input dataset.
Approach: They propose a task that generates a time-line for each story given a news article . they propose MTLS task that can be generalized to other news articles .
Outcome: The proposed task can generate bet-ter results than Time-Line Summarization (TLS) the proposed task is based on previous evaluation methods.
Learning to Align Multi-Faceted Evaluation: A Unified and Robust Framework (2025.findings-acl)

Copied to clipboard

Challenge: Existing methods for fine-tuning open-source LLMs are limited to text-based analysis under predefined general criteria.
Approach: They propose a framework that fine-tunes LLMs to replicate the evaluation explanations and judgments of proprietary models.
Outcome: The proposed evaluation framework outperforms existing fine-tuned evaluation methods in effectiveness and robustness.
MR-ALIGN: Meta-Reasoning Informed Factuality Alignment for Large Reasoning Models (2026.findings-acl)

Copied to clipboard

Challenge: Large reasoning models (LRMs) show strong capabilities in complex reasoning, yet their marginal gains on evidence-dependent factual questions are limited.
Approach: They propose a Meta-Reasoning informed alignment framework that quantifies state-transition probabilities along the model’s thinking process and constructs a transition-aware implicit reward that reinforces beneficial reasoning patterns while suppressing defective ones at the atomic thinking segments.
Outcome: Empirical evaluations of four factual QA datasets and one long-form factuality benchmark show that MR-ALIGN consistently improves accuracy and truthfulness while reducing misleading reasoning.
Measuring Human Contribution in AI-Assisted Content Generation (2026.acl-long)

Copied to clipboard

Challenge: generative AI has created a new way to generate content with humans . varying degrees of human contribution in content generation poses significant challenges for the delineation of originality .
Approach: They propose a framework to measure human contribution in AI-assisted content generation by calculating mutual information between human input and AI-aided output relative to self-information of AI-assist output.
Outcome: The proposed measure discriminates between varying degrees of human contribution across multiple creative domains and is validated in real-world applications.
CharacterGLM: Customizing Social Characters with Large Language Models (2024.emnlp-industry)

Copied to clipboard

Challenge: Character-based dialogue systems (CharacterDial) allow users to customize social characters for social interactions.
Approach: They will collect a large-scale Chinese corpus of characters with diverse categories and behaviors and develop CharacterGLM models to address these challenges.
Outcome: Experiments show that CharacterGLM outperforms most popular open- and closed-source LLMs and performs comparable to GPT-4.
Revisiting the Roles of “Text” in Text Games (2022.findings-emnlp)

Copied to clipboard

Challenge: Recent work has shown that random text hashes could be complementary rather than contrasting in text games.
Approach: They propose a scheme to extract contextual information into an approximate state hash as extra input for an RNN-based text agent.
Outcome: The proposed scheme achieves competitive performance with state-of-the-art text agents using advanced NLU techniques such as knowledge graph and passage retrieval.
When Personalization Misleads: Understanding and Mitigating Hallucinations in Personalized LLMs (2026.findings-acl)

Copied to clipboard

Challenge: Personalization can inadvertently distort factual reasoning when faced with factual queries.
Approach: They propose a lightweight inference-time approach that mitigates personalization-induced factual distortions while preserving personalized behavior.
Outcome: Experiments across multiple LLM backbones and personalization methods show that FPPS significantly improves factual accuracy while maintaining personalized performance.
Similarity = Value? Consultation Value-Assessment and Alignment for Personalized Search (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods rely on semantic similarity to align historical consultations with current queries due to the absence of ‘value’ labels, but this lacks exploration of needs in user consultations.
Approach: They propose a consultation value assessment framework that evaluates historical consultations from three novel perspectives: (1) Scenario Scope Value, (2) Posterior Action Value, and (3) Time Decay Value.
Outcome: The proposed model outperforms baselines on public and commercial datasets on both retrieval and ranking tasks.
Zero-shot User Intent Detection via Capsule Neural Networks (D18-1)

Copied to clipboard

Challenge: Existing methods to classify intents are labor-intensive and time-consuming as intents will be diverse and new intents may be involved.
Approach: They propose a zero-shot intent detection problem which aims to detect emerging user intents where no labeled utterances are currently available.
Outcome: The proposed model can discriminate emerging intents when no labeled utterances are available in training data.
AI4Reading: Chinese Audiobook Interpretation System Based on Multi-Agent Collaboration (2025.acl-demo)

Copied to clipboard

Challenge: Interpretative audiobooks are becoming more popular, but their manual creation process remains time-consuming and resource-intensive.
Approach: They propose a multi-agent collaboration system that leverages large language models and speech synthesis technology to generate podcast-like audiobook interpretations.
Outcome: The proposed system is open source and open to the public.
Learning Semantic Textual Similarity via Topic-informed Discrete Latent Variables (2022.emnlp-main)

Copied to clipboard

Challenge: Recent discrete latent variable models have received a surge of interest in both NLP and CV . they are comparable to the continuous counterparts in representation learning, but are more interpretable in their predictions.
Approach: They develop a topic-informed discrete latent variable model for semantic textual similarity . they inject the quantized representation into a transformer-based language model .
Outcome: The proposed model outperforms strong baselines in semantic textual similarity tasks.
TiMem: Temporal-Hierarchical Memory Consolidation for Long-Horizon Conversational Agents (2026.findings-acl)

Copied to clipboard

Challenge: Existing memory frameworks provide limited support for temporally structured information across hierarchical levels, leading to fragmented memories and unstable long-horizon personalization.
Approach: They propose a temporal–hierarchical memory framework that organizes conversations through a Temporal Memory Tree.
Outcome: The proposed framework outperforms baselines while reducing the recalled memory length by 52.20%.
ReviewGrounder: Improving Review Substantiveness with Rubric-Guided, Tool-Integrated Agents (2026.acl-long)

Copied to clipboard

Challenge: Rapid rise in AI conference submissions has driven increasing exploration of large language models (LLMs) for peer review support.
Approach: They propose a peer review benchmarking tool based on paper-specific rubrics and a rubric-guided framework that decomposes reviewing into drafting and grounding stages.
Outcome: The proposed framework outperforms baselines with stronger/larger backbones in both alignment with human judgments and rubric-based review quality across 8 dimensions.
Towards Unified Representations of Knowledge Graph and Expert Rules for Machine Learning and Reasoning (2022.aacl-main)

Copied to clipboard

Challenge: Empirical study shows superiority of proposed method over time-tested knowledge-driven and data-driven methods.
Approach: They propose a cognitive knowledge graph that unifies expert rules and relational facts as the substrate of machine learning and reasoning models.
Outcome: Empirical results show the proposed method superior to time-tested methods . the proposed model can perform both learning and reasoning with labeled data .
TOREE: Evaluating Topic Relevance of Student Essays for Chinese Primary and Middle School Education (2024.findings-acl)

Copied to clipboard

Challenge: Existing research on Automatic Essay Scoring (AES) for Chinese essays has overlooked topic relevance and lacks detailed feedback.
Approach: They propose to use TOREE to assess topic relevance in Chinese primary and middle school students’ essays to improve automatic and human evaluations.
Outcome: The proposed method significantly improves both automatic and human evaluations across four diverse LLMs.
Evolutionary Negative Module Pruning for Better LoRA Merging (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for integrating multiple low-rank Adaptation experts into a single backbone are limited by negative modules.
Approach: They propose a plug-and-play LoRA pruning method to locate and exclude negative modules prior to merging.
Outcome: The proposed method boosts the performance of existing merging algorithms across languages and vision domains.
CLGC: A Corpus for Chinese Literary Grace Evaluation (2022.lrec-1)

Copied to clipboard

Challenge: Literature grace is a key element of the style and quality of articles in China.
Approach: They propose to annotate a Chinese literary grace corpus with 10,000 texts and 1.85 million tokens and build a literary grace evaluation task to assess the literary grace level.
Outcome: The proposed model achieves 79.71% on the weighted average F1-score.
Diverse Few-Shot Text Classification with Multiple Metrics (N18-1)

Copied to clipboard

Challenge: Existing methods for few-shot learning are insufficient to capture task variations in natural language domains.
Approach: They propose an adaptive metric learning approach that automatically determines the best weighted combination from a set of metrics obtained from meta-training tasks for a newly seen few-shot task.
Outcome: The proposed method performs favorably against state-of-the-art few shot learning algorithms on real-world sentiment analysis and dialog intent classification datasets.
NSP-BERT: A Prompt-based Few-Shot Learner through an Original Pre-training Task —— Next Sentence Prediction (2022.coling-1)

Copied to clipboard

Challenge: Recent studies have shown that using prompts to utilize language models to perform downstream tasks is more effective than using token-level methods such as PET.
Approach: They propose to use a BERT original pre-training task abandoned by RoBERTa and other models to construct a sentence-level prompt-based method that does not need to fix the length of the prompt or the position to be predicted.
Outcome: The proposed method performs better than PET and EFL on a BERT pre-training task and is comparable to other prompt-based methods.
Prosody-TTS: Improving Prosody with Masked Autoencoder and Conditional Diffusion Model For Expressive Text-to-Speech (2023.findings-acl)

Copied to clipboard

Challenge: Expressive text-to-speech aims to generate high-quality samples with rich prosody . prosodic attributes in highly dynamic voices are difficult to capture and model without intonation .
Approach: They propose a pipeline that enhances prosody modeling and sampling by introducing a self-supervised masked autoencoder and a diffusion model to sample diverse prosodic patterns within the latent space.
Outcome: The proposed pipeline achieves new state-of-the-art in text-to-speech with natural and expressive synthesis.
Generation Meets Verification: Accelerating Large Language Model Inference with Smart Parallel Auto-Correct Decoding (2024.findings-acl)

Copied to clipboard

Challenge: Existing autoregressive models generate tokens sequentially and are memory-bound, resulting in a memory-based inference stage that is memory-limited.
Approach: They propose an approach to accelerate the inference speed of large language models with billions of parameters by integrating semi-autoregressive inference and speculative decoding capabilities.
Outcome: The proposed approach has demonstrated inference speedups of 2.7x-4.0x on humanEval-X while maintaining output quality.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations