Searcharxiv⌕ Search

arXiv subjects

Xuan Chen

Publications and source records attributed to Xuan Chen.

At least 37 records · Page 2Linked to original sources

Theory uncertainties of the irreducible background to VBF Higgs production

Higgs boson production through gluon fusion in association with two jets is an irreducible background to Higgs boson production through vector boson fusion, one of the most important channels for analyzing and understanding the Higgs boson properties at the Large Hadron Collider. Despite a range of available simulation tools, precise predictions for the corresponding final states are notoriously hard to achieve. Using state-of-the-art fixed-order calculations as the baseline for a comparison, we perform a detailed study of similarities and differences in existing event generators. We provide consistent setups for the simulations that can be used to obtain identical parametric precision in various programs used by experiments. We find that NLO calculations for the two-jet final state are essential to achieve reliable predictions.

hep-ph↗

Past- and Future-Informed KV Cache Policy with Salience Estimation in Autoregressive Video Diffusion

Video generation is pivotal to digital media creation, and recent advances in autoregressive video generation have markedly enhanced the efficiency of real-time video synthesis. However, existing approaches generally rely on heuristic KV Cache policies, which ignore differences in token importance in long-term video generation. This leads to the loss of critical spatiotemporal information and the accumulation of redundant, invalid cache, thereby degrading video generation quality and efficiency. To address this limitation, we first observe that token contributions to video generation are highly time-heterogeneous and accordingly propose a novel Past- and Future-Informed KV Cache Policy (PaFu-KV). Specifically, PaFu-KV introduces a lightweight Salience Estimation Head distilled from a bidirectional teacher to estimate salience scores, allowing the KV cache to retain informative tokens while discarding less relevant ones. This policy yields a better quality-efficiency trade-off by shrinking KV cache capacity and reducing memory footprint at inference time. Extensive experiments on benchmarks demonstrate that our method preserves high-fidelity video generation quality while enables accelerated inference, thereby enabling more efficient long-horizon video generation. Our code will be released upon paper acceptance.

cs.CV↗

Sequential Experimental Designs for Kriging Model

Computer experiments have become an indispensable alternative to complex physical and engineering experiments. The Kriging model is the most widely used surrogate model, with the core goal of minimizing the discrepancy between the surrogate and true models across the entire experimental domain. However, existing sequential design methods have critical limitations: observation-based batch sequential designs are rarely studied, while one-point sequential designs have insufficient information utilization and suffer from inefficient resource utilization -- they require numerous repeated observation rounds to accumulate sufficient points, leading to prolonged experimental cycles. To address these gaps, this paper proposes two novel one-point sequential design criteria and a general batch sequential design framework. Moreover, the batch sequential design framework solves the inherent point clustering problem in naive batch selection, enabling efficient extension of any sequential criterion to batch scenarios. Simulations on some test functions demonstrate that the proposed methods outperform existing approaches in terms of fitting accuracy in most cases.

stat.ME↗

Planar Property and Long-range Azimuthal Correlation in $e^+e^-$ Annihilation

The $e^+e^-$ annihilation of unpolarized beams is free from initial hadron states or initial anisotropy around the azimuthal angle, hence ideal for studying the correlations of dynamical origin via final state jets. We investigate the planar properties of the multi-jet events employing the relevant event-shape observables at next-to-next-to-leading order ($\mathcal{O}$($α_{s}^{3}$)) in perturbative QCD; particularly, the azimuthal angle correlations on the long pseudo-rapidity (polar angle) range (Ridge correlation) between the inclusive jet momenta are calculated. We illustrate the significant planar properties and the strong correlations which are natural results of the energy-momentum conservation of the perturbative QCD radiation dynamics. Our study provides benchmarks of hard strong interaction background for the investigations on the collective and/or thermal effects via the Ridge-like correlation observables for complex scattering processes.

hep-ph↗

Average and Worst-case Analysis of MIMO Beamforming Loss due to Hardware Impairments

In this paper, we investigate the impact of hardware impairments in antenna arrays on the beamforming performance of multi-input multi-output (MIMO) communication systems. We consider two types of imperfections: per-element gain mismatches and inter-element spacing deviations. We analytically determine the impairment configurations that result in the worst-case degradation. In addition, the analytical expression of the average-case performance is also derived for comparison. Simulation and theoretical results show that the average SNR degradation remains relatively limited, whereas the worst-case scenarios can exhibit substantially higher losses. These findings provide clear insight into the robustness limits of MIMO systems under practical hardware imperfections.

eess.SP↗

TAI3: Testing Agent Integrity in Interpreting User Intent

