SearcharxivSearch

arXiv subjects

Xiaolong Qin

Publications and source records attributed to Xiaolong Qin.

13 recordsLinked to original sources

CBV: Clean-label Backdoor Attacks on Vision Language Models via Diffusion Models

Vision-Language Models (VLMs) have achieved remarkable success in tasks such as image captioning and visual question answering (VQA). However, as their applications become increasingly widespread, recent studies have revealed that VLMs are vulnerable to backdoor attacks. Existing backdoor attacks on VLMs primarily rely on data poisoning by adding visual triggers and modifying text labels, where the induced image-text mismatch makes poisoned samples easy to detect. To address this limitation, we propose the Clean-Label Backdoor Attack on VLMs via Diffusion Models (CBV), which leverages diffusion models to generate natural poisoned examples via score matching. Specifically, CBV modifies the score during the reverse generation process of the diffusion model to guide the generation of poisoned samples that contain triggered image features. To further enhance the effectiveness of the attack, we incorporate the textual information of the triggered images as multimodal guidance during generation. Moreover, to enhance stealthiness, we introduce a GradCAM-guided Mask (GM) that restricts modifications to only the most semantically important regions, rather than the entire image. We evaluate our method on MSCOCO and VQA v2 with four representative VLMs, achieving over 80% ASR while preserving normal functionality.

cs.AI

Frugal forward-backward splitting methods with deviations

The deviation vectors provide additional degrees of freedom and effectively enhance the flexibility of algorithms. In the literature, the iterative schemes with deviations are constructed and their convergence analyses are performed on an inefficient, algorithm-by-algorithm basis. In this paper, we address these by providing a general framework of frugal forward-backward splitting methods with deviations for finding zeros in the sum of a finite number of maximally monotone operators and cocoercive operators. Our framework encompasses the Douglas--Rachford splitting method with deviations. A unified weak convergence analysis is made under mild conditions. Numerical experiments on Markowitz portfolio optimization problem are given to demonstrate the effectiveness of deviations.

math.OC

Non-subdifferentiability optimality and mean value theorems via new relative subdifferentials

Motivated by the optimality principles for non-subdifferentiable optimization problems, we introduce new relative subdifferentials and examine some properties for relatively lower semicontinuous functions including $ε$-regular subdifferential and limiting subdifferential relative to a set. The fuzzy sum rule for the relative $ε$-regular subdifferentials and the sum rule for the relative limiting subdifferentials are established. We utilize these relative subdifferentials to establish optimality conditions for non-subdifferentiable optimization problems under mild constraint qualifications. Examples are given to demonstrate that the optimality conditions obtained work better and sharper than some existing results. We also provide different versions of mean value theorems via the relative subdifferentials and employ them to characterize the equivalences between the convexity relative to a set and the monotonicity of the relative subdifferentials of a non-subdifferentiable function.

math.OC

Coderivatives with respect to a set of the normal cone mappings and their applications

Establishing explicit formulas of coderivatives with respect to a set of the normal cone mapping to a polyhedron, the solution set of a variational inequalities system, is one of the main goals of this paper. By using our coderivative formulas, we provide a characteristic of the Aubin property with respect to a set of that normal cone mapping and thereby give necessary optimality conditions for simple bilevel optimization problems under weak qualification conditions.

math.OC

Formulas for calculating of generalized differentials with respect to a set and their applications

This paper provides formulas for calculating of Fréchet and limiting normal cones with respect to a set of sets and the limiting coderivative with respect to a set of set-valued mappings. These calculations are obtained under some qualification constraints and are expressed in the similar forms of these ones of Fréchet and limiting normal cones and the limiting coderivative. By using these obtained formulas, we state explicit necessary optimality conditions with respect to a set for optimization problems with equilibrium constraints under certain qualification conditions. Some illustrated examples to obtained results are also established.

math.OC

On new generalized differentials with respect to a set and their applications

The notions and certain fundamental characteristics of the proximal and limiting normal cones with respect to a set are first presented in this paper. We present the ideas of the limiting coderivative and subdifferential with respect to a set of multifunctions and singleton mappings, respectively, based on these normal cones. The necessary and sufficient conditions for the Aubin property with respect to a set of multifunctions are then described by using the limiting coderivative with respect to a set. As a result of the limiting subdifferential with respect to a set, we offer the requisite optimality criteria for local solutions to optimization problems. In addition, we also provide examples to demonstrate the outcomes.

math.OC

Strong convergence of an inertial Tseng's extragradient algorithm for pseudomonotone variational inequalities with applications to optimal control problems

We investigate an inertial viscosity-type Tseng's extragradient algorithm with a new step size to solve pseudomonotone variational inequality problems in real Hilbert spaces. A strong convergence theorem of the algorithm is obtained without the prior information of the Lipschitz constant of the operator and also without any requirement of additional projections. Finally, several computational tests are carried out to demonstrate the reliability and benefits of the algorithm and compare it with the existing ones. Moreover, our algorithm is also applied to solve the variational inequality problem that appears in optimal control problems. The algorithm presented in this paper improves some known results in the literature.

math.OC

Strong convergence of inertial extragradient algorithms for solving variational inequalities and fixed point problems

The paper investigates two inertial extragradient algorithms for seeking a common solution to a variational inequality problem involving a monotone and Lipschitz continuous mapping and a fixed point problem with a demicontractive mapping in real Hilbert spaces. Our algorithms only need to calculate the projection on the feasible set once in each iteration. Moreover, they can work well without the prior information of the Lipschitz constant of the cost operator and do not contain any line search process. The strong convergence of the algorithms is established under suitable conditions. Some experiments are presented to illustrate the numerical efficiency of the suggested algorithms and compare them with some existing ones.

math.OC

Inertial extragradient algorithms for solving variational inequalities and fixed point problems

The objective of this research is to explore a convex feasibility problem, which consists of a monotone variational inequality problem and a fixed point problem. We introduce four inertial extragradient algorithms that are motivated by the inertial method, the subgradient extragradient method, the Tseng's extragradient method and the Mann-type method endowed with a simple step size. Strong convergence theorems of the algorithms are established under some standard and suitable conditions enforced by the cost operators. Finally, we implement some computational tests to show the efficiency and advantages of the proposed algorithms and compare them with some existing ones.

math.OC

Smoothing Algorithms for Computing the Projection onto a Minkowski Sum of Convex Sets

In this paper, the problem of computing the projection, and therefore the minimum distance, from a point onto a Minkowski sum of general convex sets is studied. Our approach is based on the minimum norm duality theorem originally stated by Nirenberg and the Nesterov smoothing techniques. It is shown that projection points onto a Minkowski sum of sets can be represented as the sum of points on constituent sets so that, at these points, all of the sets share the same normal vector which is the negative of the dual solution. The proposed NESMINO algorithm improves the theoretical bound on number of iterations from $O(\frac{1}ε)$ by Gilbert [SIAM J. Contr., vol. 4, pp. 61--80, 1966] to $O\left(\frac{1}{\sqrtε}\ln(\frac{1}ε)\right)$, where $ε$ is the desired accuracy for the objective function. Moreover, the algorithm also provides points on each component sets such that their sum is equal to the projection point.

math.OC