Papers by Yuzhong Chen
Timeline-based Sentence Decomposition with In Context Learning for Temporal Fact Extraction (2024.acl-long)
Copied to clipboard
| Challenge: | Recent research on temporal fact extraction fails to establish time-to-fact correspondences in complex sentences. |
| Approach: | They propose a timeline-based sentence decomposition strategy using large language models with in-context learning to extract temporal facts from natural language text. |
| Outcome: | The proposed method achieves state-of-the-art on a complex temporal fact extraction dataset. |
Enhancing Foundation Models in Transaction Understanding with LLM-based Sentence Embeddings (2025.emnlp-industry)
Copied to clipboard
| Challenge: | Existing foundation models for tabular transactional data rely on index-based representations for categorical merchant fields. |
| Approach: | They propose a framework that uses LLM-generated embeddings as semantic initializations for lightweight transaction models. |
| Outcome: | The proposed framework improves performance on large transaction datasets. |
Automatic rule generation for time expression normalization (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing SOTA methods for normalization rely on expert-designed rules or grammars . current methods are domain sensitive and not sufficient on emerging corpora . |
| Approach: | They propose a method that generates normalization rules from annotated data without expert intervention. |
| Outcome: | The proposed method surpasses existing rule-based methods on the Tweets benchmark and on the TempEval-3 benchmark. |
Semantic Framework based Query Generation for Temporal Question Answering over Knowledge Graphs (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for temporal question answering ignore intrinsic connections between events that can make them temporally related. |
| Approach: | They propose a temporal question answering method that generates query graphs by exploring relevant facts of mentioned entities. |
| Outcome: | The proposed method outperforms existing methods on two benchmarks over different knowledge graphs. |
Feedback to Reasoning: LLM-Assisted Molecular Optimization with Domain Feedback and Historical Reasoning (2026.findings-acl)
Copied to clipboard
Wenhan Gao, Xiran Fan, Chin-Chia Michael Yeh, Jiarui Sun, Yuzhong Chen, Menghai Pan, Mahashweta Das, Yi Liu
| Challenge: | Existing methods for molecular optimization do not leverage domain feedback and historical knowledge with reasoning traces and chemical insights. |
| Approach: | They propose a conversational molecular optimization pipeline that enables LLMs to accumulate and retrieve past actions, rationales, and feedback. |
| Outcome: | The proposed framework transforms LLMs from passive text generators into agentic experts that learn both actions and reasoning from experience. |
AdaLoGN: Adaptive Logic Graph Network for Reasoning-Based Machine Reading Comprehension (2022.acl-long)
Copied to clipboard
| Challenge: | Existing methods and limitations for machine reading comprehension are insufficient for logical reasoning over text. |
| Approach: | They propose a neural-symbolic approach which passes messages over a graph representing logical relations between text units to predict an answer. |
| Outcome: | The proposed approach outperforms existing methods on ReClor and LogiQA. |
Enhancing Hyperbolic Knowledge Graph Embeddings via Lorentz Transformations (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for knowledge graph embedding rely on tangent approximation and are not fully hyperbolic. |
| Approach: | They propose a fully hyperbolic KGE method that represents entities as points in the Lorentz model and represents relations as the intrinsic transformation. |
| Outcome: | The proposed method captures various types of relations including hierarchical structures. |
Demystify the Role of Memory in Machine Learning Engineering Agents (2026.findings-acl)
Copied to clipboard
Xinyu Zhao, Junpeng Wang, Yuzhong Chen, Menghai Pan, Chin-Chia Michael Yeh, Jiarui Sun, Yan Zheng, Mahashweta Das, Tianlong Chen
| Challenge: | Unlike short, reactive exchanges, MLE agents solve tasks through cycles of experimentation and improvement where past errors can inform future success. |
| Approach: | They propose a dynamic coding memory that captures and reuses debugging experiences and integrates it into two representative agent paradigms. |
| Outcome: | The proposed agent model captures and reuses debugging experiences and integrates it into two agent paradigms. |