Yuqing Liu
Author directoryOther people with similar names: Yuqing Liu
2026
Optimizing Reasoning LLMs for Automated Feature Engineering via Multi-Stage Direct Preference Optimization
Mingzhi Hu | Menghai Pan | Yuzhong Chen | Junpeng Wang | Yingtong Dou | Vineeth Rakesh | Hoang Anh Duy Le | Uday Singh Saini | Xin Dai | Xiran Fan | Yuqing Liu | Yiwei Cai
Findings of the Association for Computational Linguistics: IJCNLP-AACL 2026
Mingzhi Hu | Menghai Pan | Yuzhong Chen | Junpeng Wang | Yingtong Dou | Vineeth Rakesh | Hoang Anh Duy Le | Uday Singh Saini | Xin Dai | Xiran Fan | Yuqing Liu | Yiwei Cai
Findings of the Association for Computational Linguistics: IJCNLP-AACL 2026
Feature engineering is central to tabular machine learning, but useful transformations must be both statistically predictive and semantically valid with respect to feature names, task descriptions, and observed data patterns. Although large language models can exploit such context, prompt-based feature engineering remains unreliable: generated transformations may be redundant, schema-invalid, non-executable, or weakly aligned with downstream performance. We propose MSDPO, a two-stage Direct Preference Optimization framework for automated feature engineering. Proposal-DPO aligns the model toward useful, diverse, and non-redundant feature proposals, while Function-DPO aligns it toward executable feature-construction code using execution and validation feedback. After alignment, the frozen model directly generates transformation functions for unseen tabular tasks. Across 20 classification datasets, MSDPO achieves the best overall mean rank among strong classical and LLM-based feature-engineering baselines. Under a budget-matched comparison inside the same feature-engineering harness, MSDPO also attains a better mean rank than Claude Sonnet 4.6, despite using an 8B open-weight backbone. Moreover, preferences constructed from classification signals transfer to four regression tasks. Ablation results show that the two DPO stages are complementary, improving both feature design and executable implementation.
2025
LLMInit: A Free Lunch from Large Language Models for Selective Initialization of Recommendation
Weizhi Zhang | Liangwei Yang | Wooseong Yang | Henry Peng Zou | Yuqing Liu | Ke Xu | Sourav Medya | Philip S. Yu
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing: Industry Track
Weizhi Zhang | Liangwei Yang | Wooseong Yang | Henry Peng Zou | Yuqing Liu | Ke Xu | Sourav Medya | Philip S. Yu
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing: Industry Track
Collaborative filtering (CF) is widely adopted in industrial recommender systems (RecSys) for modeling user-item interactions across numerous applications, but often struggles with cold-start and data-sparse scenarios. Recent advancements in pre-trained large language models (LLMs) with rich semantic knowledge, offer promising solutions to these challenges. However, deploying LLMs at scale is hindered by their significant computational demands and latency. In this paper, we propose a novel and scalable LLM-RecSys framework, LLMInit, designed to integrate pretrained LLM embeddings into CF models through selective initialization strategies. Specifically, we identify the embedding collapse issue observed when CF models scale and match the large embedding sizes in LLMs and avoid the problem by introducing efficient sampling methods, including, random, uniform, and variance-based selections. Comprehensive experiments conducted on multiple real-world datasets demonstrate that LLMInit significantly improves recommendation performance while maintaining low computational costs, offering a practical and scalable solution for industrial applications. To facilitate industry adoption and promote future research, we provide open-source access to our implementation at https://github.com/DavidZWZ/LLMInit.