SearcharxivSearch

arXiv subjects

Zhonghao Xu

Publications and source records attributed to Zhonghao Xu.

3 recordsLinked to original sources

THRD: A Training-Free Multi-Turn Defense Framework for Jailbreak Attacks on Large Language Models

Multi-turn jailbreak attacks pose a growing threat to LLMs by exploiting conversational dynamics such as gradual escalation and cross-turn coordination. Existing defenses either rely on costly retraining -- often degrading model utility -- or apply single-turn analysis independently at each turn, failing to capture how risk accumulates along interaction trajectories. We observe that safety behavior in multi-turn interaction is trajectory-dependent: dialogue history continuously reshapes the model's conditioning context, making it insufficient to evaluate each turn in isolation. Motivated by this insight, we present THRD, the first training-free framework that explicitly models temporal risk accumulation for multi-turn jailbreak defense. THRD integrates four modules: a Turn-level Risk Assessor (TRA) for instantaneous risk estimation, a Historical Context Analyzer (HCA) for cross-turn intent escalation detection, a Response Evaluator (RE) for identifying facilitative outputs, and a Decision Module that combines these signals through a time-evolving scoring mechanism with attenuation-based modulation and trend-aware adjustment. Experiments against state-of-the-art multi-turn attacks -- including tree-search-based and multi-agent collaborative methods -- across two target models show that THRD reduces ASR to 0.2--4.0% while preserving model utility within 1.5% degradation on MMLU and GSM8K. Ablation studies confirm non-redundant module contributions and stable cross-architecture generalization. Analysis of first rejection triggers reveals that over 70% of multi-turn attacks require Turn~2 or later to detect, validating the necessity of explicit temporal aggregation.

cs.CL

A scaling law for large-deformation contact in soft materials

Compression of soft bodies is central to biology, materials science, and robotics, yet existing contact theories break down at large deformations. Here, we develop a general framework for soft-body compression by extending the method of dimensionality reduction into the nonlinear regime. Analytical solutions for contact force and radius are derived and validated against finite element simulations and experiments on canonical geometries (cone, hemisphere, cylinder), achieving high accuracy up to 50% compression. From this framework emerges a universal scaling law that unifies the nonlinear force-displacement response across diverse shapes and even irregular soft objects such as gummy candies. Leveraging this principle, we design a vision-based tactile sensor that reconstructs real-time pressure maps and enables delicate robotic manipulation of fragile items. By bridging nonlinear contact mechanics with practical sensing, this work both advances fundamental understanding of large-strain mechanics and opens a route to robust tactile technologies for soft robotics and biomedical applications.

cond-mat.soft

Resampling community detection to maximize propagation in complex network

Identifying important nodes in complex networks is essential in theoretical and applied fields. A small number of such nodes have deterministic power to decide information spreading, so it is of importance to find a set of nodes that maximize the propagation in networks. Based on baseline ranking methods, various improved methods were proposed, but there does not exist one enhanced method that covers all the base methods. In this paper, we propose a penalized method called RCD-Map, which is short for resampling community detection to maximize propagation, on five baseline ranking methods(Degree centrality, Closeness centrality, Betweennees centrality, K-shell and PageRank) with nodes' local community information. We perturbed the original graph by resampling to decrease the biases and randomness brought by community detection methods-both overlapping and non-overlapping methods. To assess the performance of our identifying method, SIR(susceptible-infected-recovered) model is applied to simulate the information propagation process. The result shows that methods with penalties perform better with a vaster propagation range in general.

cs.SI