Searcharxiv⌕ Search

arXiv subjects

He Zhang

Publications and source records attributed to He Zhang.

At least 109 records · Page 6Linked to original sources

Character-Level Perturbations Disrupt LLM Watermarks

Large Language Model (LLM) watermarking embeds detectable signals into generated text for copyright protection, misuse prevention, and content detection. While prior studies evaluate robustness using watermark removal attacks, these methods are often suboptimal, creating the misconception that effective removal requires large perturbations or powerful adversaries. To bridge the gap, we first formalize the system model for LLM watermark, and characterize two realistic threat models constrained on limited access to the watermark detector. We then analyze how different types of perturbation vary in their attack range, i.e., the number of tokens they can affect with a single edit. We observe that character-level perturbations (e.g., typos, swaps, deletions, homoglyphs) can influence multiple tokens simultaneously by disrupting the tokenization process. We demonstrate that character-level perturbations are significantly more effective for watermark removal under the most restrictive threat model. We further propose guided removal attacks based on the Genetic Algorithm (GA) that uses a reference detector for optimization. Under a practical threat model with limited black-box queries to the watermark detector, our method demonstrates strong removal performance. Experiments confirm the superiority of character-level perturbations and the effectiveness of the GA in removing watermarks under realistic constraints. Additionally, we argue there is an adversarial dilemma when considering potential defenses: any fixed defense can be bypassed by a suitable perturbation strategy. Motivated by this principle, we propose an adaptive compound character-level attack. Experimental results show that this approach can effectively defeat the defenses. Our findings highlight significant vulnerabilities in existing LLM watermark schemes and underline the urgency for the development of new robust mechanisms.

cs.CR↗

MedSeqFT: Sequential Fine-tuning Foundation Models for 3D Medical Image Segmentation

Foundation models have become a promising paradigm for advancing medical image analysis, particularly for segmentation tasks where downstream applications often emerge sequentially. Existing fine-tuning strategies, however, remain limited: parallel fine-tuning isolates tasks and fails to exploit shared knowledge, while multi-task fine-tuning requires simultaneous access to all datasets and struggles with incremental task integration. To address these challenges, we propose MedSeqFT, a sequential fine-tuning framework that progressively adapts pre-trained models to new tasks while refining their representational capacity. MedSeqFT introduces two core components: (1) Maximum Data Similarity (MDS) selection, which identifies downstream samples most representative of the original pre-training distribution to preserve general knowledge, and (2) Knowledge and Generalization Retention Fine-Tuning (K&G RFT), a LoRA-based knowledge distillation scheme that balances task-specific adaptation with the retention of pre-trained knowledge. Extensive experiments on two multi-task datasets covering ten 3D segmentation tasks demonstrate that MedSeqFT consistently outperforms state-of-the-art fine-tuning strategies, yielding substantial performance gains (e.g., an average Dice improvement of 3.0%). Furthermore, evaluations on two unseen tasks (COVID-19-20 and Kidney) verify that MedSeqFT enhances transferability, particularly for tumor segmentation. Visual analyses of loss landscapes and parameter variations further highlight the robustness of MedSeqFT. These results establish sequential fine-tuning as an effective, knowledge-retentive paradigm for adapting foundation models to evolving clinical tasks. Code will be released.

cs.CV↗

BiMark: Unbiased Multilayer Watermarking for Large Language Models

Recent advances in Large Language Models (LLMs) have raised urgent concerns about LLM-generated text authenticity, prompting regulatory demands for reliable identification mechanisms. Although watermarking offers a promising solution, existing approaches struggle to simultaneously achieve three critical requirements: text quality preservation, model-agnostic detection, and message embedding capacity, which are crucial for practical implementation. To achieve these goals, the key challenge lies in balancing the trade-off between text quality preservation and message embedding capacity. To address this challenge, we propose BiMark, a novel watermarking framework that achieves these requirements through three key innovations: (1) a bit-flip unbiased reweighting mechanism enabling model-agnostic detection, (2) a multilayer architecture enhancing detectability without compromising generation quality, and (3) an information encoding approach supporting multi-bit watermarking. Through theoretical analysis and extensive experiments, we validate that, compared to state-of-the-art multi-bit watermarking methods, BiMark achieves up to 30% higher extraction rates for short texts while maintaining text quality indicated by lower perplexity, and performs comparably to non-watermarked text on downstream tasks such as summarization and translation.

