Searcharxiv⌕ Search

arXiv subjects

Xuan Chen

Publications and source records attributed to Xuan Chen.

At least 55 records · Page 3Linked to original sources

ASPIRER: Bypassing System Prompts With Permutation-based Backdoors in LLMs

Large Language Models (LLMs) have become integral to many applications, with system prompts serving as a key mechanism to regulate model behavior and ensure ethical outputs. In this paper, we introduce a novel backdoor attack that systematically bypasses these system prompts, posing significant risks to the AI supply chain. Under normal conditions, the model adheres strictly to its system prompts. However, our backdoor allows malicious actors to circumvent these safeguards when triggered. Specifically, we explore a scenario where an LLM provider embeds a covert trigger within the base model. A downstream deployer, unaware of the hidden trigger, fine-tunes the model and offers it as a service to users. Malicious actors can purchase the trigger from the provider and use it to exploit the deployed model, disabling system prompts and achieving restricted outcomes. Our attack utilizes a permutation trigger, which activates only when its components are arranged in a precise order, making it computationally challenging to detect or reverse-engineer. We evaluate our approach on five state-of-the-art models, demonstrating that our method achieves an attack success rate (ASR) of up to 99.50% while maintaining a clean accuracy (CACC) of 98.58%, even after defensive fine-tuning. These findings highlight critical vulnerabilities in LLM deployment pipelines and underscore the need for stronger defenses.

cs.CR↗

Codesigned counterdiabatic quantum optimization on a photonic quantum processor

Codesign, an integral part of computer architecture referring to the information interaction in hardware-software stack, is able to boost the algorithm mapping and execution in the computer hardware. This well applies to the noisy intermediate-scale quantum era, where quantum algorithms and quantum processors both need to be shaped to allow for advantages in experimental implementations. The state-of-the-art quantum adiabatic optimization algorithm faces challenges for scaling up, where the deteriorating optimization performance is not necessarily alleviated by increasing the circuit depth given the noise in the hardware. The counterdiabatic term can be introduced to accelerate the convergence, but decomposing the unitary operator corresponding to the counterdiabatic terms into one and two-qubit gates may add additional burden to the digital circuit depth. In this work, we focus on the counterdiabatic protocol with a codesigned approach to implement this algorithm on a photonic quantum processor. The tunable Mach-Zehnder interferometer mesh provides rich programmable parameters for local and global manipulation, making it able to perform arbitrary unitary evolutions. Accordingly, we directly implement the unitary operation associated to the counterdiabatic quantum optimization on our processor without prior digitization. Furthermore, we develop and implement an optimized counterdiabatic method by tackling the higher-order many-body interaction terms. Moreover, we benchmark the performance in the case of factorization, by comparing the final success probability and the convergence speed. In conclusion, we experimentally demonstrate the advantages of a codesigned mapping of counterdiabatic quantum dynamics for quantum computing on photonic platforms.

quant-ph↗

DERA: Dense Entity Retrieval for Entity Alignment in Knowledge Graphs

Entity Alignment (EA) aims to match equivalent entities in different Knowledge Graphs (KGs), which is essential for knowledge fusion and integration. Recently, embedding-based EA has attracted significant attention and many approaches have been proposed. Early approaches primarily focus on learning entity embeddings from the structural features of KGs, defined by relation triples. Later methods incorporated entities' names and attributes as auxiliary information to enhance embeddings for EA. However, these approaches often used different techniques to encode structural and attribute information, limiting their interaction and mutual enhancement. In this work, we propose a dense entity retrieval framework for EA, leveraging language models to uniformly encode various features of entities and facilitate nearest entity search across KGs. Alignment candidates are first generated through entity retrieval, which are subsequently reranked to determine the final alignments. We conduct comprehensive experiments on both cross-lingual and monolingual EA datasets, demonstrating that our approach achieves state-of-the-art performance compared to existing EA methods.

cs.CL↗

RL-JACK: Reinforcement Learning-powered Black-box Jailbreaking Attack against LLMs

