Arrow Research search

Author name cluster

Pengfei He

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

8 papers
2 author rows

Possible papers

8

NeurIPS Conference 2025 Conference Paper

Memory Injection Attacks on LLM Agents via Query-Only Interaction

  • Shen Dong
  • Shaochen Xu
  • Pengfei He
  • Yige Li
  • Jiliang Tang
  • Tianming Liu
  • Hui Liu
  • Zhen Xiang

Agents powered by large language models (LLMs) have demonstrated strong capabilities in a wide range of complex, real-world applications. However, LLM agents with a compromised memory bank may easily produce harmful outputs when the past records retrieved for demonstration are malicious. In this paper, we propose a novel Memory INJection Attack, MINJA, without assuming that the attacker can directly modify the memory bank of the agent. The attacker injects malicious records into the memory bank by only interacting with the agent via queries and output observations. These malicious records are designed to elicit a sequence of malicious reasoning steps corresponding to a different target query during the agent's execution of the victim user's query. Specifically, we introduce a sequence of bridging steps to link victim queries to the malicious reasoning steps. During the memory injection, we propose an indication prompt that guides the agent to autonomously generate similar bridging steps, with a progressive shortening strategy that gradually removes the indication prompt, such that the malicious record will be easily retrieved when processing later victim queries. Our extensive experiments across diverse agents demonstrate the effectiveness of MINJA in compromising agent memory. With minimal requirements for execution, MINJA enables any user to influence agent memory, highlighting the risk.

ICRA Conference 2024 Conference Paper

An Integrated Position-velocity-force Method for Safety-enhanced Shared Control in Robot-assisted Surgical Cutting

  • Xilin Xiao
  • Xiaojian Li
  • Yudong Shi
  • Jin Fang
  • Lin Li
  • Pengfei He
  • Hangjie Mo

Numerous studies have emphasized the application of autonomous intelligence in human-robot shared control to enhance surgical convenience and efficiency. However, the neglect of human dominance may reduce surgical safety. This paper developed a safety-enhanced human-robot shared control method by intelligently allocating control authority, with the surgeon remaining the leader during the surgical procedure. Three controllers are designed initially, including a master hand position (MP) controller and a master hand velocity (MV) controller related to the surgeon's manipulation, and a planned trajectory tracking (PT) controller related to the robot. In precision surgical manipulation scenarios, precise tracking of the human's operation is achieved by combining MP and MV controllers, while a combination of MV and PT controllers is developed in high-efficiency surgical scenarios, which relaxes the requirement for precise tracking of hand position and enables precise robot assistance guided by the velocity of human hand. The autonomous scenarios and controllers switching are accomplished through a motion fusion mechanism, which is achieved via optimizing evaluation functions that are reliant on future states. Furthermore, a force feedback mechanism is proposed to help human understand the intent of autonomous control to improve safety. The feasibility and effectiveness of this method have been validated through simulations and experiments.

ICLR Conference 2024 Conference Paper

Sharpness-Aware Data Poisoning Attack

  • Pengfei He
  • Han Xu 0002
  • Jie Ren 0019
  • Yingqian Cui
  • Shenglai Zeng
  • Hui Liu 0031
  • Charu C. Aggarwal
  • Jiliang Tang

Recent research has highlighted the vulnerability of Deep Neural Networks (DNNs) against data poisoning attacks. These attacks aim to inject poisoning samples into the models' training dataset such that the trained models have inference failures. While previous studies have executed different types of attacks, one major challenge that greatly limits their effectiveness is the uncertainty of the re-training process after the injection of poisoning samples. It includes the uncertainty of training initialization, algorithm and model architecture. To address this challenge, we propose a new strategy called **Sharpness-Aware Data Poisoning Attack (SAPA)**. In particular, it leverages the concept of DNNs' loss landscape sharpness to optimize the poisoning effect on the (approximately) worst re-trained model. Extensive experiments demonstrate that SAPA offers a general and principled strategy that significantly enhances various types of poisoning attacks against various types of re-training uncertainty.

TMLR Journal 2024 Journal Article

Stealthy Backdoor Attack via Confidence-driven Sampling

  • Pengfei He
  • Yue Xing
  • Han Xu
  • Jie Ren
  • Yingqian Cui
  • Shenglai Zeng
  • Jiliang Tang
  • Makoto Yamada