cs.CL↗

AUCAD: Automated Construction of Alignment Dataset from Log-Related Issues for Enhancing LLM-based Log Generation

Log statements have become an integral part of modern software systems. Prior research efforts have focused on supporting the decisions of placing log statements, such as where/what to log. With the increasing adoption of Large Language Models (LLMs) for code-related tasks such as code completion or generation, automated approaches for generating log statements have gained much momentum. However, the performance of these approaches still has a long way to go. This paper explores enhancing the performance of LLM-based solutions for automated log statement generation by post-training LLMs with a purpose-built dataset. Thus the primary contribution is a novel approach called AUCAD, which automatically constructs such a dataset with information extracting from log-related issues. Researchers have long noticed that a significant portion of the issues in the open-source community are related to log statements. However, distilling this portion of data requires manual efforts, which is labor-intensive and costly, rendering it impractical. Utilizing our approach, we automatically extract log-related issues from 1,537 entries of log data across 88 projects and identify 808 code snippets (i.e., methods) with retrievable source code both before and after modification of each issue (including log statements) to construct a dataset. Each entry in the dataset consists of a data pair representing high-quality and problematic log statements, respectively. With this dataset, we proceed to post-train multiple LLMs (primarily from the Llama series) for automated log statement generation. Both human and experimental evaluations indicate that these models significantly outperform existing LLM-based solutions, thereby validating the efficacy of our method for constructing a post-training dataset to enhance LLM-based log statement generation.

cs.SE↗

Zero-shot Emotion Annotation in Facial Images Using Large Multimodal Models: Benchmarking and Prospects for Multi-Class, Multi-Frame Approaches

This study investigates the feasibility and performance of using large multimodal models (LMMs) to automatically annotate human emotions in everyday scenarios. We conducted experiments on the DailyLife subset of the publicly available FERV39k dataset, employing the GPT-4o-mini model for rapid, zero-shot labeling of key frames extracted from video segments. Under a seven-class emotion taxonomy ("Angry," "Disgust," "Fear," "Happy," "Neutral," "Sad," "Surprise"), the LMM achieved an average precision of approximately 50%. In contrast, when limited to ternary emotion classification (negative/neutral/positive), the average precision increased to approximately 64%. Additionally, we explored a strategy that integrates multiple frames within 1-2 second video clips to enhance labeling performance and reduce costs. The results indicate that this approach can slightly improve annotation accuracy. Overall, our preliminary findings highlight the potential application of zero-shot LMMs in human facial emotion annotation tasks, offering new avenues for reducing labeling costs and broadening the applicability of LMMs in complex multimodal environments.

cs.CV↗

Existence and Uniqueness of Solution for Linear Complementarity Problem in Contact Mechanics

Although a unique solution is guaranteed in the Linear complementarity problem (LCP) when the matrix $\mathbf{M}$ is positive definite, practical applications often involve cases where $\mathbf{M}$ is only positive semi-definite, leading to multiple possible solutions. However, empirical observations suggest that uniqueness can still emerge under certain structural conditions on the matrix $\mathbf{M}$ and vector $\mathbf{q}$. Motivated by an unresolved problem in nonlinear modeling for beam contact in directional drilling, this paper systematically investigates conditions under which a unique solution exists for LCPs with certain positive semi-definite matrices $\mathbf{M}$. We provide a rigorous proof demonstrating the existence and uniqueness of the solution for this specific case and extend our findings to establish a generalized framework applicable to broader classes of LCPs. This framework enhances the understanding of LCP uniqueness conditions and provides theoretical guarantees for solving real-world problems where positive semi-definite matrices $\mathbf{M}$ arise.

math.OC↗

Boosting the Efficiency of the Differential Algebra-based Fast Multipole Method Using Symbolic Differential Algebra