Modern large language model (LLM) developers typically conduct a safety alignment to prevent an LLM from generating unethical or harmful content. Recent studies have discovered that the safety alignment of LLMs can be bypassed by jailbreaking prompts. These prompts are designed to create specific conversation scenarios with a harmful question embedded. Querying an LLM with such prompts can mislead the model into responding to the harmful question. The stochastic and random nature of existing genetic methods largely limits the effectiveness and efficiency of state-of-the-art (SOTA) jailbreaking attacks. In this paper, we propose RL-JACK, a novel black-box jailbreaking attack powered by deep reinforcement learning (DRL). We formulate the generation of jailbreaking prompts as a search problem and design a novel RL approach to solve it. Our method includes a series of customized designs to enhance the RL agent's learning efficiency in the jailbreaking context. Notably, we devise an LLM-facilitated action space that enables diverse action variations while constraining the overall search space. We propose a novel reward function that provides meaningful dense rewards for the agent toward achieving successful jailbreaking. Through extensive evaluations, we demonstrate that RL-JACK is overall much more effective than existing jailbreaking attacks against six SOTA LLMs, including large open-source models and commercial models. We also show the RL-JACK's resiliency against three SOTA defenses and its transferability across different models. Finally, we validate the insensitivity of RL-JACK to the variations in key hyper-parameters.

cs.CR↗

ParaFuzz: An Interpretability-Driven Technique for Detecting Poisoned Samples in NLP

Backdoor attacks have emerged as a prominent threat to natural language processing (NLP) models, where the presence of specific triggers in the input can lead poisoned models to misclassify these inputs to predetermined target classes. Current detection mechanisms are limited by their inability to address more covert backdoor strategies, such as style-based attacks. In this work, we propose an innovative test-time poisoned sample detection framework that hinges on the interpretability of model predictions, grounded in the semantic meaning of inputs. We contend that triggers (e.g., infrequent words) are not supposed to fundamentally alter the underlying semantic meanings of poisoned samples as they want to stay stealthy. Based on this observation, we hypothesize that while the model's predictions for paraphrased clean samples should remain stable, predictions for poisoned samples should revert to their true labels upon the mutations applied to triggers during the paraphrasing process. We employ ChatGPT, a state-of-the-art large language model, as our paraphraser and formulate the trigger-removal task as a prompt engineering problem. We adopt fuzzing, a technique commonly used for unearthing software vulnerabilities, to discover optimal paraphrase prompts that can effectively eliminate triggers while concurrently maintaining input semantics. Experiments on 4 types of backdoor attacks, including the subtle style backdoors, and 4 distinct datasets demonstrate that our approach surpasses baseline methods, including STRIP, RAP, and ONION, in precision and recall.

cs.CR↗

Radiation from a gluon-gluino colour-singlet dipole at N$^3$LO

We compute the quantum chromodynamics (QCD) corrections to the decay of a neutralino to gluinos and partons at next-to-next-to-next-to-leading order (N$^3$LO) in the strong coupling constant $α_s$, integrated separately over the phase-space of two, three, four or five particles in the final state. The resulting matrix elements are related to the quark-gluon antenna functions, completing the set of integrated antenna functions in final-final kinematics required for the extension of the antenna subtraction scheme to N$^3$LO. For a model with massless partons (quarks and gluons) and an arbitrary number of adjoint fermions, we obtained the following new results to $\mathcal{O}(α_s^3)$: the inclusive cross section for the decay of a neutralino, the renormalization of the effective coupling of a neutralino to a gluino and gluon(s), the gluino collinear anomalous dimension, the gluino contribution to the parton collinear anomalous dimensions and the neutralino-gluino-gluon(s) vertex form factors. A special case of this model is the $\mathcal{N}=1$ super Yang-Mills theory, where we can relate some of our findings to known results.

hep-ph↗

The parton-level structure of Higgs decays to hadrons at N$^3$LO

We present the quantum chromodynamics (QCD) corrections for Higgs boson decays to hadronic final states at next-to-next-to-next-to-leading order (N$^3$LO) in the strong coupling constant $α_s$. In particular, we consider the Higgs boson decay to massless bottom quarks and the Higgs boson decay to a pair of gluons in the limit of a heavy top quark. The tree-level five-parton, the one-loop four-parton, the two-loop three-parton, and the three-loop two-parton matrix elements are integrated separately over the inclusive phase space and classified by partons appearing in the final state and by colour structure. As a check, we reproduce known results for the hadronic $R$-ratios at N$^3$LO. We study patterns of infrared singularity cancellation within the colour layers of the integrated expressions and observe an agreement in the highest trascendental weight terms in the decay of different colour singlets to quarks. We anticipate that our result will be an essential ingredient for the formulation of N$^3$LO subtraction schemes.

