Demo Data from VLDB 2026 / reviewers in the wild / expert
Zeyang Cui
dblp:330/9904
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2026
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Computer networks · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Language models and text generation · 56% Knowledge representation and reasoning · 44% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Knowledge representation and reasoning
reasoning structure |
1.0 | 1 | 2026 | You Don't Need Pre-Built Graphs for RAG: Retrieval Augmented Generation with Adaptive Reasoning Structures · AAAI 2026 |
Natural language and speech › Language models and text generation
retrieval-augmented generation |
1.0 | 1 | 2026 | You Don't Need Pre-Built Graphs for RAG: Retrieval Augmented Generation with Adaptive Reasoning Structures · AAAI 2026 |
Natural language and speech › Language models and text generation
hallucination mitigation |
0.3 | 1 | 2026 | You Don't Need Pre-Built Graphs for RAG: Retrieval Augmented Generation with Adaptive Reasoning Structures · AAAI 2026 |
Methods — techniques the papers use, named apart from their topics
topological sort · 1.0graph pruning · 1.0directed acyclic graph · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | You Don't Need Pre-Built Graphs for RAG: Retrieval Augmented Generation with Adaptive Reasoning StructuresabstractLarge language models (LLMs) often suffer from hallucination, generating factually incorrect statements when handling questions beyond their knowledge and perception. Retrieval-augmented generation (RAG) addresses this by retrieving query-relevant contexts from knowledge bases to support LLM reasoning. Recent advances leverage pre-constructed graphs to capture the relational connections among distributed documents, showing remarkable performance in complex tasks. However, existing Graph-based RAG (GraphRAG) methods rely on a costly process to transform the corpus into a graph, introducing overwhelming token cost and update latency. Moreover, real-world queries vary in type and complexity, requiring different logic structures for accurate reasoning. The pre-built graph may not align with these required structures, resulting in ineffective knowledge retrieval. To this end, we propose a Logic-aware Retrieval Augmented Generation framework (LogicRAG) that dynamically extracts reasoning structures at inference time to guide adaptive retrieval without any pre-built graph. LogicRAG begins by decomposing the input query into a set of subproblems and constructing a directed acyclic graph (DAG) to model the logical dependencies among them. To support coherent multi-step reasoning, LogicRAG then linearizes the graph using topological sort, so that subproblems can be addressed in a logically consistent order. Besides, LogicRAG applies graph pruning to reduce redundant retrieval and uses context pruning to filter irrelevant context, significantly reducing the overall token cost. Extensive experiments demonstrate that LogicRAG achieves both superior performance and efficiency compared to state-of-the-art baselines. Shengyuan Chen, Chuang Zhou 0002, Zheng Yuan 0013, Qinggang Zhang, Zeyang Cui, Hao Chen 0062, Yilin Xiao 0002, Jiannong Cao 0001, Xiao Huang 0001 |
AAAI | 5 |
| 2025 | EdgeShard: Efficient LLM Inference via Collaborative Edge ComputingabstractLarge language models (LLMs) have shown great success in content generation and intelligent intelligent decision making for IoT systems. Traditionally, LLMs are deployed on the cloud, incurring prolonged latency, high bandwidth costs, and privacy concerns. More recently, edge computing has been considered promising in addressing such concerns because the edge devices are closer to data sources. However, edge devices are cursed by their limited resources and can hardly afford LLMs. Existing studies address such a limitation by offloading heavy workloads from edge to cloud or compressing LLMs via model quantization. These methods either still rely heavily on the remote cloud or suffer substantial accuracy loss. This work is the first to deploy LLMs on a collaborative edge computing environment, in which edge devices and cloud servers share resources and collaborate to infer LLMs with high efficiency and no accuracy loss. We design EdgeShard, a novel approach to partition a computation-intensive LLM into affordable shards and deploy them on distributed devices. The partition and distribution are nontrivial, considering device heterogeneity, bandwidth limitations, and model complexity. To this end, we formulate an adaptive joint device selection and model partition problem and design an efficient dynamic programming algorithm to optimize the inference latency and throughput. Extensive experiments of the popular Llama2 serial models on a real-world testbed reveal that EdgeShard achieves up to 50% latency reduction and$2 \times $throughput improvement over the state-of-the-art. Mingjin Zhang, Xiaoming Shen, Jiannong Cao 0001, Zeyang Cui, Shan Jiang 0005 |
IEEE Internet Things J. | 4 |
| 2023 | Towards a Lightweight Stress Prediction Model: a Study on Dimension Reduction and Individual Models in HRV AnalysisabstractOccupational stress has emerged as an undeniable concern. Fortunately, leveraging IoT and AI technologies allows us to gather vital sign data and assess cardiovascular health, individual stress levels, physiological resilience, and emotional states. This study highlights the potential of Heart Rate Variability (HRV) analysis in constructing stress prediction models, with a specific focus on developing an efficient model with minimal data requirements. Convolutional Neural Networks (CNN) have been employed to process raw waveform data for feature extraction. Simultaneously, R-R Interval (RRI) analysis was conducted to derive a set of statistical features. Various dimension reduction algorithms Principal Component Analysis (PCA), Independent Component Analysis (ICA), and Random Projection (RP) were tested, and PCA demonstrated its significance in reducing dataset complexity, enabling swift model training without compromising accuracy excessively. This research aims to explore the feasibility of predicting an individual’s stress levels using minimal and simpler data. The objective is to pave the way for predictive models to be integrated onto lightweight platforms such as millimeter-wave chips. Our approach emphasizes non-contact monitoring of heartbeat variations, particularly beat-to-beat intervals (BBI), offering a novel method for non-invasive stress detection suitable for real-time applications on compact devices. Zeyang Cui, Yanbo Ma, Muxin Ma, Runhe Huang, Bowen Du 0001 |
ICPADS | 1 |