Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Chengliang Liu 0004

dblp:30/5444-4 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
0000-0002-6735-8504ORCID · conflict

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 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 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
2 papers
Efficient and distributed learning · 43% Robot manipulation · 28% Learning paradigms · 21%
Network and information security
1 paper
Security and privacy of machine learning · 100%

Topics — the 7 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Security and privacy of machine learning › retrieval-augmented generation security
knowledge poisoning
1.012026
Inference Cost Attacks for Retrieval-Augmented Large Language Models · WWW 2026
Security and privacy of machine learning
retrieval-augmented generation security
1.012026
Inference Cost Attacks for Retrieval-Augmented Large Language Models · WWW 2026
Machine learning › Learning paradigms
continual learning
0.812024
Probabilistic Spiking Neural Network for Robotic Tactile Continual Learning · ICRA 2024
Machine learning › Efficient and distributed learning
model compression
0.812024
Probabilistic Spiking Neural Network for Robotic Tactile Continual Learning · ICRA 2024
Machine learning › Efficient and distributed learning › model compression
parameter reduction
0.812024
Probabilistic Spiking Neural Network for Robotic Tactile Continual Learning · ICRA 2024
Robotics › Robot manipulation
tactile sensing
0.812024
Probabilistic Spiking Neural Network for Robotic Tactile Continual Learning · ICRA 2024
Natural language and speech › Language models and text generation
retrieval-augmented generation
0.312026
Inference Cost Attacks for Retrieval-Augmented Large Language Models · WWW 2026

Methods — techniques the papers use, named apart from their topics

reinforcement learning · 2.0policy optimization · 2.0LLM agents · 1.0LLM agent · 1.0variational inference · 0.8variational continual learning · 0.8spiking neural network · 0.8
YearPublicationVenuePosition
2026 Inference Cost Attacks for Retrieval-Augmented Large Language Models
abstract
Retrieval-Augmented Generation (RAG)-enhanced LLM systems, while powerful, introduce substantial inference costs due to the inclusion of an extra multi-stage pipeline that dynamically retrieves and synthesizes information from external knowledge sources. This high operational cost exposes a critical vulnerability to Inference Cost Attacks (ICAs). However, existing ICAs often rely on the impractical assumption of direct prompt manipulation. We argue that a more feasible and potent threat to RAG-enhanced LLM systems arises from poisoning external knowledge bases (e.g., web knowledge from the Internet). In this work, we introduce the Retrieval-Augmented Inference Cost Attack (RA-ICA), a novel attacking paradigm that targets the computational cost of RAG-enhanced LLM systems by injecting malicious documents into external knowledge corpus. To operationalize this attack, we propose Computational Resource Exhaustion via External Poisoning (CREEP), a novel framework that leverages LLM agents to automatically craft malicious documents that are both semantically relevant for retrieval and potent for inducing an abnormal increase in token consumption during the inference phase. To enhance the attack's effectiveness, we introduce Memory-Augmented Group Relative Policy Optimization (MA-GRPO), a novel reinforcement learning algorithm that fine-tunes the agents by learning from a dynamic memory of historical best adversarial documents. Extensive experiments across three real-world datasets demonstrate that RA-ICA increases token consumption by up to 13.12 times with an over 90% success rate, without degrading the integrity of the generated answer.
Chengliang Liu 0004, Liang-Bo Ning 0001, Yujuan Ding, Wenqi Fan
WWW1
2024 Probabilistic Spiking Neural Network for Robotic Tactile Continual Learning
abstract
The sense of touch is essential for robots to perform various daily tasks. Artificial Neural Networks have shown significant promise in advancing robotic tactile learning. However, due to the changing of tactile data distribution as robots encounter new tasks, ANN-based robotic tactile learning suffers from catastrophic forgetting. To solve this problem, we introduce a novel continual learning (CL) framework called the Probabilistic Spiking Neural Network with Variational Continual Learning (PSNN-VCL). In this framework, PSNN introduces uncertainty during spike emission and can apply fast Variational Inference by optimizing the uncertainty through backpropagation, which significantly reduces the required model parameters for VCL. We establish a robotic tactile CL benchmark using publicly available datasets to evaluate our method. Experimental results demonstrated that, compared to other CL methods, PSNN-VCL not only achieves superior performance in terms of widely used CL metrics but also achieves at least a 50% reduction in model parameters on the robotic tactile CL benchmark.
Senlin Fang, Chengliang Liu 0004, Jingnan Wang, Yuanzhe Su, Yupo Zhang, Hoiio Kong, Zhengkun Yi, Xinyu Wu 0001
ICRA3