Xinyi Zhu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xinyi Zhu has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Lei Chen
HKUST, Hong Kong, Hong Kong
2 shared publications - Hao Wang
Department of Data Science and Analytics, The Hong Kong University of Science and Technology (GuangZhou)
1 shared publication - Haoyang Li
The Hong Kong Polytechnic University, Hong Kong, Hong Kong
1 shared publication - Jiawei Li
Data Science and Analytics, The Hong Kong University of Science and Technology (Guangzhou)
1 shared publication - Lifan Zhao
Shanghai Jiao Tong University
1 shared publication - Liping Wang
The Hong Kong University of Science and Technology (Guangzhou), Guangzhou, China
1 shared publication
Latest Publications
- Open Access
- 18 May 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (3) , 1-27
Skyline Retrieval meets Set-Cover Chunk Merging: A Cost-Effective RAG-Sketch for Long-Context LLM QA
Large Language Model (LLM) question answering (QA) is essential for various real-world applications. As the demand for LLMs in domain-specific, up-to-date, and private scenarios increases, equipping them with large external corpus for QA, referred to long-context LLM QA, becomes critical. However, existing methods struggle to balance the comprehensive retrieval of scattered information required for accurate QA with the high token costs of long-context processing. We identify two major causes of this bottleneck: (1) limited retrieval coverage under complex queries and large input scales, and (2) repeated document access enforced by rigid query-by-query processing. In this paper, we introduce a cost-effective Retrieval-Augmented Generation Sketch (RAG-Sketch) for long-context LLM QA. To enable more thorough information retrieval without exhaustive context traversal, we propose a new skyline retrieval module incorporating query decomposition into a pre-defined schema. This approach retrieves Pareto optimal chunks by jointly considering semantic similarity and the presence of key information within the decomposed queries. Based on retrieved chunks, we formally define a set cover chunk merging optimization problem and proposes a greedy algorithm with theoretical guarantees that effectively reduces redundant access. Our experiments on widely used long-context QA benchmarks demonstrate that RAG-Sketch improves prediction accuracy by 24.5% while reducing token costs by 58.5% compared with the state of the art.
- 18 May 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (3) , 1-27
Open AccessSkyline Retrieval meets Set-Cover Chunk Merging: A Cost-Effective RAG-Sketch for Long-Context LLM QA
Large Language Model (LLM) question answering (QA) is essential for various real-world applications. As the demand for LLMs in domain-specific, up-to-date, and private scenarios increases, equipping them with large external corpus for QA, referred to long-context LLM QA, becomes critical. However, existing methods struggle to balance the comprehensive retrieval of scattered information required for accurate QA with the high token costs of long-context processing. We identify two major causes of this bottleneck: (1) limited retrieval coverage under complex queries and large input scales, and (2) repeated document access enforced by rigid query-by-query processing. In this paper, we introduce a cost-effective Retrieval-Augmented Generation Sketch (RAG-Sketch) for long-context LLM QA. To enable more thorough information retrieval without exhaustive context traversal, we propose a new skyline retrieval module incorporating query decomposition into a pre-defined schema. This approach retrieves Pareto optimal chunks by jointly considering semantic similarity and the presence of key information within the decomposed queries. Based on retrieved chunks, we formally define a set cover chunk merging optimization problem and proposes a greedy algorithm with theoretical guarantees that effectively reduces redundant access. Our experiments on widely used long-context QA benchmarks demonstrate that RAG-Sketch improves prediction accuracy by 24.5% while reducing token costs by 58.5% compared with the state of the art.
- Top Cited PapersOpen Access
- 3 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 58 (7) , 1-37
Methods for Acquiring and Incorporating Knowledge into Stock Price Prediction: A Survey
Predicting stock prices presents a challenging research problem due to the inherent volatility and non-linear nature of the stock market. In recent years, knowledge-enhanced stock price prediction methods have shown groundbreaking results by utilizing external knowledge to understand the stock market. Despite the importance of these methods, there is a scarcity of scholarly works that systematically synthesize previous studies from the perspective of external knowledge types. Specifically, the external knowledge can be modeled in different data structures, which we group into non-graph-based formats and graph-based formats: (1) non-graph-based knowledge captures contextual information and multimedia descriptions specifically associated with an individual stock; (2) graph-based knowledge captures interconnected and interdependent information in the stock market. This survey article aims to provide a systematic and comprehensive description of methods for acquiring external knowledge from various unstructured data sources and then incorporating it into stock price prediction models. We also explore fusion methods for combining external knowledge with historical price features. Moreover, this article includes a compilation of relevant datasets and delves into potential future research directions in this domain.
- 3 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 58 (7) , 1-37
Top Cited PapersOpen AccessMethods for Acquiring and Incorporating Knowledge into Stock Price Prediction: A Survey
Predicting stock prices presents a challenging research problem due to the inherent volatility and non-linear nature of the stock market. In recent years, knowledge-enhanced stock price prediction methods have shown groundbreaking results by utilizing external knowledge to understand the stock market. Despite the importance of these methods, there is a scarcity of scholarly works that systematically synthesize previous studies from the perspective of external knowledge types. Specifically, the external knowledge can be modeled in different data structures, which we group into non-graph-based formats and graph-based formats: (1) non-graph-based knowledge captures contextual information and multimedia descriptions specifically associated with an individual stock; (2) graph-based knowledge captures interconnected and interdependent information in the stock market. This survey article aims to provide a systematic and comprehensive description of methods for acquiring external knowledge from various unstructured data sources and then incorporating it into stock price prediction models. We also explore fusion methods for combining external knowledge with historical price features. Moreover, this article includes a compilation of relevant datasets and delves into potential future research directions in this domain.