LLM agents are increasingly deployed to automate real-world tasks by invoking APIs through natural language instructions. While powerful, they often suffer from misinterpretation of user intent, leading to the agent's actions that diverge from the user's intended goal, especially as external toolkits evolve. Traditional software testing assumes structured inputs and thus falls short in handling the ambiguity of natural language. We introduce TAI3, an API-centric stress testing framework that systematically uncovers intent integrity violations in LLM agents. Unlike prior work focused on fixed benchmarks or adversarial inputs, TAI3 generates realistic tasks based on toolkits' documentation and applies targeted mutations to expose subtle agent errors while preserving user intent. To guide testing, we propose semantic partitioning, which organizes natural language tasks into meaningful categories based on toolkit API parameters and their equivalence classes. Within each partition, seed tasks are mutated and ranked by a lightweight predictor that estimates the likelihood of triggering agent errors. To enhance efficiency, TAI3 maintains a datatype-aware strategy memory that retrieves and adapts effective mutation patterns from past cases. Experiments on 80 toolkit APIs demonstrate that TAI3 effectively uncovers intent integrity violations, significantly outperforming baselines in both error-exposing rate and query efficiency. Moreover, TAI3 generalizes well to stronger target models using smaller LLMs for test generation, and adapts to evolving APIs across domains.

cs.SE↗

EffiTune: Diagnosing and Mitigating Training Inefficiency for Parameter Tuner in Robot Navigation System

Robot navigation systems are critical for various real-world applications such as delivery services, hospital logistics, and warehouse management. Although classical navigation methods provide interpretability, they rely heavily on expert manual tuning, limiting their adaptability. Conversely, purely learning-based methods offer adaptability but often lead to instability and erratic robot behaviors. Recently introduced parameter tuners aim to balance these approaches by integrating data-driven adaptability into classical navigation frameworks. However, the parameter tuning process currently suffers from training inefficiencies and redundant sampling, with critical regions in environment often underrepresented in training data. In this paper, we propose EffiTune, a novel framework designed to diagnose and mitigate training inefficiency for parameter tuners in robot navigation systems. EffiTune first performs robot-behavior-guided diagnostics to pinpoint critical bottlenecks and underrepresented regions. It then employs a targeted up-sampling strategy to enrich the training dataset with critical samples, significantly reducing redundancy and enhancing training efficiency. Our comprehensive evaluation demonstrates that EffiTune achieves more than a 13.5% improvement in navigation performance, enhanced robustness in out-of-distribution scenarios, and a 4x improvement in training efficiency within the same computational budget.

cs.RO↗

Temporal Logic-Based Multi-Vehicle Backdoor Attacks against Offline RL Agents in End-to-end Autonomous Driving

Assessing the safety of autonomous driving (AD) systems against security threats, particularly backdoor attacks, is a stepping stone for real-world deployment. However, existing works mainly focus on pixel-level triggers that are impractical to deploy in the real world. We address this gap by introducing a novel backdoor attack against the end-to-end AD systems that leverage one or more other vehicles' trajectories as triggers. To generate precise trigger trajectories, we first use temporal logic (TL) specifications to define the behaviors of attacker vehicles. Configurable behavior models are then used to generate these trajectories, which are quantitatively evaluated and iteratively refined based on the TL specifications. We further develop a negative training strategy by incorporating patch trajectories that are similar to triggers but are designated not to activate the backdoor. It enhances the stealthiness of the attack and refines the system's responses to trigger scenarios. Through extensive experiments on 5 offline reinforcement learning (RL) driving agents with 6 trigger patterns and target action combinations, we demonstrate the flexibility and effectiveness of our proposed attack, showing the under-exploration of existing end-to-end AD systems' vulnerabilities to such trajectory-based backdoor attacks.

cs.CR↗

Jet production at electron-positron colliders at next-to-next-to-next-to-leading order in QCD

We present the first application of antenna subtraction at next-to-next-to-next-to-leading order (N$^3$LO) in QCD by computing fully differential predictions for two-jet production at electron-positron colliders. We illustrate the structure of the infrared counterterms and provide results for the N$^3$LO correction to the two-jet production rate and to the leading-jet energy. Our work constitutes the first direct calculation of jet production at electron-positron colliders at N$^3$LO and represents the first step in tackling arbitrary processes with jets at this perturbative order.

hep-ph↗

Empowering Nanoscale Connectivity through Molecular Communication: A Case Study of Virus Infection

