Searcharxiv⌕ Search

arXiv subjects

Xiaojun Chen

Publications and source records attributed to Xiaojun Chen.

At least 19 recordsLinked to original sources

Discrete Approximation of differential two-stage stochastic linear complementarity problems

This paper studies differential two-stage stochastic linear complementarity problems, in which an ordinary differential equation (ODE) is coupled with a two-stage stochastic linear complementarity problem (SLCP) under a time-dependent probability distribution. The right-hand side of the ODE involves a solution pair (here-and-now and wait-and-see decisions) of the two-stage SLCP, while the two-stage SLCP involves two functions depending on the time $t$ and the state $x(t)$ of the ODE. Under appropriate conditions, we prove that the solution function of the two-stage SLCP is Lipschitz continuous in $x(t)$ and locally $\frac{1}{2}$-Hölder continuous in $t$, and establish the existence and uniqueness of a classical solution to the differential two-stage SLCP. Moreover, we develop a discrete approximation scheme for the differential two-stage SLCP. We first use a finite-scenario partition with mesh size $δ_N$ to approximate the distribution, then apply the Euler method for time discretization with step size $h$, and finally solve the resulting finite-dimensional problems using an inexact progressive hedging method with tolerance $η$. We prove that the error between a computed solution by the discrete approximation scheme and the classical solution of the original problem is bounded by $C(δ_N+h+η)$, where $C>0$ is a constant independent of $N$, $h$ and $η$. Finally, we apply our method to find an equilibrium point of a differential two-stage stochastic two-player zero-sum game. Numerical experiments illustrate the convergence rates and the efficiency of the discrete approximation scheme.

math.OC↗

Complexity of Projected Gradient Methods for Strongly Convex Optimization with Hölder Continuous Gradient Terms

This paper studies the complexity of projected gradient descent methods for a class of strongly convex constrained optimization problems where the objective function is expressed as a summation of $m$ component functions, each possessing a gradient that is Hölder continuous with an exponent $α_i \in (0, 1]$. Under this formulation, the gradient of the objective function may fail to be globally Hölder continuous, thereby rendering existing complexity results inapplicable to this class of problems. Our theoretical analysis reveals that, in this setting, the complexity of projected gradient methods is determined by $\hatα = \min_{i \in \{1, \dotsc, m\}} α_i$. We first prove that, with an appropriately fixed stepsize, the complexity bound for finding an approximate minimizer with a distance to the true minimizer less than $\varepsilon$ is $O (\log (\varepsilon^{-1}) \varepsilon^{2 (\hatα - 1) / (1 + \hatα)})$, which extends the well-known complexity result for $\hatα = 1$. Next we show that the complexity bound can be improved to $O (\log (\varepsilon^{-1}) \varepsilon^{2 (\hatα - 1) / (1 + 3 \hatα)})$ if the stepsize is updated by the universal scheme. We illustrate our complexity results by numerical examples arising from elliptic equations with a non-Lipschitz term.

math.OC↗

Biquantization of the necklace Lie bialgebra

For the double of a quiver, the works of Ginzburg, Bocklandt-Le Bruyn and Schedler show that its closed paths, called the necklaces, have a natural Lie bialgebra structure. Schedler also constructed,in [Int. Math. Res. Notices, 2005 (12), 725-760], a Hopf algebra that quantizes this Lie bialgebra. In this paper, we pursue one more step in this direction by constructing its biquantization, in the sense of Turaev [Ann. Sci. École Norm. Sup. (4) 24 (1991), no. 6, 635-704].

math.RA↗

A Projection Anderson Acceleration Algorithm for Non-quasi-monotone Variational Inequalities with Hölder Continuous Terms

