Searcharxiv⌕ Search

arXiv subjects

Xiaoyan Zhang

Publications and source records attributed to Xiaoyan Zhang.

At least 19 recordsLinked to original sources

Total variation error bounds for Schrödinger-Föllmer samplers

Sampling from high-dimensional, multimodal target distributions plays a fundamental role in scientific computing, statistics and machine learning. Recently, the Schrödinger-Föllmer sampler (SFS) has been proposed by Huang et al. (IEEE Trans. Inform. Theory, 2025) as an efficient sampling algorithm that transports the degenerate distribution at $t=0$ to the target distribution at $t=1$, without relying on long-time ergodicity. In this paper, we establish non-asymptotic error bounds for SFS in the total variation distance by deriving regularization estimates for the associated Kolmogorov equation via the Bismut-Elworthy-Li formula. When the drift can be computed exactly, a convergence rate of order $\mathcal{O}( h|\ln h|)$ was obtained under certain smoothness conditions on the drift with a uniform time step-size $h>0$. When the drift is approximated by Monte Carlo methods, we obtain a convergence rate of order $\mathcal{O}( h|\ln h|+ 1/M)$, where $M$ is the number of samples used in the Monte Carlo approximation. This yields a sharper dependence on $M$ than the existing bound $\mathcal{O}(1/\sqrt{M})$ in the $L^2$-Wasserstein distance in the aforementioned paper, by turning the total variation error to the weak error analysis in the setting of non-smooth test functions. Numerical experiments are presented to illustrate the convergence rate with respect to the time step-size $h$ and the Monte Carlo sample size $M$ and the effectiveness of the proposed algorithm.

math.NA↗

HP-PnP-Flow: Hybrid Time Scheduling and Projection for Plug-and-Play Image Restoration via Flow Matching

Image restoration is a fundamental inverse problem that seeks to recover high-quality images from degraded observations. Plug-and-Play (PnP) methods provide a flexible framework for integrating pretrained denoisers into iterative reconstruction, whereas flow matching offers an efficient generative modeling approach based on continuous-time ODE dynamics. Very recently, Martin et al. (ICLR, 2025) developed a PnP-Flow method, which integrates the PnP framework with flow matching through a time-dependent denoiser constructed from a pretrained flow matching model. By incorporating a different time schedule and an additional pixel-space projection operator, this paper proposes a novel efficient PnP-Flow algorithm (HP-PnP-Flow) that enjoys rigorous convergence guarantees under mild assumptions, without imposing restrictive conditions on iterates required by the aforementioned work. Numerical experiments on CelebA and AFHQ-Cat demonstrate that the newly proposed HP-PnP-Flow algorithm significantly outperforms PnP-Flow on several restoration tasks such as denoising, deblurring, super-resolution, random inpainting, and box inpainting. Notably, our algorithm achieves comparable or better reconstruction quality with substantially fewer iterations, reducing the iteration count from $500$ to $100$ for deblurring and super-resolution on AFHQ-Cat.

cs.CV↗

Enhanced convergence guarantees of score-based generative models in $\mathcal{W}_2$-distance beyond log-concavity

Although score-based generative models (SGMs) have achieved remarkable success in real-world sample generation tasks, it is still far from sufficient to understand them from a mathematical perspective. In this paper, we aim to provide enhanced convergence guarantees for two existing SGMs in $\mathcal{W}_2$-distance beyond log-concavity. More precisely, we develop a novel framework of {\color{black}discretization} error analysis for Euler-Maruyama (EM) and Poisson midpoint (PM) time discretization schemes for SGMs. Under a non-log-concavity condition, we show that $\tilde{\mathcal{O}}(\sqrt{d}/ε)$ iterations suffice to approximate the target distributions in $ε$-accuracy for the classical EM-based SGM, considerably improving upon the existing iteration complexity $\tilde{\mathcal{O}}(d/ε^2)$. Notably, the novel framework of error analysis also enables us to establish an $\tilde{\mathcal{O}}(\sqrt{d}/ε^{2/3})$ iteration complexity for the PM-based SGM in $ε$-accuracy, significantly outperforming current state-of-the-art Wasserstein convergence guarantees for SDE-based diffusion samplers.

