Yanchi Liu

Yanchi Liu

Auto-generated profile, based on publicly available information

Yanchi Liu

NEC Labs America

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 October 2025 in ACM Computing Surveys
Verified
Journal Article
Open access
LCLing Chen
Ling Chen
XZXujiang Zhao
Xujiang Zhao
JLJiaying Lu
Jiaying Lu
CDChengyuan Deng
Chengyuan Deng
CZCan Zheng
Can Zheng
LZLiang Zhao
Liang Zhao
Large language models (LLMs) have significantly advanced the field of natural language processing (NLP), providing a highly useful, task-agnostic foundation for a wide range of applications. However, directly applying LLMs to solve sophisticated problems in specific domains meets many hurdles, caused by the heterogeneity of domain data, the sophistication of domain knowledge, the uniqueness of domain objectives, and the diversity of the constraints (e.g., various social norms, cultural conformity, religious beliefs, and ethical standards in the domain applications). Domain specification techniques are key to making large language models disruptive in many applications. Specifically, to solve these hurdles, there has been a notable increase in research and practices conducted in recent years on the domain specialization of LLMs. This emerging field of study, with its substantial potential for impact, necessitates a comprehensive and systematic review to summarize better and guide ongoing work in this area. In this article, we present a comprehensive survey on domain specification techniques for large language models, an emerging direction critical for large language model applications. First, we propose a systematic taxonomy that categorizes the LLM domain-specialization techniques based on the accessibility to LLMs and summarizes the framework for all the subcategories as well as their relations and differences to each other. Second, we present an extensive taxonomy of critical application domains that can benefit dramatically from specialized LLMs, discussing their practical significance and open challenges. Last, we offer our insights into the current research status and future trends in this area.

26 June 2023 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
DLDongshegn Luo
Dongshegn Luo
WCWei Cheng
Wei Cheng
YWYingheng Wang
Yingheng Wang
DXDongkuan Xu
Dongkuan Xu
JNJingchao Ni
Jingchao Ni
XZXiang Zhang
Xiang Zhang
Various contrastive learning approaches have been proposed in recent years and achieve significant empirical success. While effective and prevalent, contrastive learning has been less explored for time series data. A key component of contrastive learning is to select appropriate augmentations imposing some priors to construct feasible positive samples, such that an encoder can be trained to learn robust and discriminative representations. Unlike image and language domains where "desired'' augmented samples can be generated with the rule of thumb guided by prefabricated human priors, the ad-hoc manual selection of time series augmentations is hindered by their diverse and human-unrecognizable temporal structures. How to find the desired augmentations of time series data that are meaningful for given contrastive learning tasks and datasets remains an open question. In this work, we address the problem by encouraging both high fidelity and variety based on information theory. A theoretical analysis leads to the criteria for selecting feasible data augmentations. On top of that, we propose a new contrastive learning approach with information-aware augmentations, InfoTS, that adaptively selects optimal augmentations for time series representation learning. Experiments on various datasets show highly competitive performance with up to a 12.0% reduction in MSE on forecasting tasks and up to 3.7% relative improvement in accuracy on classification tasks over the leading baselines.

1 January 2024
Verified
Conference Paper
Open access
PDF file
YXYijia Xiao
Yijia Xiao
YJYiqiao Jin
Yiqiao Jin
YBYushi Bai
Yushi Bai
YWYue Wu
Yue Wu
XYXianjun Yang
Xianjun Yang
WCWei Cheng
Wei Cheng
Yijia Xiao, Yiqiao Jin, Yushi Bai, Yue Wu, Xianjun Yang, Xiao Luo, Wenchao Yu, Xujiang Zhao, Yanchi Liu, Quanquan Gu, Haifeng Chen, Wei Wang, Wei Cheng. Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing. 2024.

1 January 2024
Verified
Conference Paper
Open access
PDF file
LCLing Chen
Ling Chen
XZXujiang Zhao
Xujiang Zhao
XZXuchao Zhang
Xuchao Zhang
WCWei Cheng
Wei Cheng
YLYanchi Liu
Yanchi Liu
HCHaifeng Chen
Haifeng Chen
Chen Ling, Xujiang Zhao, Xuchao Zhang, Wei Cheng, Yanchi Liu, Yiyou Sun, Mika Oishi, Takao Osaki, Katsushi Matsuda, Jie Ji, Guangji Bai, Liang Zhao, Haifeng Chen. Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). 2024.

4 August 2023
Verified
Conference Paper
Open access
DWDongjie Wang
Dongjie Wang
ZCZhengzhang Chen
Zhengzhang Chen
Yanjie FuYanjie Fu
Yanjie Fu
YLYanchi Liu
Yanchi Liu
HCHaifeng Chen
Haifeng Chen
The task of root cause analysis (RCA) is to identify the root causes of system faults/failures by analyzing system monitoring data. Efficient RCA can greatly accelerate system failure recovery and mitigate system damages or financial losses. However, previous research has mostly focused on developing offline RCA algorithms, which often require manually initiating the RCA process, a significant amount of time and data to train a robust model, and then being retrained from scratch for a new system fault. In this paper, we propose CORAL, a novel online RCA framework that can automatically trigger the RCA process and incrementally update the RCA model. CORAL consists of Trigger Point Detection, Incremental Disentangled Causal Graph Learning, and Network Propagation-based Root Cause Localization. The Trigger Point Detection component aims to detect system state transitions automatically and in near-real-time. To achieve this, we develop an online trigger point detection approach based on multivariate singular spectrum analysis and cumulative sum statistics. To efficiently update the RCA model, we propose an incremental disentangled causal graph learning approach to decouple the state-invariant and state-dependent information. After that, CORAL applies a random walk with restarts to the updated causal graph to accurately identify root causes. The online RCA process terminates when the causal graph and the generated root cause list converge. Extensive experiments on three real-world datasets demonstrate the effectiveness and superiority of the proposed framework.

1 January 2024
Verified
Conference Paper
Open access
PDF file
FWFali Wang
Fali Wang
RBRunxue Bao
Runxue Bao
SWSuhang Wang
Suhang Wang
WYWenchao Yu
Wenchao Yu
YLYanchi Liu
Yanchi Liu
HCHaifeng Chen
Haifeng Chen
Fali Wang, Runxue Bao, Suhang Wang, Wenchao Yu, Yanchi Liu, Wei Cheng, Haifeng Chen. Findings of the Association for Computational Linguistics: EMNLP 2024. 2024.