This paper proposes a Projection Anderson Acceleration (PAA) algorithm for variational inequality (VI) problems, where the underlying function is expressed as a finite sum of Hölder continuous functions and satisfies the $σ$-star strongly monotone condition that includes the star strong monotonicity with $σ= 1$ as a special case. In the absence of quasi-monotonicity and Lipschitz continuity, we establish the evaluation complexity of the PAA algorithm for finding an approximate solution. Specifically, for the star strongly monotone VI problems, the PAA algorithm needs at most $O (\log (ε^{-1}) ε^{2 (\underlineα - 1)})$ evaluations of the function and projection for finding an $ε$-approximate solution, where $\underlineα \in (0, 1]$ is the smallest exponent of H{ö}lder continuity of the component functions. We illustrate our theoretical results by numerical examples of non-quasi-monotone complementarity problems and non-monotone semilinear elliptic equations with non-Lipschitz terms.

math.OC↗

Optimization with Parametric Variational Inequality Constraints on a Moving Set Based on a Smoothing Method

This paper focuses on optimization problems constrained by Parametric Variational Inequalities (PVI) defined on a moving set. Unlike most existing works on mathematical programs with equilibrium constraints, the equilibrium constraints have parameters not only in the function but also in the related set. We show that the solution function of the PVI is Lipschitz continuous with respect to the upper-level decision variables and the solution set of the optimization problem is nonempty and bounded. Moreover, we prove that the metric regularity of the constraints holds automatically, which allows us to characterize stationary points without any additional assumptions. A Smoothing Implicit Gradient Algorithm (SIGA) is proposed based on the smoothing approximation of the PVI with a novel scheme for updating the smoothing parameter. We prove the convergence of SIGA to a stationary point and validate the efficiency of SIGA by numerical examples from synthetic problems and portfolio management with real data.

math.OC↗

Marcinkiewicz-Zygmund inequalities for hemispherical $t$-designs

In this paper, we introduce a new set of $\mathbb{L}_2$-orthogonal polynomials on the hemisphere $\mathbb{S}^d_+:=\{\mathbf{x}\in\mathbb{R}^{d+1}:\|\mathbf{x}\|=1, \mathbf{x}\cdot\mathbf{e}_{d+1}\geq0\}$ and establish $\mathbb{L}_1$ Marcinkiewicz-Zygmund inequalities on the hemisphere for even and odd spherical polynomials. Hemispherical $t$-designs provide equal weight cubature rules on the hemisphere which are exact for polynomials up to degree $t$. We propose variational characterizations of hemispherical $t$-designs by the $\mathbb{L}_2$-orthogonal polynomials. Moreover, based on the Marcinkiewicz-Zygmund inequalities and the $\mathbb{L}_2$-orthogonal polynomials, we prove that for each $n\geq C_d t^d$, there exists a hemispherical $t$-design on the hemisphere with $n$ points, where $C_d$ is a constant depending only on $d$.

math.NA↗

A sequential regularized piecewise affine algorithm for nonconvex nonsmooth multicomposite optimization in RNN training

This paper focuses on a class of nonconvex nonsmooth multicomposite optimization problems for training RNNs (Recurrent Neural Networks). We first establish easily verifiable conditions under which an approximate first-order d-stationary point of the problem is guaranteed to be an approximate second-order d-stationary point. Subsequently, we propose a sequential regularized piecewise affine algorithm, SRPA, that minimizes a regularized piecewise affine function at each iteration, where the idea of active-set strategy is incorporated to reduce the computational cost per iteration. Leveraging the aforementioned conditions for second-order d-stationarity, we establish the global convergence of SRPA to second-order d-stationary points and the complexity bound of $ \mathcal{O}(ε^{-2}) $ for obtaining an $ ε$-approximate second-order d-stationary point. Finally, numerical experiments for training RNNs on synthetic and real-world datasets demonstrate the promising performance of SRPA compared with state-of-the-art algorithms.

math.OC↗

A sequential smoothing majorant stochastic approximation method for nonconvex nonconcave minimax problems