The Fast Multipole Method (FMM) computes pairwise interactions between particles with an efficiency that scales linearly with the number of particles. The method works by grouping particles based on their spatial distribution and approximating interactions with distant regions through series expansions. Differential Algebra (DA), also known as Truncated Power Series Algebra (TPSA), computes the Taylor expansion of a function at a given point and allows users to manipulate Taylor expansions as easily as numerical values in computation. This makes it a convenient and powerful tool for constructing expansions in FMM. However, DA-based FMM operators typically suffer from lower efficiency compared to implementations based on other mathematical frameworks, such as Cartesian tensors or spherical harmonics. To address this, we developed a C++ library for symbolic DA computation, enabling the derivation of explicit expressions for DA-based FMM operators. These symbolic expressions are then used to generate highly optimized code that eliminates the redundant computations inherent in numerical DA packages. For individual FMM operators, this approach achieves a speedup of 20- to 50-fold. We further evaluate the numerical performance of the enhanced DA-FMM and benchmark it against two state-of-the-art FMM implementations, pyfmmlib and the traceless Cartesian tensor-based FMM, for the Coulomb potential. For relative errors on the order of $10^{-7}$ or higher, the enhanced DA-FMM consistently outperforms both alternatives.

physics.comp-ph↗

Normalized solutions for the NLS equation with potential in higher dimension: the purely Sobolev critical case

We study normalized solutions for the nonlinear Schrodinger (NLS) equation with potential and Sobolev critical nonlinearity. By establishing suitable assumptions on the potential, together with new techniques, we find a mountain-pass type solution for N>=6, which solves an open problem presented in a recent paper [Verzini and Yu, arXiv:2505.05357v1]. Moreover, we also find a local minimizer with negative energy for N>=3, which improves the results in [Verzini and Yu, arXiv:2505.05357v1].

math.AP↗

DIVE: Taming DINO for Subject-Driven Video Editing

Building on the success of diffusion models in image generation and editing, video editing has recently gained substantial attention. However, maintaining temporal consistency and motion alignment still remains challenging. To address these issues, this paper proposes DINO-guided Video Editing (DIVE), a framework designed to facilitate subject-driven editing in source videos conditioned on either target text prompts or reference images with specific identities. The core of DIVE lies in leveraging the powerful semantic features extracted from a pretrained DINOv2 model as implicit correspondences to guide the editing process. Specifically, to ensure temporal motion consistency, DIVE employs DINO features to align with the motion trajectory of the source video. For precise subject editing, DIVE incorporates the DINO features of reference images into a pretrained text-to-image model to learn Low-Rank Adaptations (LoRAs), effectively registering the target subject's identity. Extensive experiments on diverse real-world videos demonstrate that our framework can achieve high-quality editing results with robust motion consistency, highlighting the potential of DINO to contribute to video editing. Project page: https://dino-video-editing.github.io

cs.CV↗

One Size Does Not Fit All: Investigating Efficacy of Perplexity in Detecting LLM-Generated Code

Large language model-generated code (LLMgCode) has become increasingly common in software development. So far LLMgCode has more quality issues than human-authored code (HaCode). It is common for LLMgCode to mix with HaCode in a code change, while the change is signed by only human developers, without being carefully examined. Many automated methods have been proposed to detect LLMgCode from HaCode, in which the perplexity-based method (PERPLEXITY for short) is the state-of-the-art method. However, the efficacy evaluation of PERPLEXITY has focused on detection accuracy. Yet it is unclear whether PERPLEXITY is good enough in a wider range of realistic evaluation settings. To this end, we carry out a family of experiments to compare PERPLEXITY against feature- and pre-training-based methods from three perspectives: detection accuracy, detection speed, and generalization capability. The experimental results show that PERPLEXITY has the best generalization capability while having limited detection accuracy and detection speed. Based on that, we discuss the strengths and limitations of PERPLEXITY, e.g., PERPLEXITY is unsuitable for high-level programming languages. Finally, we provide recommendations to improve PERPLEXITY and apply it in practice. As the first large-scale investigation on detecting LLMgCode from HaCode, this article provides a wide range of findings for future improvement.

cs.SE↗

VOCABTRIM: Vocabulary Pruning for Efficient Speculative Decoding in LLMs