Backdoor attacks facilitate unauthorized control in the testing stage by carefully injecting harmful triggers during the training phase of deep neural networks. Previous works have focused on improving the stealthiness of the trigger while randomly selecting samples to attack. However, we find that random selection harms the stealthiness of the model. In this paper, we identify significant pitfalls of random sampling, which make the attacks more detectable and easier to defend against. To improve the stealthiness of existing attacks, we introduce a method of strategically poisoning samples near the model's decision boundary, aiming to minimally alter the model's behavior (decision boundary) before and after backdooring. Our main insight for detecting boundary samples is exploiting the confidence scores as a metric for being near the decision boundary and selecting those to poison (inject) the attack. The proposed approach makes it significantly harder for defenders to identify the attacks. Our method is versatile and independent of any specific trigger design. We provide theoretical insights and conduct extensive experiments to demonstrate the effectiveness of the proposed method.

JMLR Journal 2023 Journal Article

Large sample spectral analysis of graph-based multi-manifold clustering

  • Nicolas Garcia Trillos
  • Pengfei He
  • Chenghui Li

In this work we study statistical properties of graph-based algorithms for multi-manifold clustering (MMC). In MMC the goal is to retrieve the multi-manifold structure underlying a given Euclidean data set when this one is assumed to be obtained by sampling a distribution on a union of manifolds $\M = \M_1 \cup\dots \cup \M_N$ that may intersect with each other and that may have different dimensions. We investigate sufficient conditions that similarity graphs on data sets must satisfy in order for their corresponding graph Laplacians to capture the right geometric information to solve the MMC problem. Precisely, we provide high probability error bounds for the spectral approximation of a tensorized Laplacian on $\M$ with a suitable graph Laplacian built from the observations; the recovered tensorized Laplacian contains all geometric information of all the individual underlying manifolds. We provide an example of a family of similarity graphs, which we call annular proximity graphs with angle constraints, satisfying these sufficient conditions. We contrast our family of graphs with other constructions in the literature based on the alignment of tangent planes. Extensive numerical experiments expand the insights that our theory provides on the MMC problem. [abs] [ pdf ][ bib ] [ code ] &copy JMLR 2023. ( edit, beta )

ICML Conference 2023 Conference Paper

Probabilistic Categorical Adversarial Attack and Adversarial Training

  • Han Xu 0002
  • Pengfei He
  • Jie Ren 0019
  • Yuxuan Wan
  • Zitao Liu 0001
  • Hui Liu 0031
  • Jiliang Tang

The studies on adversarial attacks and defenses have greatly improved the robustness of Deep Neural Networks (DNNs). Most advanced approaches have been overwhelmingly designed for continuous data such as images. However, these achievements are still hard to be generalized to categorical data. To bridge this gap, we propose a novel framework, Probabilistic Categorical Adversarial Attack (or PCAA). It transfers the discrete optimization problem of finding categorical adversarial examples to a continuous problem that can be solved via gradient-based methods. We analyze the optimality (attack success rate) and time complexity of PCAA to demonstrate its significant advantage over current search-based attacks. More importantly, through extensive empirical studies, we demonstrate that the well-established defenses for continuous data, such as adversarial training and TRADES, can be easily accommodated to defend DNNs for categorical data.

EAAI Journal 2021 Journal Article

Iterated two-phase local search for the colored traveling salesmen problem

  • Pengfei He
  • Jin-Kao Hao

The colored traveling salesmen problem (CTSP) is a generalization of the popular traveling salesman problem with multiple salesmen. In CTSP, the cities are divided into m exclusive city sets ( m is the number of salesmen) and one shared city set. The goal of CTSP is to determine a shortest Hamiltonian circuit (also called route or tour) for each of the m salesmen satisfying that (1) each route includes all cities of an exclusive city set and some (or all) cities of the shared city set, and (2) each city of the shared city set is included in one unique route. CTSP is a relevant model for a number of practical applications and is known to be computationally challenging. We present the first iterated two-phase local search algorithm for this important problem which combines a local optima exploration phase and a local optima escaping phase. We show computational results on 65 common benchmark instances to demonstrate its effectiveness and especially report 22 improved upper bounds. We make the source code of the algorithm publicly available to facilitate its use in future research and real applications.

v2026.09.13