The Internet of Bio-Nano Things (IoBNT), envisioned as a revolutionary healthcare paradigm, shows promise for epidemic control. This paper explores the potential of using molecular communication (MC) to address the challenges in constructing IoBNT for epidemic prevention, specifically focusing on modeling viral transmission, detecting the virus/infected individuals, and identifying virus mutations. First, the MC channels in macroscale and microscale scenarios are discussed to match viral transmission in both scales separately. Besides, the detection methods for these two scales are also studied, along with the localization mechanism designed for the virus/infected individuals. Moreover, an identification strategy is proposed to determine potential virus mutations, which is validated through simulation using the ORF3a protein as a benchmark. Finally, open research issues are discussed. In summary, this paper aims to analyze viral transmission through MC and combat viral spread using signal processing techniques within MC.

cs.NI↗

ASTRA: Autonomous Spatial-Temporal Red-teaming for AI Software Assistants

AI coding assistants like GitHub Copilot are rapidly transforming software development, but their safety remains deeply uncertain-especially in high-stakes domains like cybersecurity. Current red-teaming tools often rely on fixed benchmarks or unrealistic prompts, missing many real-world vulnerabilities. We present ASTRA, an automated agent system designed to systematically uncover safety flaws in AI-driven code generation and security guidance systems. ASTRA works in three stages: (1) it builds structured domain-specific knowledge graphs that model complex software tasks and known weaknesses; (2) it performs online vulnerability exploration of each target model by adaptively probing both its input space, i.e., the spatial exploration, and its reasoning processes, i.e., the temporal exploration, guided by the knowledge graphs; and (3) it generates high-quality violation-inducing cases to improve model alignment. Unlike prior methods, ASTRA focuses on realistic inputs-requests that developers might actually ask-and uses both offline abstraction guided domain modeling and online domain knowledge graph adaptation to surface corner-case vulnerabilities. Across two major evaluation domains, ASTRA finds 11-66% more issues than existing techniques and produces test cases that lead to 17% more effective alignment training, showing its practical value for building safer AI systems.

cs.CR↗

Flavor Physics at the CEPC: a General Perspective

We discuss the landscape of flavor physics at the Circular Electron-Positron Collider (CEPC), based on the nominal luminosity outlined in its Technical Design Report. The CEPC is designed to operate in multiple modes to address a variety of tasks. At the $Z$ pole, the expected production of 4 Tera $Z$ bosons will provide unique and highly precise measurements of $Z$ boson couplings, while the substantial number of boosted heavy-flavored quarks and leptons produced in clean $Z$ decays will facilitate investigations into their flavor physics with unprecedented precision. We investigate the prospects of measuring various physics benchmarks and discuss their implications for particle theories and phenomenological models. Our studies indicate that, with its highlighted advantages and anticipated excellent detector performance, the CEPC can explore beauty and $τ$ physics in ways that are superior to or complementary with the Belle II and Large-Hadron-Collider-beauty experiments, potentially enabling the detection of new physics at energy scales of 10 TeV and above. This potential also extends to the observation of yet-to-be-discovered rare and exotic processes, as well as testing fundamental principles such as lepton flavor universality, lepton and baryon number conservation, etc., making the CEPC a vibrant platform for flavor physics research. The $WW$ threshold scan, Higgs-factory operation and top-pair productions of the CEPC further enhance its merits in this regard, especially for measuring the Cabibbo-Kobayashi-Maskawa matrix elements, and Flavor-Changing-Neutral-Current physics of Higgs boson and top quarks. We outline the requirements for detector performance and considerations for future development to achieve the anticipated scientific goals.

hep-ex↗

Phase-space sectors for ordered momentum mappings in local subtraction up to N$^3$LO

Ordered momentum mappings present optimal convergence in soft and collinear configurations and are particularly suitable for the numerical implementation of local subtraction schemes. However, ordered mappings cannot be directly applied in the presence of multiple unordered emissions, which typically appear beyond the leading-colour approximation. A possible solution consists in separating individual singularities at the level of local counterterms by means of partial fractioning, which can become cumbersome at higher orders and introduce large cancellations in intermediate steps of the calculations. We present a simple decomposition of the phase space into sectors to isolate classes of infrared configurations which can be addressed with a specific ordered momentum mapping. With such decomposition, the singularities of any matrix element can be subtracted with ordered mappings, without the need of partial fractioning. We illustrate the required phase-space sectors for up to three unordered emissions and discuss applications in the context of the antenna subtraction method. The mapping algorithm described here has been recently employed for the first differential N$^3$LO of jet production at electron-positron colliders.

hep-ph↗

MGC: A Compiler Framework Exploiting Compositional Blindness in Aligned LLMs for Malware Generation