math.ST↗

The high dimensional monostable reaction-diffusion equation with free boundary and radial symmetry

We consider the radially symmetric version of the reaction-diffusion equation $u_t-dΔu=f(u)$ with a monostable nonlinearity $f$, viewed as a model for the spreading of a species with population range $r 0$ and $h'(t)=-d u_r(t,h(t))/δ$. For the one-dimensional case ($N=1$), Du \cite{DN} proved that when $δ\in(0,1)$, spreading occurs: $u\to1$ locally uniformly in $\mathbb{R}$, $h(t)\to\infty$, and $\lim_{t\to\infty}[h(t)-c_*t]=\tilde{h}\in\mathbb{R}$ with no logarithmic shift. In the present paper we consider $N\ge2$ and establish a complete trichotomy: spreading for $δ\in(0,1)$; transition for $δ=1$, where $u\to1$ uniformly on $[0,h(t)]$ and $h(t)\to h_\infty\in(0,\infty)$; and vanishing for $δ>1$, where $h(t)\to0$ and $u\toδ$ uniformly on $[0,h(t)]$. For the spreading regime, by constructing sharp upper and lower solutions, we prove that the solution converges globally to the semi-wave profile and reveal a logarithmic shift of the form $ \lim_{t\to\infty}\big[h(t)-c_*t+c_N(δ)\log t\big]=\hat{h}\in\mathbb{R}$, with the coefficient $c_N(δ)>0$ satisfying $ \lim_{δ\to0}c_N(δ)=d(N-1)/c_0$, where $d(N-1)/c_0$ is the shift coefficient for the high-dimensional radial pushed-case Cauchy problem. These results reveal the connection to the spreading behavior modeled by the corresponding Cauchy problem.

math.AP↗

Scaling Vision Foundation Models for Toxicologic Pathology

Here, we present TOX-FM, a family of non-clinical PFMs trained on large-scale diverse histopathology datasets of over one million whole slide images consisting of over 60 organs across six animal species from over 14,000 toxicology studies across six decades. We introduce a comprehensive benchmark of 18 non-clinical downstream tasks, incorporate an established benchmark of 9 clinical downstream tasks, and evaluate TOX-FM against state-of-the-art clinical PFMs across both non-clinical and clinical domains. Notably, we explore open questions surrounding domain-specific training and cross-domain generalization, offering insights into the opportunities and challenges of applying PFMs in the non-clinical domain.

cs.CV↗

Securing High-Concurrency Ticket Sales: A Framework Based on Microservice

The railway ticketing system is one of the most important public service infrastructure. In peak periods such as holidays, it is often faced with the challenge of high concurrency scenarios because of a large number of users accessing at the same time. The traditional aggregation architecture can not meet the peak user requirements because of its insufficient fault tolerance and low ability. Therefore, the system needs to use microservice architecture for development, and add multiple security methods to ensure that the system can have good stability and data consistency under high concurrency scenarios, and can respond quickly to user requests. This paper introduces the use of B/S architecture and Spring Cloud to design and develop a railway ticket purchase system that can maintain stability and reliability under high concurrency scenarios, and formulate multiple security design methods for the system. This system integrates a range of functions, such as real-time train inquiries, dynamic seat updates, online seat selection, and ticket purchasing, effectively addressing common problems associated with offline ticket purchasing, such as long queues and delayed information. It enables a complete online process from inquiry and booking to payment and refunds. Furthermore, the "add passenger" function allows users to purchase tickets for others, extending the convenience of online ticketing to people with limited internet access. The system design prioritizes security and stability, while also focusing on high performance, and achieves these goals through a carefully designed architecture and the integration of multiple middleware components. After the completion of the system development, the core interface of the system is tested, and then the results are analyzed. The test data proves that the system has good ability and stability under high concurrency.