We propose a sequential smoothing majorant stochastic approximation (SMSA) method for nonconvex-nonconcave minimax optimization problems. To overcome the nonconcavity of the inner maximization problem, we introduce a new majorant stochastic approximation with an $O\left(β_N^2\right)$ accuracy bound, where $β_N$ is the sample coverage radius. The accuracy bound significantly improves upon the $O\left(β_N\right)$ approximation bound for the standard stochastic approximation. Moreover, we establish nonasymptotic bounds for both global optimal values and minimizer sets, and prove consistency for the Clarke stationary points, as $β_N \downarrow 0$ almost surely. We show that the generated sequence by the SMSA method is bounded, and that the returned point is an approximate Clarke stationary point of the majorant stochastic approximation models. Numerical experiments on a synthetic toy example and robust logistic regression on two UCI datasets demonstrate improved approximation fidelity and lower mean robust test losses relative to the standard sampled approximation.

math.OC↗

Differential Stochastic Variational Inequalities with Parametric Optimization

The differential stochastic variational inequality with parametric convex optimization (DSVI-O) is an ordinary differential equation whose right-hand side involves a stochastic variational inequality and solutions of several dynamic and random parametric convex optimization problems. We consider that the distribution of the random variable is time-dependent and assume that the involved functions are continuous and the expectation is well-defined. We show that the DSVI-O has a weak solution with integrable and measurable solutions of the parametric optimization problems. Moreover, we propose a discrete scheme of DSVI-O by using a time-stepping approximation and the sample average approximation and prove the convergence of the discrete scheme. We illustrate our theoretical results of DSVI-O with applications in an embodied intelligence system for the elderly health by synthetic health care data generated by Multimodal Large Language Models.

math.OC↗

An Adaptive Projected-Gradient Algorithm for Sample-Average Approximations of Stochastic Multi-Objective Optimization

We consider stochastic multi-objective optimization over a nonempty closed convex set, where every objective is an expectation and only sample-gradient information is available. We develop a line-search-free and function-value-free adaptive projected-gradient algorithm for the sample-average approximation (SAA) problem. Each iteration computes a feasible regularized multi-gradient step and updates the regularization parameter from the projected step length. A normal-cone-based certificate yields descent estimates and an explicit complexity bound for the Pareto-stationarity residual of the SAA problem. The consistency of SAA gradients then transfers vanishing SAA residuals to Pareto stationarity for the population problem, while an additional concentration argument gives a finite-sample residual bound on compact sets. Experiments on synthetic problems, classification, portfolio selection, multi-task learning, and robot control illustrate the practical performance of our algorithm.

math.OC↗

Stability of Differential Stochastic Variational Inequalities with History-Dependent Responses and Transfer Learning

In this paper, we propose and study a class of differential stochastic variational inequalities (DSVIs), in which an ordinary differential equation (ODE) is coupled with history-dependent stochastic variational inequalities (SVI). This framework models closed-loop stochastic systems with time-varying random equilibria and includes optimization-constrained ODEs as special cases. Under appropriate technical conditions, we establish uniqueness, measurability, and Lipschitz continuity with respect to the state of the second-stage response, and consequently the existence and uniqueness of the induced state trajectory. Moreover, we construct a sample average approximation (SAA) based on independent sample paths and prove uniform convergence of the approximate trajectories. For transfer between related stochastic environments, we derive a local $1/2$-Hölder estimate for parametric variational inequalities with moving feasible sets and a quantitative trajectory-stability bound in terms of the initial-state difference and the Wasserstein distance between exogenous path laws. Numerical experiments illustrate the SAA convergence and transfer-stability results. We further apply the framework to an elderly-health monitoring system. Similarity-weighted reuse of precomputed responses achieves an accuracy close to the full-recomputation benchmark of 0.97, while reducing the online batch runtime from 86 seconds to less than one second. Perturbation and delayed-update experiments additionally characterize robustness to sensor noise and the trade-off between response freshness, predictive accuracy, and computational cost. These results provide theoretical and computational support for efficient transfer learning in history-dependent DSVI systems.

