Searcharxiv⌕ Search

arXiv subjects

Yulong Tian

Publications and source records attributed to Yulong Tian.

9 recordsLinked to original sources

Bourin's Crossed-Heinz Inequality in the Frobenius Norm

For positive semidefinite matrices $A,B \in M_n(\mathbb{C})$ and $0<t<1$, we establish the sharp quantitative Frobenius-norm inequality $\|A^t B^{1-t}+B^t A^{1-t}\|_{\mathrm{F}}^2+4t(1-t)\|A-B\|_{\mathrm{F}}^2 \le \|A+B\|_{\mathrm{F}}^2$ for every dimension $n\ge1$. In particular, Bourin's crossed-Heinz inequality $\|A^t B^{1-t}+B^t A^{1-t}\|_{\mathrm{F}} \le \|A+B\|_{\mathrm{F}}$ holds with equality if and only if $A=B$.

math.FA↗

Linear Preservers of Semipositivity and Minimal Semipositivity

We classify all real linear into preservers of semipositivity on $M_{m,n}(\mathbb{R})$, $m,n\ge2$, relative to arbitrary source and target pairs of proper cones, without assuming invertibility or a prescribed form. The classification consists of product maps $L(A)=XAY$ and rank-$n$ degenerate maps $L(A)=Ψ(u^TA)$, subject to explicit cone and matrix-pencil conditions. For square minimal semipositivity with respect to the standard nonnegative orthant, preservation forces the operator to be invertible: for $n\ge2$, the linear into preservers are precisely the maps $L(A)=XAY$ and $L(A)=XA^TY$ with $X,Y\in\mathrm{GL}_n(\mathbb{R})$ satisfying $X^{-1},Y^{-1}\ge0$. We also classify all linear preservers of orthant semipositivity from $M_{2,2}(\mathbb{R})$ to $M_{1,3}(\mathbb{R})$ into three disjoint classes, two of which consist of maps of rank three outside product form.

math.FA↗

Additive preservers of mutual strong numerical radius orthogonality

Let $H$ be a complex Hilbert space with $\dim H\ge 2$. We characterize the nonzero additive maps on $\mathcal{B}(H)$ and on its self-adjoint part $\mathcal{B}_s(H)$ that preserve mutual strong numerical-radius orthogonality in one direction, assuming surjectivity only in infinite dimension. These maps are precisely those of the form $A\mapsto cUAU^*$, where $U$ is unitary or antiunitary, and $c$ is a nonzero complex scalar for $\mathcal{B}(H)$ and a nonzero real scalar for $\mathcal{B}_s(H)$.

math.FA↗

Weaponizing the Exit: Input Privacy Leakage via Exit Routing Manipulation in Multi-Exit Networks

Multi-exit networks improve inference efficiency by allowing inputs to terminate early at intermediate exits. We identify a privacy vulnerability in cloud deployments of these networks: a malicious Cloud Service Provider (CSP) can infer sensitive properties of individual user inputs solely from inference latency, without accessing inputs, intermediate states, or model outputs. The attack exploits the CSP's control over the model supply chain. Prior to deployment, the CSP supplies a specially crafted multi-exit network manipulated so that inputs carrying a target sensitive property are routed to a designated exit with high probability, while other inputs exit elsewhere. At serving time, the CSP infers the exit index from per-query latency, thereby determining whether each input possesses the target property without accessing inputs, outputs, or internal model states. We propose a training framework combining selective label smoothing and entropy-covariance optimization to control confidence distributions across exits and reduce premature termination. We conduct experiments on four datasets across ten target properties. The results demonstrate strong attack effectiveness and stealthiness. The attack achieves an average F1 score of 0.73, compared to 0.25 for the strongest baseline, while main task accuracy drops by less than 1.3\% and inference speedup degradation remains below 0.1 in most settings. Our code is available at https://github.com/kazefjj/Weaponizing_the_Exit.

cs.CR↗

When the Aggregator Cheats: Data-Free Backdoors in Federated LLM-based QA Systems

