Publications (17)
Autopoiesis: A Self-Evolving System Paradigm for LLM Serving Under Runtime Dynamics
Youhe Jiang, Ran Yan, You Peng +4
Modern Large Language Model (LLM) serving operates in highly volatile environments characterized by severe runtime dynamics, such as workload fluctuations and elastic cluster autos…
PSPC: Efficient Parallel Shortest Path Counting on Large-Scale Graphs
You Peng, Jeffrey Xu Yu, Sibo Wang
In modern graph analytics, the shortest path is a fundamental concept. Numerous \rrev{recent works} concentrate mostly on the distance of these shortest paths. Nevertheless, in the…
Finding Top-r Influential Communities under Aggregation Functions
You Peng, Song Bian, Rui Li +2
Community search is a problem that seeks cohesive and connected subgraphs in a graph that satisfy certain topology constraints, e.g., degree constraints. The majority of existing w…
DSPC: Efficiently Answering Shortest Path Counting on Dynamic Graphs
Qingshuai Feng, You Peng, Wenjie Zhang +2
The widespread use of graph data in various applications and the highly dynamic nature of today's networks have made it imperative to analyze structural trends in dynamic graphs on…
FAST: FPGA-based Subgraph Matching on Massive Graphs
Xin Jin, Zhengyi Yang, Xuemin Lin +3
Subgraph matching is a basic operation widely used in many applications. However, due to its NP-hardness and the explosive growth of graph data, it is challenging to compute subgra…
Efficient k-clique Listing with Set Intersection Speedup [Technical Report]
Zhirong Yuan, You Peng, Peng Cheng +4
Listing all k-cliques is a fundamental problem in graph mining, with applications in finance, biology, and social network analysis. However, owing to the exponential growth of the…
TDB: Breaking All Hop-Constrained Cycles in Billion-Scale Directed Graphs
You Peng, Xuemin Lin, Michael Yu +2
The Feedback vertex set with the minimum size is one of Karp's 21 NP-complete problems targeted at breaking all the cycles in a graph. This problem is applicable to a broad variety…
Metadata Enrichment of Long Text Documents using Large Language Models
Manika Lamba, You Peng, Sophie Nikolov +2
In this project, we semantically enriched and enhanced the metadata of long text documents, theses and dissertations, retrieved from the HathiTrust Digital Library in English publi…
PEFP: Efficient k-hop Constrained s-t Simple Path Enumeration on FPGA
Zhengmin Lai, You Peng, Shiyu Yang +2
Graph plays a vital role in representing entities and their relationships in a variety of fields, such as e-commerce networks, social networks and biological networks. Given two ve…
HexAGenT: Efficient Agentic LLM Serving via Workflow- and Heterogeneity-Aware Scheduling
You Peng, Youhe Jiang, Wenshuang Li +5
Agentic LLM applications increasingly execute user requests as multi-step workflows involving planning, tool use, branching, refinement, and synthesis. In such settings, users expe…
Generative Multi-Objective Bayesian Optimization with Scalable Batch Evaluations for Sample-Efficient De Novo Molecular Design
Madhav R. Muthyala, Farshud Sorourifar, Tianhong Tan +2
Designing molecules that must satisfy multiple, often conflicting objectives is a central challenge in molecular discovery. The enormous size of chemical space and the cost of high…
Towards Real-Time Counting Shortest Cycles on Dynamic Graphs: A Hub Labeling Approach
Qingshuai Feng, You Peng, Wenjie Zhang +2
With the ever-increasing prevalence of graph data in a wide spectrum of applications, it becomes essential to analyze structural trends in dynamic graphs on a continual basis. The…
Efficiently Answering Quality Constrained Shortest Distance Queries in Large Graphs
You Peng, Zhuo Ma, Wenjie Zhang +3
The shortest-path distance is a fundamental concept in graph analytics and has been extensively studied in the literature. In many real-world applications, quality constraints are…
Zero-Indexing Internet Search Augmented Generation for Large Language Models
Guangxin He, Zonghong Dai, Jiangcheng Zhu +6
Retrieval augmented generation has emerged as an effective method to enhance large language model performance. This approach typically relies on an internal retrieval module that u…
TQA-Bench: Evaluating LLMs for Multi-Table Question Answering
Zipeng Qiu, Chenyue Li, You Peng +3
The advance of large language models (LLMs) has unlocked great opportunities in complex multi-modal data management tasks, particularly in question answering (QA) over complicated…
SyMANTIC: An Efficient Symbolic Regression Method for Interpretable and Parsimonious Model Discovery in Science and Beyond
Madhav R. Muthyala, Farshud Sorourifar, You Peng +1
Symbolic regression (SR) is an emerging branch of machine learning focused on discovering simple and interpretable mathematical expressions from data. Although a wide-variety of SR…
HEXGEN-FLOW: Optimizing LLM Inference Request Scheduling for Agentic Text-to-SQL
You Peng, Youhe Jiang, Wenqi Jiang +2
Recent advances in agentic large language models (LLMs) have substantially improved Text-to-SQL, enabling users without database expertise to query databases intuitively. However,…