Large language models (LLMs) have democratized software development, reducing the expertise barrier for programming complex applications. This accessibility extends to malicious software development, raising significant security concerns. While LLM providers have implemented alignment mechanisms to prevent direct generation of overtly malicious code, these safeguards predominantly evaluate individual prompts in isolation, overlooking a critical vulnerability: malicious operations can be systematically decomposed into benign-appearing sub-tasks. In this paper, we introduce the Malware Generation Compiler (MGC), a novel framework that leverages this vulnerability through modular decomposition and alignment-evasive generation. MGC employs a specialized Malware Description Intermediate Representation (MDIR) to bridge high-level malicious intents and benign-appearing code snippets. Extensive evaluation demonstrates that our attack reliably generates functional malware across diverse task specifications and categories, outperforming jailbreaking methods by +365.79% and underground services by +78.07% in correctness on three benchmark datasets. Case studies further show that MGC can reproduce and even enhance 16 real-world malware samples. This work provides critical insights for security researchers by exposing the risks of compositional attacks against aligned AI systems. Demonstrations are available at https://sites.google.com/view/malware-generation-compiler.

cs.CR↗

Precise Determination of the Strong Coupling Constant from Dijet Cross Sections up to the Multi-TeV Range

We determine the value of the strong coupling $α_\text{s}$ and study its running over a wide range of scales as probed by the dijet production process at hadron colliders, based on an NNLO QCD analysis of LHC dijet data. From a large subset of these data a value of $α_\text{s} (m_\text{Z}) = 0.1178 \pm 0.0022$ is obtained for the strong coupling at the scale of the Z-boson mass $m_\text{Z}$, using the invariant mass of the dijet system to select the scale where $α_\text{s}$ is probed. The combination of different data sets enhances the reach and precision of the analysis in the mutli-TeV range and allows for the first determination of $α_\text{s}$ up to scales of 7 TeV. Complementing the LHC data with dijet cross sections measured at the HERA electron-proton collider, the kinematic range is extended to test the running of the strong coupling towards smaller scales. Our results exhibit excellent agreement with predictions based on the renormalization group equation of QCD, and represent a comprehensive test of the asymptotic behavior of QCD, spanning more than three orders of magnitude in energy scale.

hep-ph↗

Precise Predictions for Event Shapes in Diphoton Production at the LHC

Photon pair production is an important benchmark process at the LHC, entering Higgs boson studies and new physics searches. It has been measured to high accuracy, allowing for detailed studies of event shapes in diphoton final states. To enable precision physics with diphoton event shapes, we compute the second-order QCD corrections, ${\cal O} (α_s^3)$, to them and study their phenomenological impact.

hep-ph↗

When LLM Meets DRL: Advancing Jailbreaking Efficiency via DRL-guided Search

Recent studies developed jailbreaking attacks, which construct jailbreaking prompts to fool LLMs into responding to harmful questions. Early-stage jailbreaking attacks require access to model internals or significant human efforts. More advanced attacks utilize genetic algorithms for automatic and black-box attacks. However, the random nature of genetic algorithms significantly limits the effectiveness of these attacks. In this paper, we propose RLbreaker, a black-box jailbreaking attack driven by deep reinforcement learning (DRL). We model jailbreaking as a search problem and design an RL agent to guide the search, which is more effective and has less randomness than stochastic search, such as genetic algorithms. Specifically, we design a customized DRL system for the jailbreaking problem, including a novel reward function and a customized proximal policy optimization (PPO) algorithm. Through extensive experiments, we demonstrate that RLbreaker is much more effective than existing jailbreaking attacks against six state-of-the-art (SOTA) LLMs. We also show that RLbreaker is robust against three SOTA defenses and its trained agents can transfer across different LLMs. We further validate the key design choices of RLbreaker via a comprehensive ablation study.

cs.CR↗

LLM-Align: Utilizing Large Language Models for Entity Alignment in Knowledge Graphs

Entity Alignment (EA) seeks to identify and match corresponding entities across different Knowledge Graphs (KGs), playing a crucial role in knowledge fusion and integration. Embedding-based entity alignment (EA) has recently gained considerable attention, resulting in the emergence of many innovative approaches. Initially, these approaches concentrated on learning entity embeddings based on the structural features of knowledge graphs (KGs) as defined by relation triples. Subsequent methods have integrated entities' names and attributes as supplementary information to improve the embeddings used for EA. However, existing methods lack a deep semantic understanding of entity attributes and relations. In this paper, we propose a Large Language Model (LLM) based Entity Alignment method, LLM-Align, which explores the instruction-following and zero-shot capabilities of Large Language Models to infer alignments of entities. LLM-Align uses heuristic methods to select important attributes and relations of entities, and then feeds the selected triples of entities to an LLM to infer the alignment results. To guarantee the quality of alignment results, we design a multi-round voting mechanism to mitigate the hallucination and positional bias issues that occur with LLMs. Experiments on three EA datasets, demonstrating that our approach achieves state-of-the-art performance compared to existing EA methods.

cs.CL↗