hep-ph↗

Feature Noise Boosts DNN Generalization under Label Noise

The presence of label noise in the training data has a profound impact on the generalization of deep neural networks (DNNs). In this study, we introduce and theoretically demonstrate a simple feature noise method, which directly adds noise to the features of training data, can enhance the generalization of DNNs under label noise. Specifically, we conduct theoretical analyses to reveal that label noise leads to weakened DNN generalization by loosening the PAC-Bayes generalization bound, and feature noise results in better DNN generalization by imposing an upper bound on the mutual information between the model weights and the features, which constrains the PAC-Bayes generalization bound. Furthermore, to ensure effective generalization of DNNs in the presence of label noise, we conduct application analyses to identify the optimal types and levels of feature noise to add for obtaining desirable label noise generalization. Finally, extensive experimental results on several popular datasets demonstrate the feature noise method can significantly enhance the label noise generalization of the state-of-the-art label noise method.

cs.LG↗

Mutual Information Rate of Gaussian and Truncated Gaussian Inputs on Intensity-Driven Signal Transduction Channels

In this letter, we investigate the mutual information rate (MIR) achieved by an independent identically distributed (IID) Gaussian input on the intensity-driven signal transduction channel. Specifically, the asymptotic expression of the continuous-time MIR is given. Next, aiming at low computational complexity, we also deduce an approximately numerical solution for this MIR. Moreover, the corresponding lower and upper bounds that can be used to find the capacity-achieving input distribution parameters are derived in closed-form. Finally, simulation results show the accuracy of our analysis.

cs.IT↗

Transverse Mass Distribution and Charge Asymmetry in W Boson Production to Third Order in QCD

Charged gauge boson production at hadron colliders is a fundamental benchmark for the extraction of electroweak parameters and the understanding of the proton structure. To enable precision phenomenology for this process, we compute the third-order (N$^3$LO) QCD corrections to the rapidity distribution and charge asymmetry in W boson production and to the transverse mass distribution of its decay products. Our results display substantial QCD corrections in kinematic regions relevant for Tevatron and LHC measurements. We compare the numerical magnitude of the N$^3$LO corrections with uncertainties from electroweak input parameters and quantify their potential impact on the determination of the W boson mass.

hep-ph↗

Low Complexity First: Duration-Centric ISI Mitigation in Molecular Communication via Diffusion

In this paper, we propose a novel inter-symbol interference (ISI) mitigation scheme for molecular communication via diffusion (MCvD) systems with the optimal detection interval. Its rationale is to exploit the discarded duration (i.e., the symbol duration outside this optimal interval) to relieve ISI in the target system. Following this idea, we formulate an objective function to quantify the impact of the discarded time on bit error rate (BER) performance. Besides, an optimally reusable interval within the discarded duration is derived in closed form, which applies to both the absorbing and passive receivers. Finally, numerical results validate our analysis and show that for the considered MCvD system, significant BER improvements can be achieved by using the derived reusable duration.

eess.SP↗

Differential N$^3$LO QCD corrections to charged current production at the LHC

Charged current Drell-Yan production at hadron colliders is a benchmark electroweak process. A recent measurement of the W boson mass by the CDF experiment displays a large deviation from the Standard Model prediction. To enable precision phenomenology for this process, we compute the third-order (N$^3$LO) QCD corrections to the rapidity distribution in W boson production and to the transverse mass distribution of its decay products. We study kinematic regions relevant for the LHC experiments and assess the numerical magnitude of uncertainties from electroweak input parameters and parton distribution functions.

hep-ph↗

Theory uncertainties in the fiducial Drell-Yan cross section and distributions

In these proceedings we study various sources of theoretical uncertainty in the Drell-Yan $p_T^{\ell\ell}$ spectrum focussing on the $p_T^{\ell\ell} \lesssim 100\, {\rm GeV}$ region. We consider several perturbative aspects related to the choice of the scale setting adopted in resummed calculations, and we assess their impact on the theoretical prediction both for the differential $p_T^{\ell\ell}$ spectrum and for the $\rm{N}^3\rm{LO}$ fiducial cross section. For both quantities, we find the results obtained with the different setups to be compatible with each other within the quoted uncertainty, highlighting the robustness of the theoretical prediction. In all cases, the experimental LHC data for the $p_T^{\ell\ell}$ spectrum is well described by our calculation.