cs.SE↗

Risk Assessment and Security Analysis of Large Language Models

As large language models (LLMs) expose systemic security challenges in high risk applications, including privacy leaks, bias amplification, and malicious abuse, there is an urgent need for a dynamic risk assessment and collaborative defence framework that covers their entire life cycle. This paper focuses on the security problems of large language models (LLMs) in critical application scenarios, such as the possibility of disclosure of user data, the deliberate input of harmful instructions, or the models bias. To solve these problems, we describe the design of a system for dynamic risk assessment and a hierarchical defence system that allows different levels of protection to cooperate. This paper presents a risk assessment system capable of evaluating both static and dynamic indicators simultaneously. It uses entropy weighting to calculate essential data, such as the frequency of sensitive words, whether the API call is typical, the realtime risk entropy value is significant, and the degree of context deviation. The experimental results show that the system is capable of identifying concealed attacks, such as role escape, and can perform rapid risk evaluation. The paper uses a hybrid model called BERT-CRF (Bidirectional Encoder Representation from Transformers) at the input layer to identify and filter malicious commands. The model layer uses dynamic adversarial training and differential privacy noise injection technology together. The output layer also has a neural watermarking system that can track the source of the content. In practice, the quality of this method, especially important in terms of customer service in the financial industry.

cs.CR↗

Sharp bounds and extremal structure of minimally strongly $k$-connected digraphs

Let $D$ be a finite simple minimally strongly $k$-connected digraph, where $k\ge 2$, and let $n=|V(D)|$. Mader proved in 1985 that $|A(D)|\le 2k(n-k)$ for all sufficiently large $n$, with equality if and only if $D\cong \overleftrightarrow{K}_{k,n-k}$ (JCTB 1985). We prove that this bound holds whenever $n\ge 3k-1$ and that the order threshold $3k-1$ is best possible. Moreover, if $n\ge 3k$, then equality holds if and only if $D\cong \overleftrightarrow{K}_{k,n-k}$. The threshold $3k$ is also best possible. These results resolve the conjecture of Mader in (JCTB 1985).

math.CO↗

Hypercyclic Bergman-Toeplitz operators with some harmonic symbols

Little is known about the dynamics of Toeplitz operators on the Bergman space, and even in the case of harmonic symbols, few results are available. In this paper, we study the dynamical properties of Toeplitz operators with symbols of the form $a \bar{z} + p (z)$ on the Bergman space, where $a\neq 0$ and $p$ is analytic on the closed unit disk. We obtain some necessary conditions and some sufficient conditions for such operators to be hypercyclic, weakly mixing, mixing, chaotic, or frequently hypercyclic. As an application, we obtain a complete characterization of hypercyclicity for Toeplitz operators with harmonic linear polynomial symbols. We also show that Toeplitz operators with the same symbol may exhibit different hypercyclic behavior on the Hardy and Bergman spaces.

math.FA↗

See What I See, Know What I Think: Dense Latent Communication Across Heterogeneous Agents

Language-model agents build internal representations of the information they observe and the reasoning they perform. Sharing these representations offers a way to communicate both source information and reasoning across agents. For agents built from different models, this requires aligning their representations while preserving information useful to the receiver. We study this problem through KV-cache communication, examining how an agent uses internal states shared by other agents, with or without direct access to the information that other agents observed. A controlled self-communication study shows that cache pruning causes substantially greater degradation when the receiving agent lacks access to that information. We use this finding to guide dense cross-model cache alignment, combining positional disentanglement and KV-group transformations with reconstruction followed by generation training. Across six directed Qwen3 pairs, aligned caches improve in-domain accuracy over text communication when both agents observe the same input, with fewer estimated inference FLOPs. Experiments with three-agent document sharing and Mistral-to-Qwen transfer further demonstrate that aligned caches can carry information across both multiple separate observations and different model families.

cs.MA↗

