Arrow Research search

Author name cluster

Jun Cai

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.

4 papers
2 author rows

Possible papers

4

AAAI Conference 2026 Conference Paper

CHASE: Contextual History for Adaptive and Simple Exploitation in Large Language Model Jailbreaking

  • Zhiqiang Hao
  • Chuanyi Li
  • Ye Fan
  • Jun Cai
  • Xiao Fu
  • Shangqi Wang
  • Hao Shen
  • Jiao Yin

We propose Contextual History for Adaptive and Simple Exploitation (CHASE), a novel multi-turn method for Large Language Model (LLM) jailbreaking. Rather than directly attack an LLM that may be difficult to jailbreak, CHASE first collects jailbroken histories from an easy-to-jailbreak LLM and then transfers them to the target LLM. Through this history transfer process, CHASE misleads the target LLM into thinking that it is responsible for producing the jailbroken histories and increases the chances of successful jailbreaking by prompting it to continue the conversation. Extensive evaluations on mainstream LLMs show that CHASE consistently achieves higher attack success rates and demands fewer computational resources compared to existing methods.

PDF Details DOI

IROS Conference 2019 Conference Paper

An autonomous exploration algorithm using environment-robot interacted traversability analysis

  • Yujie Tang 0004
  • Jun Cai
  • Meng Chen
  • Xuejiao Yan
  • Yangmin Xie

Auto-exploration is a task for self-driving robots to explore unknown environments, which becomes much complicated when they move on irregular outdoor terrains. To improve the situation, a new frontier-based exploration algorithm is presented in this paper. It starts from original 3D cloud points of the environment to analyze the traversability of the scanned area, and further provides a reachability map to mark all map grid cells as reachable, dangerous or unknown. Frontier candidates are obtained from the reachable map, then clustered and reduced using an improved K-means. Finally, the target of next exploration step is selected from the frontiers left by evaluating their travel cost. The algorithm is validated on an irregular outdoor terrain and shows the capability for a field robot to explore on an irregular terrain.

Details