Long-term LLM agent memory has become a critical state layer where records are written once and reused across sessions, turning prompt poisoning from a one-shot hazard into persistent database corruption. Traditional stateless RAG defenses reset per query and fail to evaluate the trustworthiness of persistent records o...
Ze-Ning Li, Hong-Chao Qin, Guang Zeng et al.· Proceedings of the 35th ACM...· 0 citations
Node representation learning on dynamic graphs is a fundamental task for numerous real-world applications. However, existing dynamic Graph Neural Networks (GNNs) face two critical challenges: (1) the inability to effectively model crucial directional information inherent in many real-world interactions, and (2) suffer...
Ze-Ning Li, Rong-Hua Li, Yi-Chun Yang et al.· Proceedings of the 35th ACM...· 0 citations
Geo-filtered approximate nearest-neighbor (GFANN) search retrieves the objects inside a query-specified geographic disk whose feature vectors are closest to a query vector, a core operation in location-aware Web search. A disk filter on a standard proximity graph invalidates out-of-disk routing vertices; on selective d...
Zhi-Qiu Zou, Rong-Hua Li, Qiang-Qiang Dai et al.· 0 citations
Long-term agent memory is an online, non-monotonic retrieval problem. New interactions may reinforce, contradict, supersede, specialize, abstract, or expire earlier memories; the same fact can be a wrong current answer, a correct historical answer, or necessary transition evidence depending on query intent. Existing ch...
Ya-Xin Deng, Hong-Chao Qin, Tian-Yi Gao et al.· Proceedings of the 35th ACM...· 0 citations
Resistance distance computation is a fundamental problem in graph data management. To avoid the high latency of online evaluation, recent work builds offline indexes. Existing approaches, however, fall into two families with complementary weaknesses: loop-erased random-walk methods (e.g., LEIndex) are efficient on fa...
Mei-Hao Liao, Bao Xing, Rong-Hua Li et al.· Proceedings of the ACM on Ma...· 0 citations
Density decomposition characterizes the multi-level dense structure of large networks and supports a wide range of graph mining applications. Given a graph
G = (V, E)
, it assigns each vertex an integral dense number (IDN) and produces a nested sequence of layers D
0
⊇ D
1
⊇ ... ⊇ D
p
that capture increasingl...
Ya-Long Zhang, Rong-Hua Li, Qi Zhang et al.· Proceedings of the ACM on Ma...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.