Nuclear mass table in deformed relativistic Hartree-Bogoliubov theory in continuum, III: nuclei with $8 \leq Z \leq 120$

The mass table in the deformed relativistic Hartree-Bogoliubov theory in continuum (DRHBc) with the PC-PK1 density functional has been established for nuclei with $8 \leq Z \leq 120$, extended from the previous works for even-even nuclei [Zhang et al. (DRHBc mass table collaboration), At. Data Nucl. Data Tables 144, 101488 (2022)] and for even-$Z$ nuclei [Guo et al. (DRHBc mass table collaboration), At. Data Nucl. Data Tables 158, 101661 (2024)]. The calculated binding energies, two- and one-nucleon separation energies, root-mean-square (rms) radii of neutron, proton, matter, and charge distributions, quadrupole deformations, neutron and proton Fermi surfaces, and the blocked neutron (proton) orbitals of odd-$N$ ($Z$) nuclei are tabulated and compared with the available experimental data. A total of 9495 nuclei are predicted to be bound, with an rms deviation of 1.444 MeV from the 2380 mass data. Good agreement with the available experimental pairing gaps, $α$ decay energies, and charge radii is also achieved. The accuracies of the calculated nuclear masses and nucleon separation energies as well as the prediction for drip lines are compared with those obtained by other relativistic and nonrelativistic density functional calculations. It turns out that the DRHBc theory with PC-PK1 provides one of the best microscopic descriptions for nuclear masses. The systematics of nucleon separation energies, pairing gaps, pairing energies, two-nucleon gaps, $α$ decay energies, rms radii, quadrupole deformations, potential energy curves, neutron density distributions, and neutron mean-field potentials are discussed.

nucl-th↗

Scaling and Distilling Text Embeddings for Better Diffusibility

Diffusion language models (DLMs) offer a promising alternative to autoregressive (AR) language generation. Recent advances in continuous DLMs, which apply latent diffusion to continuous text embeddings, raise a practical question: which embedding makes the best latent space, i.e., the most diffusible? To answer this, we search through different embeddings and find that scaling the embedding model to stronger ones within the same family (T5 to T5Gemma-1 to T5Gemma-2) greatly improves generative performance. But the raw T5Gemma-2 embeddings are still not optimal. They are so discriminative that even the embeddings of plausible alternative words are separated, which makes the generation vulnerable to imperfect sampling. Consequently, continuous diffusion often fails to reach any of them and ends up at an invalid embedding instead. To address this, we distill T5Gemma-2 into a student encoder that learns the teacher's decoded probabilities as soft labels. Learning from such soft labels makes the student pull the alternative embeddings closer while maintaining the encoding-decoding mechanism. The distilled embeddings form a more connected and diffusible latent space, improving over the vanilla T5Gemma-2 embeddings. As a result, our medium-sized DLM achieves Gen. PPL 17.8 (against real-text PPL 15.4) at real-text entropy on OpenWebText, outperforming GPT-2-M on Gen. PPL.

cs.CL↗

Explicit Constructions of Maximum-Cardinality Families of Plateaued Functions with Pairwise Disjoint Walsh Supports

Families of plateaued Boolean functions with pairwise disjoint Walsh supports are useful in secondary constructions of cryptographic Boolean functions. Of particular interest are maximum-cardinality families whose members admit no nonzero linear structures. To the best of our knowledge, the previously known general construction attaining both properties is spectral (Hodžić et al., IEEE Trans. Inf. Theory 65(9): 5865--5879, 2019). In that work, explicit algebraic normal forms are not generally provided, and no general method is established for prescribing a common algebraic degree for all family members. In this paper, we present two new explicit algebraic constructions within a unified framework, one based on linear functions and the other on partially linear functions with bent components. Let $p\geq 2$ and $q\geq 0$ satisfy $q<2^p-p-1$, and set $m=p+q$. Both constructions yield maximum-cardinality families of $2^{q+1}$ $(q+1)$-plateaued Boolean functions with pairwise disjoint Walsh supports. No member admits a nonzero linear structure, and every member has an explicit generalized Maiorana--McFarland representation. The first construction produces functions in $m+p+1$ variables and realizes any prescribed common algebraic degree $3\leq d\leq p+1$, provided that $q<\sum_{i=2}^{d-1}\binom{p}{i}$; its maximum attainable degree $p+1$ is optimal. The second construction produces functions in $n+p+1$ variables, where $n>m$ and $n-m$ is even, and realizes any prescribed common algebraic degree $3\leq d\leq p+(n-m)/2$, provided that $q<\sum_{i=2}^{\min\{d-1,p\}}\binom{p}{i}$; its maximum attainable degree $p+(n-m)/2$ is next-to-optimal.

