Papers by Yizhou Sun

25 papers
Question-Answer Sentence Graph for Joint Modeling Answer Selection (2023.eacl-main)

Copied to clipboard

Challenge: Existing approaches to automate Question Answering (QA) are graph-based and can target large text databases.
Approach: They propose graph-based approaches for Answer Sentence Selection (AS2) . they train and integrate state-of-the-art (SOTA) models for computing scores .
Outcome: The proposed approach outperforms baseline models on academic benchmarks and a real-world dataset on unseen queries.
Tab-Cleaner: Weakly Supervised Tabular Data Cleaning via Pre-training for E-commerce Catalog (2023.acl-industry)

Copied to clipboard

Challenge: Existing methods for analyzing textual attributes in product catalogs are not effective on structured tabular data since they are trained on free-form natural language texts.
Approach: They propose a model to handle error detection over tabular data following a pre-training paradigm.
Outcome: The proposed model improves on a real-world Amazon Product Catalog table by 16% over state-of-the-art methods and by 11% on PR AUC over attribute value validation task.
V-ALPHASOCIAL: Benchmark and Self-Reflective Chain-of-Thought Generation for Visual Social Commonsense Reasoning (2025.findings-acl)

Copied to clipboard

Challenge: Social commonsense reasoning is a multimodal task that requires both textual and visual cues.
Approach: They propose a method that integrates visual cues into social commonsense reasoning tasks.
Outcome: The proposed method improves social commonsense reasoning on a multimodal foundation model.
Multilingual Knowledge Graph Completion with Self-Supervised Adaptive Graph Alignment (2022.acl-long)

Copied to clipboard

Challenge: Existing methods to predict missing facts in knowledge graphs are limited in language alignment . SS-AGA uses seed alignment as an edge type to fuses all KGs as a whole graph .
Approach: They propose a self-supervised adaptive graph alignment method that fuses all KGs as a whole graph by regarding alignment as 'a new edge type' they propose SS-AGA method that uses relation-aware attention weights to capture potential alignment pairs in a new paradigm.
Outcome: The proposed method can predict missing facts in a knowledge graph (KG) but language alignment is scarce and new alignment identification is noisy.
Concept2Box: Joint Geometric Embeddings for Learning Two-View Knowledge Graphs (2023.findings-acl)

Copied to clipboard

Challenge: Existing methods to embed knowledge graphs have ignored the fact that they contain two fundamentally different views: high-level ontology-view concepts and fine-grained instance-view entities.
Approach: They propose a novel geometric representation that jointly embeds the two views of a KG using dual geometric representations.
Outcome: Experiments on the public DBpedia KG and a newly-created industrial KG show the proposed method works well.
Empowering Language Models with Knowledge Graph Reasoning for Open-Domain Question Answering (2022.emnlp-main)

Copied to clipboard

Challenge: Existing Language Models lack the power to store all required knowledge, resulting in a lack of ability to infer out-of-context knowledge.
Approach: They propose a Knowledge Interaction Layer that can be flexibly plugged into existing Transformer-based LMs to interact with a differentiable Knowledge Graph Reasoning module collaboratively.
Outcome: The proposed model can be plugged into existing Transformer-based LMs to interact with a differentiable Knowledge Graph Reasoning module collaboratively.
UniKER: A Unified Framework for Combining Embedding and Definite Horn Rule Reasoning for Knowledge Graph Inference (2021.emnlp-main)

Copied to clipboard

Challenge: Knowledge graph inference has been studied extensively due to its wide applications.
Approach: They propose a framework that restricts logical rules to be definite Horn rules and can exploit the knowledge in logical rule-based reasoning and KGE in an extremely efficient way.
Outcome: The proposed framework can exploit the knowledge in logical rules and improve KGE in an extremely efficient way.
HMT: Hierarchical Memory Transformer for Efficient Long Context Language Processing (2025.naacl-long)

Copied to clipboard

Challenge: Existing models that memorize past tokens have “flat” memory architectures that restrict the context window.
Approach: They propose a framework that imitates human memorization behavior by preserving tokens from early input segments, passing memory embeddings along the sequence, and recalling relevant information from history.
Outcome: The proposed framework outperforms existing models in language modeling and question-answering tasks and achieves comparable or superior generation quality to long-context models with 2 57 fewer parameters and 2.5 116 less inference memory.
Introducing Semantics into Speech Encoders (2023.acl-long)