In this paper, we introduce a simple training-free technique to improve the performance of drafter-based speculative decoding (SpD) methods that incorporates language modeling head (LM head) during drafting process. A drafter-based speculative decoding leverages one or more smaller language models, a.k.a. drafters or draft models, to sample a draft sequence or tree consisting of multiple tokens, followed by verification by a base LLM, a target model, accepting a subset as its valid generation. As it is usually considered that the speculative decoding requires one-to-one mapping between vocabularies of the target model and the draft model, it has been natural to share the vocabulary between them, or even share the LM head as in EAGLE or Medusa. We first identify that this draft token sampling scheme inherently contains an unnecessary inference overhead in drafting, especially for some target LLMs with very large vocabularies. Then, we propose a simple technique, VocabTrim, to mitigate the drafting overhead to improve the generation speed in memory-bound environment. VocabTrim reconstructs the drafter LM head to contain only a limited set of tokens, selected by the most frequently sampled from the vocabulary of the target model. While limiting the vocabulary in drafting slightly degrades the acceptance rate, it significantly reduces the drafting latency in memory-bound process which is often the case on edge devices, resulting in higher memory-bound speed up (MBSU). We show that our method can boost the memory-bound speed-up for Llama-3 models on Spec-Bench, specifically by 16% for Llama-3.2-3B-Instruct.

cs.CL↗

A simplified unified wave-particle method for diatomic gases with rotational and vibrational non-equilibrium

The hypersonic flow around near-space vehicles constitutes a multi-scale flow problem. Due to insufficient molecular collisions to achieve equilibrium, rarefied gas effects are present in the flow field. Thus, numerical methods capable of accurately resolving multi-scale flows are required. Furthermore, high-temperature gas effects in hypersonic flows mean vibrational excitation of polyatomic molecules. Consequently, numerical methods accounting for non-equilibrium in rotational and vibrational internal energy modes are required. This study derives a quantified model-competition (QMC) mechanism for diatomic gases with rotational and vibrational non-equilibrium, starting from integral solutions of kinetic model equations with rotational and vibrational energy. The QMC mechanism categorize collisional and free-transport particles in cell, applying computational weighting based on their local scale regimes. We developed a simplified unified wave-particle (SUWP) method for diatomic gases based on QMC mechanism. For the macroscopic of the method, a three-temperature model accounting for rotational and vibrational energy is incorporated into both the kinetic inviscid flux scheme and {Navier-Stokes} solvers. For the microscopic of the method, a collisionless DSMC solver is employed to resolve non-equilibrium flow physics. This work validates the proposed SUWP method with rotational and vibrational non-equilibrium through benchmark cases, including shock tube, shock structures, flow past a cylinder, Apollo 6 command module and space station Mir. Compared to the DSMC and deterministic methods, the SUWP method exhibits favorable computational efficiency while maintaining accuracy.

physics.flu-dyn↗

Efficient Skill Discovery via Regret-Aware Optimization

Unsupervised skill discovery aims to learn diverse and distinguishable behaviors in open-ended reinforcement learning. For existing methods, they focus on improving diversity through pure exploration, mutual information optimization, and learning temporal representation. Despite that they perform well on exploration, they remain limited in terms of efficiency, especially for the high-dimensional situations. In this work, we frame skill discovery as a min-max game of skill generation and policy learning, proposing a regret-aware method on top of temporal representation learning that expands the discovered skill space along the direction of upgradable policy strength. The key insight behind the proposed method is that the skill discovery is adversarial to the policy learning, i.e., skills with weak strength should be further explored while less exploration for the skills with converged strength. As an implementation, we score the degree of strength convergence with regret, and guide the skill discovery with a learnable skill generator. To avoid degeneration, skill generation comes from an up-gradable population of skill generators. We conduct experiments on environments with varying complexities and dimension sizes. Empirical results show that our method outperforms baselines in both efficiency and diversity. Moreover, our method achieves a 15% zero shot improvement in high-dimensional environments, compared to existing methods.

cs.LG↗

Higher-Order Automatic Differentiation Using Symbolic Differential Algebra: Bridging the Gap between Algorithmic and Symbolic Differentiation

In scientific computation, it is often necessary to calculate higher-order derivatives of a function. Currently, two primary methods for higher-order automatic differentiation exist: symbolic differentiation and algorithmic automatic differentiation (AD). Differential Algebra (DA) is a mathematical technique widely used in beam dynamics analysis and simulations of particle accelerators, and it also functions as an algorithmic automatic differentiation method. DA automatically computes the Taylor expansion of a function at a specific point up to a predetermined order and the derivatives can be easily extracted from the coefficients of the expansion. We have developed a Symbolic Differential Algebra (SDA) package that integrates algorithmic differentiation with symbolic computation to produce explicit expressions for higher-order derivatives using the computational techniques of algorithmic differentiation. Our code has been validated against existing DA and AD libraries. Moreover, we demonstrate that SDA not only facilitates the simplification of explicit expressions but also significantly accelerates the calculation of higher-order derivatives, compared to directly using AD.