math.OC↗

A Support-Set Algorithm for Optimization Problems with Nonnegative and Orthogonal Constraints

In this paper, we investigate optimization problems with nonnegative and orthogonal constraints, where any feasible matrix of size $n \times p$ exhibits a sparsity pattern such that each row accommodates at most one nonzero entry. Our analysis demonstrates that, by fixing the support set, the global solution of the minimization subproblem for the proximal linearization of the objective function can be computed in closed form with at most $n$ nonzero entries. Exploiting this structural property offers a powerful avenue for dramatically enhancing computational efficiency. Guided by this insight, we propose a support-set algorithm preserving strictly the feasibility of iterates. A central ingredient is a strategically devised update scheme for support sets that adjusts the placement of nonzero entries. We establish the convergence of the support-set algorithm to a first-order stationary point, and show that its iteration complexity required to reach an $ε$-approximate first-order stationary point is $O (ε^{-2})$. Numerical results are strongly in favor of our algorithm in real-world applications, including nonnegative PCA, clustering, and community detection.

math.OC↗

EntSQL: A Benchmark for Grounding Text-to-SQL in Long-Context Enterprise Knowledge

Text-to-SQL enables natural language access to databases, and recent LLMs have substantially advanced its capabilities. Existing benchmarks such as Spider, BIRD, and Spider~2.0 evaluate schema generalization, large-scale databases, and realistic workflows, but largely overlook enterprise scenarios where SQL generation depends on private business knowledge, such as internal metrics, reporting conventions, and organizational rules. We introduce EntSQL, an enterprise-oriented Text-to-SQL benchmark for evaluating long-context grounding over proprietary business documents. EntSQL contains 1,066 aligned Chinese-English semantic examples across five business domains, with most examples requiring domain knowledge beyond the question and schema and involving complex SQL structures. On English inputs, the best evaluated system reaches only 15.9\% when long-form documents are provided, highlighting the difficulty of grounding SQL generation in enterprise knowledge.

cs.CL↗

Robust Least Squares Problems with Binary Uncertain Data