cs.IT↗

Constructing edge-disjoint Steiner trees in Cartesian product networks

Cartesian product networks are always regarded as a tool for ``combining'' two given networks with established properties to obtain a new one that inherits properties from both. For a graph $F=(V,E)$ and a set $S\subseteq V(F)$ of at least two vertices, \emph{an $S$-Steiner tree} or \emph{a Steiner tree connecting $S$} (or simply, \emph{an $S$-tree}) is a subgraph $T=(V',E')$ of $F$ that is a tree with $S\subseteq V'$. For $S\subseteq V(F)$ and $|S|\geq 2$, the {\it generalized local edge-connectivity} $λ(S)$ is the maximum number of edge-disjoint Steiner trees connecting $S$ in $F$. For an integer $k$ with $2\leq k\leq n$, the {\it generalized $k$-edge-connectivity} $λ_k(F)$ of a graph $F$ is defined as $λ_k(F)=\min\{λ(S)\,|\,S\subseteq V(F) \ and \ |S|=k\}$.In this paper, we give sharp upper and lower bounds for $λ_k(G\Box H)$, where $\Box$ is the Cartesian product operation, and $G,H$ are two graphs.

math.CO↗

Chains and Antichains inside Many-One Degrees and Variants

The relations between many-one degrees and one-one degrees have been studied since the beginning of recursion theory; early results from the 1960s include that many-one degrees always have a largest one-one degree and either that one-one degree is the only one-one degree inside the many-one degree or every countable linear order is noneffectively embeddable into the structure of one-one degrees inside the given many-one degree. Furthermore, the greatest recursive many-one degree is a special case, as it allows to embed ascending infinite chains but not descending infinite chains, all other many-one degrees fall into the two cases mentioned above. It remained open whether infinite antichains can always be embedded when the many-one degree is nonrecursive and nonirreducible; Odifreddi stated in a survey 1981 and in his book Classical Recursion Theory in the year 1989 this question explicitly as an open problem. Dëgtev had already in 1976 constructed antichains of one-one degrees inside all nonrecursive and nonirreducible recursively enumerable many-one degrees and Batyrshin generalised the result to all nonrecursive and nonirreducible limit-recursive many-one degrees. In 2026, Cintioli showed that there is a measure $1$ class of sets whose many-one degrees contain infinite antichains of one-one degrees. This class contains all rigid many-one degrees. The present work generalises Batyrshin's result to all nonrecursive and nonirreducible many-one degrees and solves therefore Odifreddi's open problem. The present work also proposes to deepen the study of reducibilities between one-one and many-one in recursion theory in order to get a more complete and detailed picture for the structures inside many-one degrees. In particular it studies finite-one and bounded finite-one reducibilities where the first was introduced by Maslova in the 1970ies.

math.LO↗

Normalized solutions of quasilinear Schrödinger equations in the general $L^2$-supercritical case

