Papers by Jiaxin Shi
ParaMac: A General Unsupervised Paraphrase Generation Framework Leveraging Semantic Constraints and Diversifying Mechanisms (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing unsupervised methods for paraphrase generation are weak in semantic equivalence or expression diversity. |
| Approach: | They propose a framework for unsupervised paraphrase generation that employs multi-aspect equivalence constraints and multi-granularity diversifying mechanisms to achieve good semantic equvalence and expressive diversity. |
| Outcome: | The proposed framework achieves 9.1% and 3.3% absolute gains over previous SOTA on Quora and MSCOCO and can improve to 18.0% and 4.6% on GLUE. |
TWAG: A Topic-Guided Wikipedia Abstract Generator (2021.acl-long)
Copied to clipboard
| Challenge: | Existing models view Wikipedia abstract as plain text, ignoring that it is a description of a certain entity and can be decomposed into different topics. |
| Approach: | They propose a model that guides Wikipedia abstract generation with topical information. |
| Outcome: | The proposed model outperforms baselines and is capable of generating comprehensive abstracts. |
G-MAP: General Memory-Augmented Pre-trained Language Model for Domain Tasks (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing domain-adaptive pre-training (DAPT) models tend to forget the general knowledge acquired by general PLMs, leading to catastrophic forgetting and sub-optimal performance. |
| Approach: | They propose a framework which augments the domain-specific PLM by a memory built from the frozen general PLM without losing the general knowledge. |
| Outcome: | The proposed framework augments the domain-specific PLM by a memory built from the frozen general PLM without losing the general knowledge. |
On LLM-Based Scientific Inductive Reasoning Beyond Equations (2025.emnlp-main)
Copied to clipboard
Brian S. Lin, Jiaxin Yuan, Zihan Zhou, Shouli Wang, Shuo Wang, Cunliang Kong, Qi Shi, Yuxuan Li, Liner Yang, Zhiyuan Liu, Maosong Sun
| Challenge: | Existing research on inductive reasoning models emphasizes rule design without grounding them in specific scenarios. |
| Approach: | They propose to use LLMs to learn underlying patterns from limited examples in entirely new environments. |
| Outcome: | The proposed benchmark evaluates the inductive reasoning abilities of large language models in scientific settings. |
Program Transfer for Answering Complex Questions over Knowledge Bases (2022.acl-long)
Copied to clipboard
| Challenge: | Program induction for complex questions over knowledge bases relies on a large number of parallel question-program pairs for the given KB, but the gold program annotations are usually lacking, making learning difficult. |
| Approach: | They propose an approach to leverage program annotations on rich KBs as external supervision signals to aid program induction for low-resourced KB. |
| Outcome: | The proposed approach outperforms SOTA methods on ComplexWebQuestions and WebQuestionSP. |
On the Role of Entity and Event Level Conceptualization in Generalizable Reasoning: A Survey of Tasks, Methods, Applications, and Future Directions (2025.findings-emnlp)
Copied to clipboard
Weiqi Wang, Tianqing Fang, Haochen Shi, Baixuan Xu, Wenxuan Ding, Liyu Zhang, Wei Fan, Jiaxin Bai, Haoran Li, Xin Liu, Yangqiu Song
| Challenge: | Conceptualization is a fundamental element of human cognition and plays a pivotal role in generalizable reasoning. |
| Approach: | They propose to categorize different types of conceptualizations into four levels based on the types of instances being conceptualized. |
| Outcome: | The proposed categorization of different types of conceptualizations into four levels based on the types of instances being conceptualized . |
Hybrid and Collaborative Passage Reranking (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing solutions to passage reranking focus on enriching the interaction between query and each passage separately, neglecting the context among the top-ranked passages. |
| Approach: | They propose a Hybrid and Collaborative Passage Reranking method that leverages the similarity measurements of upstream retrievers for passage collaboration. |
| Outcome: | Experiments show that HybRank improves over existing methods and improves performance. |
Probabilistic Tree-of-thought Reasoning for Answering Knowledge-intensive Complex Questions (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Large language models (LLMs) are capable of answering knowledge-intensive complex questions with chain-of-thought reasoning. |
| Approach: | They propose a method to solve complex questions with a tree-of-thought approach using parametric knowledge and retrieved external knowledge to augment CoT reasoning. |
| Outcome: | The proposed approach outperforms SOTA methods on three Complex QA datasets under the open-domain setting. |
LogiDynamics: Unraveling the Dynamics of Inductive, Abductive and Deductive Logical Inferences in LLM Reasoning (2025.emnlp-main)
Copied to clipboard
Tianshi Zheng, Cheng Jiayang, Chunyang Li, Haochen Shi, Zihao Wang, Jiaxin Bai, Yangqiu Song, Ginny Wong, Simon See
| Challenge: | Modern large language models (LLMs) employ diverse logical inference mechanisms for reasoning. |
| Approach: | They analyze the comparative dynamics of inductive (System 1) versus abductive/deductive (system 2) inference in large language models by using a controlled analogical reasoning environment and a MCQ/free-text task format. |
| Outcome: | The proposed methods can significantly scale LLM reasoning. |
Re-TASK: Revisiting LLM Tasks from Capability, Skill, and Knowledge Perspectives (2025.findings-acl)
Copied to clipboard
Zhihu Wang, Shiwan Zhao, Yu Wang, Heyuan Huang, Sitao Xie, Yubo Zhang, Jiaxin Shi, Zhixing Wang, Hongyan Li, Junchi Yan
| Challenge: | Existing approaches to solving complex tasks with large language models (LLMs) fail to decompose tasks accurately or execute subtasks effectively. |
| Approach: | They propose a Chain-of-Learning (CoL) paradigm that highlights task dependencies on specific capability items, further broken down into their constituent knowledge and skill components. |
| Outcome: | The proposed model improves Yi-1.5-9B and Llama3-Chinese-8B for legal tasks by 45.00% and 24.50% on different domains. |
Semi-supervised Entity Alignment via Joint Knowledge Embedding Model and Cross-graph Model (D19-1)
Copied to clipboard
| Challenge: | Entity alignment aims at integrating complementary knowledge graphs (KGs) from different sources or languages. |
| Approach: | They propose a semi-supervised entity alignment method by joint Knowledge Embedding model and Cross-Graph model to make better use of seed alignments to propagate over the entire graphs with KG-based constraints. |
| Outcome: | The proposed method can make better use of seed alignments to propagate over entire graphs with KG-based constraints. |
Reasoning over Hierarchical Question Decomposition Tree for Explainable Question Answering (2023.acl-long)
Copied to clipboard
| Challenge: | Existing XQA methods focus on reasoning on a single knowledge source, e.g., structured knowledge bases, unstructured corpora, etc. Existing work in XQA focuses on integrating information from heterogeneous knowledge sources. |
| Approach: | They propose to leverage question decomposing for heterogeneous knowledge integration by breaking down a complex question into simpler ones and selecting the appropriate knowledge source for each sub-question. |
| Outcome: | The proposed framework outperforms SOTA methods on complex QA datasets. |
How Proficient Are Large Language Models in Formal Languages? An In-Depth Insight for Knowledge Base Question Answering (2024.findings-acl)
Copied to clipboard
| Challenge: | Recent studies have validated that large language models (LLMs) are capable of solving some KBQA problems, but there has been little discussion on the differences in LLMs’ proficiency in formal languages used in semantic parsing. |
| Approach: | They propose to evaluate the understanding and generation ability of large language models (LLMs) to deal with differently structured logical forms by examining the inter-conversion of natural and formal language through in-context learning of LLMs. |
| Outcome: | The proposed model can understand formal languages as well as humans, but generating correct logical forms remains a challenge. |
Leveraging Machine-Generated Rationales to Facilitate Social Meaning Detection in Conversations (2024.acl-long)
Copied to clipboard
| Challenge: | Existing models for language from a social perspective are gaining popularity . we present a generalizable classification approach that leverages Large Language Models . |
| Approach: | They propose a generalizable classification approach that leverages Large Language Models to detect social meaning in conversations. |
| Outcome: | The proposed approach improves on two social meaning detection tasks over 2,340 settings. |
GraphQ IR: Unifying the Semantic Parsing of Graph Query Languages with One Intermediate Representation (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to neural semantic parsing are limited by the semantic gap between natural and formal languages. |
| Approach: | They propose a unified intermediate representation for graph query languages, named GraphQ IR, which has a natural-language-like expression that bridges the semantic gap and formally defined syntax that maintains the graph structure. |
| Outcome: | The proposed representation can convert user queries into graphQ IR, which can later be losslessly compiled into various downstream graph query languages. |
TransferNet: An Effective and Transparent Framework for Multi-hop Question Answering over Relation Graph (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing models infer the answer by predicting the sequential relation path or aggregating the hidden graph features. |
| Approach: | They propose a model which jumps between entities at multiple steps . they demonstrate that TransferNet surpasses state-of-the-art models by a large margin . |
| Outcome: | The proposed model surpasses state-of-the-art models on MetaQA and on other datasets. |
Incremental Transformer: Efficient Encoder for Incremented Text Over MRC and Conversation Tasks (2025.coling-main)
Copied to clipboard
| Challenge: | Existing encoders that encode incremented inputs have to re-encode the whole text to obtain the encoding of the extended input. |
| Approach: | They propose an efficient encoder dedicated for faster encoding of incremented input . it takes only added input as input but attends to cached representations of original input a lower layer . |
| Outcome: | The proposed encoder achieves 6.2x speedup over current encoders . it takes only added input as input but attends to cached representations of original input . |
MIND: Multimodal Shopping Intention Distillation from Large Vision-language Models for E-commerce Purchase Understanding (2024.emnlp-main)
Copied to clipboard
Baixuan Xu, Weiqi Wang, Haochen Shi, Wenxuan Ding, Huihao Jing, Tianqing Fang, Jiaxin Bai, Xin Liu, Changlong Yu, Zheng Li, Chen Luo, Qingyu Yin, Bing Yin, Long Chen, Yangqiu Song
| Challenge: | Existing methods for acquiring large-scale intentions generate product-centric intentions without product images and incur high costs for scalability. |
| Approach: | They propose a multimodal framework that allows Large Vision-Language Models to infer purchase intentions from multimodal product metadata and prioritize human-centric ones. |
| Outcome: | The proposed framework shows that it is robust to different prompts and superior to previous methods. |
Dependency Parsing via Sequence Generation (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for dependency parsing are transition-based, graph-based and sequence-to-sequence method. |
| Approach: | They propose to achieve dependency parsing (DP) via Sequence Generation (SG) by utilizing only the pre-trained language model without any auxiliary structures. |
| Outcome: | The proposed method performs well on DP benchmarks including PTB, UD2.2, SDP15 and SemEval16. |
KQA Pro: A Dataset with Explicit Compositional Programs for Complex Question Answering over Knowledge Base (2022.acl-long)
Copied to clipboard
Shulin Cao, Jiaxin Shi, Liangming Pan, Lunyiu Nie, Yutong Xiang, Lei Hou, Juanzi Li, Bin He, Hanwang Zhang
| Challenge: | Existing benchmarks for Complex KBQA lack compositional reasoning capabilities . Existing methods for Complex questions are poor in diversity or scale . |
| Approach: | They propose a compositional programming language to represent the reasoning process of complex questions. |
| Outcome: | The proposed dataset includes around 120K diverse natural language questions . it provides a compositional and interpretable programming language to represent the reasoning process of complex questions based on the proposed model . |
CANDLE: Iterative Conceptualization and Instantiation Distillation from Large Language Models for Commonsense Reasoning (2024.acl-long)
Copied to clipboard
Weiqi Wang, Tianqing Fang, Chunyang Li, Haochen Shi, Wenxuan Ding, Baixuan Xu, Zhaowei Wang, Jiaxin Bai, Xin Liu, Cheng Jiayang, Chunkit Chan, Yangqiu Song
| Challenge: | Existing approaches to generalize commonsense reasoning lack instantiated knowledge and require pre-built concept taxonomies and annotations. |
| Approach: | They propose a framework that iteratively performs contextualized conceptualization and instantiation over commonsense knowledge bases by instructing large language models to generate both types of knowledge with critic filtering. |
| Outcome: | Empirical results show that distilling CANDLE on student models provides benefits across three downstream tasks. |
Effectiveness of Pre-training for Few-shot Intent Classification (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing paradigms further pre-train language models such as BERT on vast amount of unlabeled corpus, but we find it highly effective and efficient to simply fine-tune BERT with roughly 1,000 labeled utterances from public datasets. |
| Approach: | They propose to fine-tune BERT with a small set of labeled utterances from public datasets to achieve a pre-trained model based on a set of 1,000 labeles. |
| Outcome: | The proposed model can outperform existing models on domains with very different semantics on novel domains. |