We propose a Binary Robust Least Squares (BRLS) model that encompasses key robust least squares formulations, such as those involving uncertain binary labels and adversarial noise constrained within a hypercube. {To develop algorithms with theoretical guarantees for the BRLS problem, we exploit the structure of the inner binary maximization problem with a convex quadratic objective function. Refined guarantees are obtained when the noise correlations are sign-structured, in which case the inner problem admits sharper submodular or supermodular oracles. For the supermodular linear BRLS problem, we establish a link between saddle points of its continuous relaxation and global minimax points of BRLS, and propose a projected-gradient algorithm to find an $ε$-global minimax point in $O(ε^{-2})$ iterations. For the supermodular nonlinear BRLS problem, we develop a Moreau-envelope-based framework that finds an $ε$-stationary point in expectation within $O(ε^{-4})$ iterations. For the linear submodular case and the linear general case, we utilize a double-greedy algorithm and a semidefinite relaxation as the respective subsolvers; the latter attains an approximation ratio below $2/π$. Coupled with the projected-gradient framework, these oracles yield approximate minimax guarantees within $O(ε^{-2})$ iterations. Numerical experiments on health status prediction with candidate label-corruption sets, synthetic linear BRLS, and thresholded phase retrieval with missing binary labels illustrate the behavior and robustness gains of the BRLS model under structured noise compared with classical least-squares-based baselines.

math.OC↗

Rel-Zero: Harnessing Patch-Pair Invariance for Robust Zero-Watermarking Against AI Editing

Recent advancements in diffusion-based image editing pose a significant threat to the authenticity of digital visual content. Traditional embedding-based watermarking methods often introduce perceptible perturbations to maintain robustness, inevitably compromising visual fidelity. Meanwhile, existing zero-watermarking approaches, typically relying on global image features, struggle to withstand sophisticated manipulations. In this work, we uncover a key observation: while individual image patches undergo substantial alterations during AI-based editing, the relational distance between patch pairs remains relatively invariant. Leveraging this property, we propose Relational Zero-Watermarking (Rel-Zero), a novel framework that requires no modification to the original image but derives a unique zero-watermark from these editing-invariant patch relations. By grounding the watermark in intrinsic structural consistency rather than absolute appearance, Rel-Zero provides a non-invasive yet resilient mechanism for content authentication. Extensive experiments demonstrate that Rel-Zero achieves substantially improved robustness across diverse editing models and manipulations compared to prior zero-watermarking approaches.

cs.CV↗

An extra gradient Anderson-accelerated algorithm for pseudomonotone variational inequalities

This paper proposes an extra gradient Anderson-accelerated algorithm for solving pseudomonotone variational inequalities, which uses the extra gradient scheme with line search to guarantee the global convergence and Anderson acceleration to have fast convergent rate. We prove that the sequence generated by the proposed algorithm from any initial point converges to a solution of the pseudomonotone variational inequality problem without assuming the Lipschitz continuity and contractive condition, which are used for convergence analysis of the extra gradient method and Anderson-accelerated method, respectively in existing literatures. Numerical experiments, particular emphasis on Harker-Pang problem, fractional programming, nonlinear complementarity problem and PDE problem with free boundary, are conducted to validate the effectiveness and good performance of the proposed algorithm comparing with the extra gradient method and Anderson-accelerated method.

math.OC↗

An Anderson-accelerated stochastic extragradient method for stochastic variational inequalities

In this paper, we propose an Anderson-accelerated stochastic extragradient algorithm for solving a class of stochastic variational inequalities, by incorporating Anderson acceleration into the stochastic extragradient method under a stochastic approximation framework. A key challenge in our setting is that the pseudomonotonicity assumption is only imposed on the expectation of the stochastic operator, rather than on the individual stochastic operator itself and the sample averages utilized in the algorithm. We prove that, despite the lack of pseudomonotonicity in the sampled operators, the sequence generated by the proposed algorithm converges almost surely to a solution of the stochastic variational inequality problem. Additionally, we establish the sublinear convergence rate of the proposed algorithm in terms of the mean residual function, along with its optimal oracle complexity. Finally, we validate the effectiveness of the proposed algorithm through numerical experiments.

math.OC↗

Exposing Functional Fusion: A New Class of Strategic Backdoor in Dynamic Prompt Architectures

Existing ViT backdoor attacks based on backbone-overwriting full-tuning are computationally expensive and inflict performance degradation. This has forced adversaries towards the Visual Parameter-Efficient Fine-Tuning (PEFT) paradigm, dominated by adapter-based (e.g., LoRA) and prompt-based (e.g., VPT) approaches. While adapter security has seen initial study, the risks of the burgeoning prompt-based ecosystem remain critically unexplored. We fill this critical gap, exposing how the evolution of VPT towards dynamic and context-aware architectures can facilitate a far more dangerous and emergent threat. This vulnerability arises even though these dynamic modules unlock superior benign performance. We propose VIPER, an attack framework built on a lightweight, dynamic Visual Prompt Generator (VPG) that demonstrates this vulnerability. Critically, this dynamic architecture enables Functional Fusion: an emergent phenomenon where malicious logic and benign task utility are tightly fused into the same sparse, high-magnitude parameter core. This fusion creates a formidable ``hostage" dilemma, as pruning the attack necessarily destroys the benign performance. Comprehensive evaluations show VIPER effectively addresses the attacker's trilemma: VIPER not only achieves state-of-the-art performance on clean data, but also maintains near-100% ASR even under 90% VPG-module pruning (where LoRA attacks collapse), while adding only an imperceptible 0.06ms (1.16%) of inference latency. VIPER's results, driven by Functional Fusion, expose a new, paradigm-level risk in dynamic prompt architectures.

cs.CR↗