Copied to clipboard

Challenge: Existing self-supervised speech encoders contain primarily acoustic rather than semantic information.
Approach: They propose a task-agnostic unsupervised way to incorporate semantic information from large language model (LLM) systems into self-supervised speech encoders without labeled audio transcriptions.
Outcome: The proposed approach improves spoken language understanding (SLU) performance by over 5% on intent classification (IC), with modest gains in named entity resolution (NER) and slot filling (SF), and spoken question answering (SQA) score by over 22%.
Dynamic Generation of Multi LLM Agents Communication Topologies with Graph Diffusion Models (2026.acl-long)

Copied to clipboard

Challenge: Existing frameworks rely on static or rule-based topologies that fail to adapt to task requirements.
Approach: They propose a generative framework that generates highly task-adaptive topologies . they validated the framework on multiple benchmarks and validated it on multiple platforms .
Outcome: The proposed framework outperforms existing frameworks in task-adaptive communication topologies.
Structure Guided Prompt: Instructing Large Language Model in Multi-Step Reasoning by Exploring Graph Structure of the Text (2024.emnlp-main)

Copied to clipboard

Challenge: Large Language Models (LLMs) excel at straightforward reasoning tasks, but struggle when faced with complex multi-step reasoning.
Approach: They propose a framework that converts unstructured text into a graph and instructs LLMs to navigate this graph using task-specific strategies.
Outcome: The proposed framework improves the multi-step reasoning capabilities of Large Language Models in a zero-shot setting.
Open-Set Living Need Prediction with Large Language Models (2025.findings-acl)

Copied to clipboard

Challenge: Existing approaches to living need prediction treat it as a closed-set classification problem, severely limiting their ability to capture diversity and complexity of living needs.
Approach: They propose a system leveraging large language models for unrestricted need prediction that leverages Maslow's hierarchy of needs to align predictions with human living needs.
Outcome: The proposed system outperforms closed-set approaches on need-based life service recall by an average of 19.37% on real-world datasets.
Relation-Guided Pre-Training for Open-Domain Question Answering (2021.findings-emnlp)

Copied to clipboard

Challenge: Existing QA datasets are imbalanced in some types of relations, which hurts generalization performance over long-tail questions.
Approach: They propose a relation-guided pre-training framework to infer latent relations from a QA dataset . they then propose RGPT-QA to conduct extractive QA to get the target answer entity .
Outcome: The proposed framework improves Exact Match accuracy on natural questions, TriviaQA, and WebQuestions.
RESPROMPT: Residual Connection Prompting Advances Multi-Step Reasoning in Large Language Models (2024.naacl-long)

Copied to clipboard

Challenge: Chain-of-thought (CoT) has impressively unlocked the reasoning potential of large language models (LLMs), but it falls short when tackling problems that require multiple reasoning steps.
Approach: They propose a new prompting strategy that advances multi-step reasoning in LLMs by integrating necessary connections into prompts.
Outcome: The proposed strategy improves multi-step reasoning accuracy and improves reasoning accuracy across math, sequential, and commonsense domains.
How Do Large Language Models Perform in Dynamical System Modeling (2025.findings-naacl)

Copied to clipboard

