Papers by Da Huang
RecLM: Recommendation Instruction Tuning (2025.acl-long)
Copied to clipboard
| Challenge: | Modern recommender systems aim to understand user-item relationships through past interactions, but their effectiveness is limited when handling sparse data or zero-shot scenarios. |
| Approach: | They propose a model-agnostic recommendation instruction-tuning paradigm that integrates large language models with collaborative filtering. |
| Outcome: | The proposed model-agnostic recommendation instruction-tuning paradigm improves performance across various settings and plug-and-play compatibility with state-of-the-art recommender systems. |
Symbol tuning improves in-context learning in language models (2023.emnlp-main)
Copied to clipboard
Jerry Wei, Le Hou, Andrew Lampinen, Xiangning Chen, Da Huang, Yi Tay, Xinyun Chen, Yifeng Lu, Denny Zhou, Tengyu Ma, Quoc Le
| Challenge: | Language models are sensitive to the way that prompts are given, indicating that they are not reasoning in a robust manner. |
| Approach: | They propose to fine tune language models on in-context input-label pairs where natural language labels are replaced with arbitrary symbols. |
| Outcome: | The proposed model is much stronger at reasoning tasks and more robust to underspecified prompts than the standard model. |
RecGPT: A Foundation Model for Sequential Recommendation (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches fail in cold-start and cross-domain scenarios where new users or items lack sufficient interaction history. |
| Approach: | They propose a foundation model for sequential recommendation that achieves genuine zero-shot generalization capabilities by deriving item representations exclusively from textual features. |
| Outcome: | The proposed model achieves zero-shot generalization capabilities in cold-start and cross-domain scenarios. |
TESTEVAL: Benchmarking Large Language Models for Test Case Generation (2025.findings-naacl)
Copied to clipboard
Wenhan Wang, Chenyuan Yang, Zhijie Wang, Yuheng Huang, Zhaoyang Chu, Da Song, Lingming Zhang, An Ran Chen, Lei Ma
| Challenge: | Existing methods to generate test cases using large language models are limited in their ability to generate unit test cases. |
| Approach: | They propose a test case generation benchmark that uses large language models to generate unit test cases. |
| Outcome: | The proposed test case generation benchmarks compare LLMs with commercial and open-source LLM platforms and find that they lack the ability to comprehend program logic and execution paths. |
Recall and Learn: A Memory-augmented Solver for Math Word Problems (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for solving math word problems are based on template-based generation which results in limited generalization capability. |
| Approach: | They propose a human-like analogical learning method for the math word problem . it uses modules of memory, representation, analogy, and reasoning to make a new exercise . |
| Outcome: | The proposed method outperforms state-of-the-art models on two well-known datasets. |
Retrieval-Augmented Language Models are Mimetic Theorem Provers (2025.findings-emnlp)
Copied to clipboard
Wenjie Yang, Ruiyuan Huang, Jiaxing Guo, Zicheng Lyu, Tongshan Xu, Shengzhong Zhang, Lun Du, Da Zheng, Zengfeng Huang
| Challenge: | Large language models often fail to provide rigorous proof-based reasoning for research-level mathematics. |
| Approach: | They propose a simple yet effective RAG framework that augments retrieved proofs with queries and document contexts to improve retrieval performance. |
| Outcome: | The proposed framework improves retrieval performance by 34.19% . dual RAG can be used to prove research-level theorems in theoretical machine learning . |
Trial and Error: Exploration-Based Trajectory Optimization of LLM Agents (2024.acl-long)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) have become integral components in various autonomous agent systems. |
| Approach: | They propose an exploration-based trajectory optimization approach that allows agents to learn from their exploration failures. |
| Outcome: | The proposed method outperforms baseline methods on three complex tasks by a large margin. |