Large Language Model (LLM)-based question-answering (QA) systems are increasingly deployed in sensitive domains such as healthcare, mental health counseling, and legal consultation. Federated learning (FL) enables collaborative training without sharing raw client data, for which locally trained models are aggregated at a central server (i.e., a cloud service provider) to obtain a global model. In this paper, we explore the potential vulnerability where a malicious aggregator, who may collude with a third-party vendor, stealthily implants advertisement-type backdoors into federated QA models, without ever accessing client data. The attacker's goals are twofold: (1) preserve clean QA fidelity (i.e., the poisoned model behaves like a clean model on non-triggered queries); and (2) generate highly natural, contextually relevant responses with target advertisements when a trigger appears. Achieving these two goals simultaneously is highly challenging, as naive backdoor injection without knowledge about private data may degrade model's clean performance or fail to inject the target. Motivated by this, we propose to leverage clients' uploaded gradients during training, and develop a two-stage framework for data-free and stealthy poisoning: (1) recover representative training samples from client gradients, and (2) construct poisoning datasets utilizing recovered samples and trigger phrases to inject backdoors into the global model. Experiments across representative QA datasets and LLM families under full fine-tuning and LoRA settings demonstrate that, our method achieves nearly 100% Attack Success Rate (ASR) while incurring negligible degradation on clean tasks. Crucially, reconstructing only 5-20% of gradients suffices to mount a reliable attack, exposing a practical blind spot in the pipeline of federated training of QA LLMs.

cs.CR↗

Enhancing All-to-X Backdoor Attacks with Optimized Target Class Mapping

Backdoor attacks pose severe threats to machine learning systems, prompting extensive research in this area. However, most existing work focuses on single-target All-to-One (A2O) attacks, overlooking the more complex All-to-X (A2X) attacks with multiple target classes, which are often assumed to have low attack success rates. In this paper, we first demonstrate that A2X attacks are robust against state-of-the-art defenses. We then propose a novel attack strategy that enhances the success rate of A2X attacks while maintaining robustness by optimizing grouping and target class assignment mechanisms. Our method improves the attack success rate by up to 28%, with average improvements of 6.7%, 16.4%, 14.1% on CIFAR10, CIFAR100, and Tiny-ImageNet, respectively. We anticipate that this study will raise awareness of A2X attacks and stimulate further research in this under-explored area. Our code is available at https://github.com/kazefjj/A2X-backdoor .

cs.CR↗

ConneX: Automatically Resolving Transaction Opacity of Cross-Chain Bridges for Security Analysis

As the Web3 ecosystem evolves toward a multi-chain architecture, cross-chain bridges have become critical infrastructure for enabling interoperability between diverse blockchain networks. However, while connecting isolated blockchains, the lack of cross-chain transaction pairing records introduces significant challenges for security analysis like cross-chain fund tracing, advanced vulnerability detection, and transaction graph-based analysis. To address this gap, we introduce ConneX, an automated and general-purpose system designed to accurately identify corresponding transaction pairs across both ends of cross-chain bridges. Our system leverages Large Language Models (LLMs) to efficiently prune the semantic search space by identifying semantically plausible key information candidates within complex transaction records. Further, it deploys a novel examiner module that refines these candidates by validating them against transaction values, effectively addressing semantic ambiguities and identifying the correct semantics. Extensive evaluations on a dataset of about 500,000 transactions from five major bridge platforms demonstrate that ConneX achieves an average F1 score of 0.9746, surpassing baselines by at least 20.05\%, with good efficiency that reduces the semantic search space by several orders of magnitude (1e10 to less than 100). Moreover, its successful application in tracing illicit funds (including a cross-chain transfer worth $1 million) in real-world hacking incidents underscores its practical utility for enhancing cross-chain security and transparency.

cs.CR↗

Manipulating Transfer Learning for Property Inference

Transfer learning is a popular method for tuning pretrained (upstream) models for different downstream tasks using limited data and computational resources. We study how an adversary with control over an upstream model used in transfer learning can conduct property inference attacks on a victim's tuned downstream model. For example, to infer the presence of images of a specific individual in the downstream training set. We demonstrate attacks in which an adversary can manipulate the upstream model to conduct highly effective and specific property inference attacks (AUC score $> 0.9$), without incurring significant performance loss on the main task. The main idea of the manipulation is to make the upstream model generate activations (intermediate features) with different distributions for samples with and without a target property, thus enabling the adversary to distinguish easily between downstream models trained with and without training examples that have the target property. Our code is available at https://github.com/yulongt23/Transfer-Inference.

cs.LG↗

Stealthy Backdoors as Compression Artifacts

In a backdoor attack on a machine learning model, an adversary produces a model that performs well on normal inputs but outputs targeted misclassifications on inputs containing a small trigger pattern. Model compression is a widely-used approach for reducing the size of deep learning models without much accuracy loss, enabling resource-hungry models to be compressed for use on resource-constrained devices. In this paper, we study the risk that model compression could provide an opportunity for adversaries to inject stealthy backdoors. We design stealthy backdoor attacks such that the full-sized model released by adversaries appears to be free from backdoors (even when tested using state-of-the-art techniques), but when the model is compressed it exhibits highly effective backdoors. We show this can be done for two common model compression techniques -- model pruning and model quantization. Our findings demonstrate how an adversary may be able to hide a backdoor as a compression artifact, and show the importance of performing security tests on the models that will actually be deployed not their precompressed version.

cs.CR↗