Challenge: Recent data-driven methods often use graph neural networks (GNNs) to learn interactions between objects.
Approach: They propose prompting techniques for dynamical system modeling and evaluate their performance . they find that large language models demonstrate competitive performance without training .
Outcome: The proposed methods show competitive performance without training compared to state-of-the-art methods in dynamical system modeling.
Protein Large Language Models: A Comprehensive Survey (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing studies focus on specific aspects or applications, but this study provides a comprehensive overview of Protein-specific large language models.
Approach: This paper proposes a structured taxonomy of state-of-the-art ProteinLLMs . they analyze how they leverage large-scale protein sequence data for improved accuracy .
Outcome: The proposed model covers their architectures, training datasets, evaluation metrics, and diverse applications.
Automated Molecular Concept Generation and Labeling with Large Language Models (2025.coling-main)

Copied to clipboard

Challenge: Concept-based models lack explainability and need predefined concepts and manual labeling in molecular science.
Approach: They propose a framework that leverages Large Language Models to generate and label predictive molecular concepts without human input.
Outcome: The proposed framework outperforms existing models on several benchmarks while maintaining explainability and allowing easy intervention.
Grammar-Based Code Representation: Is It a Worthy Pursuit for LLMs? (2025.findings-acl)

Copied to clipboard

Challenge: Existing research demonstrates the effectiveness of grammar-based code representations in small-scale models, showing their ability to reduce syntax errors and enhance performance.
Approach: They develop a series of billion-scale grammar-based code representations that incorporate grammar rules into the code generation process.
Outcome: Experiments on HumanEval and MBPP show that grammar-based representations reduce syntax errors and improve performance even in billion-scale models.
Why Are We Moral? An LLM-based Agent Simulation Approach to the Study of Moral Evolution (2026.acl-long)

Copied to clipboard

Challenge: Existing models of moral evolution must abstract away cognitive processes . et al. (2017): evolution of morality presents a puzzle: natural selection favors selfish .
Approach: They propose an LLM-based agent simulation framework that manipulates cognitive factors to understand moral evolution.
Outcome: The proposed model exploits cognitive realism to explore moral evolution in a hunter-gatherer society.
Evaluating the Expressive Appropriateness of Speech in Rich Contexts (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for evaluating expressive speech focus on word accuracy, naturalness, signal quality, or emotional intensity at the utterance level.
Approach: They propose a framework for Evaluating Expressive Appropriateness in speech that assesses whether a speech sample aligns with the underlying communicative intent implied by its discourse-level narrative context.
Outcome: The proposed framework outperforms existing speech evaluation and analysis systems on a human-annotated test set.
Inferring from Logits: Exploring Best Practices for Decoding-Free Generative Candidate Selection (2025.acl-long)

Copied to clipboard

Challenge: Existing work has been using decoding-free candidate selection methods to obtain candidate probability from initial output logits over vocabulary.
Approach: They propose to evaluate a set of tasks using decoding-free candidate selection methods on a comprehensive set of questions.
Outcome: The proposed methods are evaluated on a set of tasks including five multiple-choice QA tasks with a small candidate pool and four clinical decision tasks with 10k+ options.
FUSE: Measure-Theoretic Compact Fuzzy Set Representation for Taxonomy Expansion (2024.findings-acl)

Copied to clipboard

Challenge: Existing work models taxonomy concepts as vectors or geometric objects, but fuzzy sets are efficient for concept modeling.
Approach: They propose a set representation learning task based on fuzzy set approximation . they demonstrate remarkable improvements in taxonomy expansion using FUSE .
Outcome: The proposed framework improves taxonomy expansion performance by 23% over baselines.
Few-Shot Representation Learning for Out-Of-Vocabulary Words (P19-1)

Copied to clipboard

Challenge: Existing methods for learning word embedding assume there are enough occurrences for each word in the corpus to accurately estimate the representation of words.
Approach: They propose to fit a representation function to predict an oracle embedding vector based on limited contexts.
Outcome: The proposed model outperforms existing methods in constructing an accurate embedding for OOV words and improves downstream tasks when the embeddable is utilized.
How Do Large Language Models Perform on PDE Discovery: A Coarse-to-fine Perspective (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing methods to identify partial differential equations using large language models suffer from performance degradation under extreme data scarcity.
Approach: They propose a framework to use large language models to identify underlying partial differential equations out of very limited observations of a physical system.
Outcome: The proposed framework is based on a coarse-to-fine paradigm to discover PDEs out of very limited observations of a physical system.
Multilingual Knowledge Graph Completion via Ensemble Knowledge Transfer (2020.findings-emnlp)

Copied to clipboard

Challenge: Existing methods for learning missing facts in knowledge graphs are limited by insufficiency of alignment information and inconsistency of described facts.
Approach: They propose a framework for embedding learning and ensemble knowledge transfer across KGs.
Outcome: The proposed framework improves state-of-the-art methods on language-specific KGs.

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