hep-ph↗

Detection Interval for Diffusion Molecular Communication: How Long is Enough?

Molecular communication has a key role to play in future medical applications, including detecting, analyzing, and addressing infectious disease outbreaks. Overcoming inter-symbol interference (ISI) is one of the key challenges in the design of molecular communication systems. In this paper, we propose to optimize the detection interval to minimize the impact of ISI while ensuring the accurate detection of the transmitted information symbol, which is suitable for the absorbing and passive receivers. For tractability, based on the signal-to-interference difference (SID) and signal-to-interference-and-noise amplitude ratio (SINAR), we propose a modified-SINAR (mSINAR) to measure the bit error rate (BER) performance for the molecular communication system with a variable detection interval. Besides, we derive the optimal detection interval in closed form. Using simulation results, we show that the BER performance of our proposed mSINAR scheme is superior to the competing schemes, and achieves similar performance to optimal intervals found by the exhaustive search.

cs.IT↗

Automation of antenna subtraction in colour space: gluonic processes

We present the colourful antenna subtraction method, a reformulation of the antenna subtraction scheme for next-to-next-to-leading order (NNLO) calculations in QCD. The aim of this new approach is to achieve a general and process-independent construction of the subtraction infrastructure at NNLO. We rely on the predictability of the infrared singularity structure of one- and two-loop amplitudes in colour space to generate virtual subtraction terms and, subsequently, we define an automatable procedure to systematically infer the expression of the real subtraction terms, guided by the correspondence between unintegrated and integrated antenna functions. To demonstrate the applicability of the described approach, we compute the full colour NNLO correction to gluonic three-jet production $pp(gg)\to ggg$, in the gluons-only assumption.

hep-ph↗

Di-lepton Rapidity Distribution in Drell-Yan Production to Third Order in QCD

We compute for the first time the lepton-pair rapidity distribution in the photon-mediated Drell-Yan process to next-to-next-to-next-to-leading order (N$^3$LO) in QCD. The calculation is based on the qT-subtraction method, suitably extended to this order for quark-antiquark initiated Born processes. Our results display sizeable QCD corrections at N$^3$LO over the full rapidity region and provide a fully independent confirmation of the recent results for the total Drell-Yan cross section at this order.

hep-ph↗

A General Statistical Mechanics Framework for the Collective Motion of Animals

We propose a general statistical mechanics framework for the collective motion of animals. The framework considers the principle of maximum entropy, the interaction, boundary, and desire effects, as well as the time-delay effect. These factors provide the ability to describe and solve dynamic and non-equilibrium problems under this framework. We show that the Vicsek model, the social force model, and some of their variants can be considered special cases of this framework. Furthermore, this framework can be extended to the maximum caliber setting. We demonstrate the potential of this framework for model comparisons and parameter estimations by applying the model to observed data from a field study of the emergent behavior of termites. Finally, we demonstrate the flexibility of the framework by simulating some collective moving phenomena for birds and ants.

physics.bio-ph↗

Reconstructing Actions To Explain Deep Reinforcement Learning

Feature attribution has been a foundational building block for explaining the input feature importance in supervised learning with Deep Neural Network (DNNs), but face new challenges when applied to deep Reinforcement Learning (RL).We propose a new approach to explaining deep RL actions by defining a class of \emph{action reconstruction} functions that mimic the behavior of a network in deep RL. This approach allows us to answer more complex explainability questions than direct application of DNN attribution methods, which we adapt to \emph{behavior-level attributions} in building our action reconstructions. It also allows us to define \emph{agreement}, a metric for quantitatively evaluating the explainability of our methods. Our experiments on a variety of Atari games suggest that perturbation-based attribution methods are significantly more suitable in reconstructing actions to explain the deep RL agent than alternative attribution methods, and show greater \emph{agreement} than existing explainability work utilizing attention. We further show that action reconstruction allows us to demonstrate how a deep agent learns to play Pac-Man game.

cs.AI↗