This paper is devoted to studying the existence of normalized solutions for the following quasilinear Schrödinger equation \begin{equation*} \begin{aligned} -Δu-uΔu^2 +λu=h(u) \quad\mathrm{in}\ \mathbb{R}^{3}, \end{aligned} \end{equation*} where $λ$ appears as a Lagrange multiplier, $h$ is a $L^2$-supercritical and Sobolev subcritical nonlinearity. The solutions correspond to critical points of the energy functional subject to the $L^2$-norm constraint $\int_{\mathbb{R}^3}|u|^2dx=a^2>0$. Taking into account the Pohozaev manifold and perturbation method, we obtain the existence of ground state normalized solutions and infinitely many normalized solutions. Moreover, our results cover several relevant existing results in \cite{LZ2023}. And in the end, we get the asymptotic properties of energy as $a$ tends to $+\infty$ and $a$ tends to $0^+$.

math.AP↗

Trichotomy dynamics of a free boundary model for biological invasion

It is well known that the reaction-diffusion equation $u_t=du_{xx}+f(u)$ with compactly supported nonnegative initial functions exhibits trichotomy dynamics for bistable and combustion type $f(u)$ \cite{DM, zlatos}. The same is true for the corresponding Stefan type free boundary problem \cite{DL}. In this paper, we reveal a rather different type of trichotomy for this reaction-diffusion equation under a new set of (free) boundary conditions, arising as a model for biological invasion with $u(t,x)$ representing the density of an invading species over the one dimensional spatial regin $[0, h(t)]$. The evolution of the invading front $x=h(t)$ is governed by $h'(t)=-\frac dδu_x(t, h(t))$ and $u(t, h(t))=δ\in (\hatθ_f, 1)$, with $\hatθ_f \in [0, 1)$ uniquely determined by $f$; they allow $h(t)$ to advance as well as to retreat when time increases. At the fixed boundary $x=0$, the density is controlled by $u(t,0)=δ_0\geq 0$. We completely classify the long-time dynamics of the model when $f(u)$ is a monostable, or bistable, or combustion type nonlinear function. In the biologically interesting case that $δ_0<δ$, we show that there are exactly three scenarios: (i) successful spreading, (ii) finite-time vanishing, (iii) a transition state characterized by $h(t)\to l_*\in (0, \infty)$ and $u(t,x)\to w_*(x)$ as $t\to\infty$, where $(u(t,x), h(t))\equiv (w_*(x), l_*)$ is the unique stationary solution of the free boundary problem. The model here does not have the usual order-preserving property enjoyed by those considered in \cite{DM, zlatos, DL} and elsewhere (i.e., $u(0,x)\leq v(0,x)$ implies $u(t,x)\leq v(t,x)$ for all $t>0$ if $u$ and $v$ are two solutions of the problem), which is intrinsically linked to the many novel features of the model.

math.AP↗

Multimodal sampling via Schrödinger-Föllmer samplers with temperatures

Generating samples from complex and high-dimensional distributions is ubiquitous in various scientific fields of statistical physics, Bayesian inference, scientific computing and machine learning. Very recently, Huang et al. (IEEE Trans. Inform. Theory, 2025) proposed new Schrödinger-Föllmer samplers (SFS), based on the Euler discretization of the Schrödinger-Föllmer diffusion evolving on the unit interval $[0, 1]$. There, a convergence rate of order $\mathcal{O}(\sqrt{h})$ in the $L^2$-Wasserstein distance was obtained for the Euler discretization with a uniform time step-size $h>0$. By introducing a temperature parameter, different samplers are proposed in this paper, based on the Euler discretization of the Schrödinger-Föllmer process with temperatures. As revealed by numerical experiments, high temperatures are vital, particularly in sampling from multimodal distributions. Further, a novel approach of error analysis is developed for the time discretization and an enhanced convergence rate of order $\mathcal{O}(h)$ is obtained in the $L^2$-Wasserstein distance, under certain smoothness conditions on the drift. This significantly improves the existing order-half convergence in the aforementioned paper. Unlike Langevin samplers, SFS is gradient-free, works in a unit interval $[0, 1]$ and does not require any ergodicity. Numerical experiments confirm the convergence rate and show that, the SFS substantially outperforms vanilla Langevin samplers, particularly in sampling from multimodal distributions.

math.NA↗