physics.comp-ph↗

High resolution up-conversion imaging in the 10 μm band under incoherent illumination

Long-wavelength infrared band exhibits significant utility in thermal signature acquisition and molecular spectral analysis, among other applications. The up-conversion detection technique enables effective signal transduction into the detection bandwidth of silicon-based photodetectors, thereby facilitating high-sensitivity photonic measurements. We realized high-resolution up-conversion imaging for incoherent thermal targets in the 10 μm spectral regime for the first time. Furthermore, this work presents the first derivation of analytical models characterizing depth of field and astigmatic aberration in up-conversion imaging systems, which show excellent agreement between theoretical and experimental results. The results demonstrate generalisability to various up-conversion imaging systems, thus providing critical insights for the design and optimisation of such systems.

physics.optics↗

AI Trust Reshaping Administrative Burdens: Understanding Trust-Burden Dynamics in LLM-Assisted Benefits Systems

Supplemental Nutrition Assistance Program (SNAP) is an essential benefit support system provided by the US administration to 41 million federally determined low-income applicants. Through interviews with such applicants across a diverse set of experiences with the SNAP system, our findings reveal that new AI technologies like LLMs can alleviate traditional burdens but also introduce new burdens. We introduce new types of learning, compliance, and psychological costs that transform the administrative burden on applicants. We also identify how trust in AI across three dimensions--competence, integrity, and benevolence--is perceived to reduce administrative burdens, which may stem from unintended and untoward overt trust in the system. We discuss calibrating appropriate levels of user trust in LLM-based administrative systems, mitigating newly introduced burdens. In particular, our findings suggest that evidence-based information disclosure is necessary in benefits administration and propose directions for future research on trust-burden dynamics in AI-assisted administration systems.

cs.HC↗

Normalized multi-bump solutions for Choquard equation involving sublinear case

In this paper, we study the existence of normalized multi-bump solutions for the following Choquard equation \begin{equation*} -ε^2Δu +λu=ε^{-(N-μ)}\left(\int_{\mathbb{R}^N}\frac{Q(y)|u(y)|^p}{|x-y|^μ}dy\right)Q(x)|u|^{p-2}u, \text{in}\ \mathbb{R}^N, \end{equation*} where $N\geq3$, $μ\in (0,N)$, $ε>0$ is a small parameter and $λ\in\mathbb{R}$ appears as a Lagrange multiplier. By developing a new variational approach, we show that the problem has a family of normalized multi-bump solutions focused on the isolated part of the local maximum of the potential $Q(x)$ for sufficiently small $ε>0$. The asymptotic behavior of the solutions as $ε\rightarrow0$ are also explored. It is worth noting that our results encompass the sublinear case $p<2$, which complements some of the previous works.

math.AP↗

Quantum Acoustics with Superconducting Qubits in the Multimode Transition-Coupling Regime

Hybrid mechanical-superconducting systems for quantum information processing have attracted significant attention due to their potential applications. In such systems, the weak coupling regime, dominated by dissipation, has been extensively studied. The strong coupling regime, where coherent energy exchange exceeds losses, has also been widely explored. However, the transition-coupling regime, which lies between the above two and exhibits rich, unique physics, remains underexplored. In this study, we fabricate a tunable coupling device to investigate the coupling of a superconducting transmon qubit to a seven-mode surface acoustic wave resonator (SAWR), with a particular focus on the transition-coupling regime. Through a series of phonon oscillation experiments and studies in the dispersive regime, we systematically characterize the performance of the SAWR. We then explore the complex dynamics of energy exchange between the qubit and the mechanical modes, highlighting the interplay between dissipation and coherence. Finally, we propose a protocol for qubit readout and fast reset with a multimode mechanical cavity using one mode for readout and another mode for reset. We have demonstrated in simulation that the qubit achieves both fast reset and high coherence performance when the qubit is coupled to the reset mode in the transition-coupling regime.

quant-ph↗