arXiv subjects

Zhongqiang Zhang

Publications and source records attributed to Zhongqiang Zhang.

At least 19 recordsLinked to original sources

arXiv2026

Variable-Length Finite-Rate CSI Feedback With Generative Priors

This letter studies scalable finite-rate CSI feedback for FDD massive MIMO. Existing scalable neural schemes usually obtain rate flexibility by ordering, masking, quantizing, vector-quantizing, or entropy-coding learned latents, which couples the finite-bit interface to a task-specific latent codec. We propose CsiCoGen, a generative feedback mechanism that moves the finite-bit decision to codebook-constrained Gaussian innovation selection along a reverse diffusion trajectory. A synchronized pseudo-random Gaussian codebook makes each index a generative update instruction; a length-$L$ prefix uses $R_L=L\log_2K$ bits and yields a valid CSI estimate. The codebook is training-free and not transmitted online, while the denoiser is pretrained as a shared CSI prior. On COST2100, CsiCoGen attains indoor/outdoor NMSE of $-28.58$/$-13.96$ dB at $792$ bits and $-30.72$/$-20.37$ dB at $1592$ bits, with corresponding $ρ$ values of $0.9964$/$0.9597$ and $0.9967$/$0.9748$. Accelerated-sampling throughput and MRT spectral-efficiency results further quantify the complexity and link-level effects.

eess.SP↗

arXiv2026

Carleman Estimates for Wave Equations on the Half-Line: AI-Assisted Weights and Applications

We develop an AI-assisted search-and-certification workflow for constructing Carleman weights for wave equations on semi-infinite domains. Starting from a weighted cross-term identity used to derive the Carleman estimate, we derive explicit analytical screening conditions and use an AI system to propose symbolic candidate weights subject to those conditions. The search identifies a logarithmic weight structure with concrete parameter values; the subsequent human verification by the authors then retains this structure, derives the admissible parameter range, and rigorously certifies the selected weight by verifying the required quantitative conditions. Based on the identified and certified Carleman weight, the subsequent proofs, analysis, and applications are carried out entirely by the authors: we establish a global Carleman estimate for the wave operator on the half-line and derive a weighted conditional lateral Cauchy stability result. The proposed weight is further used in a finite-depth one-sided reconstruction problem for semilinear wave equations on the half-line, where the initial-time flux induces an endpoint graph stabilizer and a contractive frozen nonlinear reconstruction map. Numerical experiments support the predicted contraction behavior and show improved robustness to noisy data from the Carleman weighting, with the induced endpoint graph term providing further stabilization at higher noise levels.

math.AP↗

arXiv2026

Two-scale neural networks for optimal control of linear convection-dominated equations

We propose a two-scale neural network method for optimal control problems governed by convection-dominated convection-diffusion-reaction equations. Building on two-scale architectures developed for singularly perturbed forward problems, we augment the spatial input with suitably rescaled features that become increasingly important as the diffusion coefficient becomes small. The approach employs separate neural networks for the state and adjoint state variables of the optimality system, reflecting the fact that these quantities develop sharp layers in different parts of the domain due to opposite convection fields. By choosing different center points for the two networks, the architecture naturally aligns with the layer location of each variable. We present two formulations of the method, one based on the first-order optimality conditions and another using penalization of the PDE constraint, and combine them with a successive training strategy that gradually decreases the diffusion coefficient toward its target value. Numerical experiments on benchmark problems illustrate the effectiveness and behavior of the proposed approach.

math.NA↗

arXiv2026

Unveiling the Atomistic Mechanisms of Shear-Induced LDA$\leftrightarrow$HDA Transformations and Shear Banding in Amorphous Silicon under High Pressures

Large-scale molecular dynamics simulations of shear deformation under constant pressures of amorphous silicon, PT from low-density-amorphous (LDA) to high-density-amorphous (HDA) Si, and formation of shear bands (SBs) are performed using the state-of-the-art Gaussian Approximation Potential. The simulations reveal that LDA$\leftrightarrow$HDA shear-induced PTs occur simultaneously until reaching steady state. The developed mechanism-based analytical model well describes shear-strain-governed kinetics and steady states at all pressures, independent of shear stresses. Shear reduces the pressure for initiation and completion of LDA$\rightarrow$HDA PT by $4.36$ and $5.10$ GPa, respectively. Without PT at low pressure, shear-banding occurs, which is partially suppressed by PT at higher pressure with uniform deformation-PT at $9.8$ GPa. Despite the much larger shear and expected fraction of HDA, surprising sharp drop in the HDA atomic fraction within the SB was discovered. In bulk, Si deforms by atomic rearrangement in localized shear transformation zones with high nonaffine displacements, which trigger nucleation of HDA clusters within LDA and, concurrently, of LDA clusters within HDA, without growth and coalescence. In SB, a turbulent-like flow with swirls is revealed, which promotes reverse PT from HDA$\rightarrow$LDA more effectively. Transformation-induced plasticity in amorphous Si is revealed. The findings open up basic research into the mechanisms and kinetics of plastic strain-induced PTs in amorphous materials under high pressure, with numerous important applications.

cond-mat.mtrl-sci↗

arXiv2026

Two-scale Neural Networks for Singularly Perturbed Dynamical Systems with Multiple Parameters

We extend our two-scale neural-network method for scalar singularly perturbed problems with one small parameter to dynamical systems with multiple small parameters. To accommodate multiple small parameters, we use a single effective scale parameter defined as the geometric mean of all parameters. We thus augment the network input with a scale-aware feature, enabling it to capture sharp solution transitions intrinsically. Numerical experiments across a range of dynamical systems demonstrate that the proposed framework can handle coupled systems with multiple and high-contrast small parameters and obtain satisfactory accuracy in capturing solution features induced by small parameters.

math.NA↗

arXiv2026

State-dependent temperature control in Langevin diffusions using numerical exploratory Hamiltonian-Jacobi-Bellman equations

Choosing how much noise to add in Langevin dynamics is essential for making these algorithms effective in challenging optimization problems. One promising approach is to determine this noise by solving Hamilton-Jacobi-Bellman (HJB) equations and their exploratory variants. Though these ideas have been demonstrated to work well in one dimension, extension to high-dimensional minimization has been limited by two unresolved numerical challenges: setting reliable control bounds and stably computing the second-order information (Hessians) required by the equations. These issues and the broader impact of HJB parameters have not been systematically examined. This work provides the first such investigation. We introduce principled control bounds and develop a physics-informed neural network framework that embeds the structure of exploratory HJB equations directly into training, stabilizing computation, and enabling accurate estimation of state-dependent noise in high-dimensional problems. Numerical experiments demonstrate that the resulting method remains robust and effective well beyond low-dimensional test cases.

math.NA↗

arXiv2025

Generalized Category Discovery via Reciprocal Learning and Class-Wise Distribution Regularization

Generalized Category Discovery (GCD) aims to identify unlabeled samples by leveraging the base knowledge from labeled ones, where the unlabeled set consists of both base and novel classes. Since clustering methods are time-consuming at inference, parametric-based approaches have become more popular. However, recent parametric-based methods suffer from inferior base discrimination due to unreliable self-supervision. To address this issue, we propose a Reciprocal Learning Framework (RLF) that introduces an auxiliary branch devoted to base classification. During training, the main branch filters the pseudo-base samples to the auxiliary branch. In response, the auxiliary branch provides more reliable soft labels for the main branch, leading to a virtuous cycle. Furthermore, we introduce Class-wise Distribution Regularization (CDR) to mitigate the learning bias towards base classes. CDR essentially increases the prediction confidence of the unlabeled data and boosts the novel class performance. Combined with both components, our proposed method, RLCD, achieves superior performance in all classes with negligible extra computation. Comprehensive experiments across seven GCD datasets validate its superiority. Our codes are available at https://github.com/APORduo/RLCD.

cs.CV↗

arXiv2025

Monotone Peridynamic Neural Operator for Nonlinear Material Modeling with Conditionally Unique Solutions

Data-driven methods have emerged as powerful tools for modeling the responses of complex nonlinear materials directly from experimental measurements. Among these methods, the data-driven constitutive models present advantages in physical interpretability and generalizability across different boundary conditions/domain settings. However, the well-posedness of these learned models is generally not guaranteed a priori, which makes the models prone to non-physical solutions in downstream simulation tasks. In this study, we introduce monotone peridynamic neural operator (MPNO), a novel data-driven nonlocal constitutive model learning approach based on neural operators. Our approach learns a nonlocal kernel together with a nonlinear constitutive relation, while ensuring solution uniqueness through a monotone gradient network. This architectural constraint on gradient induces convexity of the learnt energy density function, thereby guaranteeing solution uniqueness of MPNO in small deformation regimes. To validate our approach, we evaluate MPNO's performance on both synthetic and real-world datasets. On synthetic datasets with manufactured kernel and constitutive relation, we show that the learnt model converges to the ground-truth as the measurement grid size decreases both theoretically and numerically. Additionally, our MPNO exhibits superior generalization capabilities than the conventional neural networks: it yields smaller displacement solution errors in down-stream tasks with new and unseen loadings. Finally, we showcase the practical utility of our approach through applications in learning a homogenized model from molecular dynamics data, highlighting its expressivity and robustness in real-world scenarios.

cs.LG↗

arXiv2025

On modified Euler methods for McKean-Vlasov stochastic differential equations with super-linear coefficients

We introduce a new class of numerical methods for solving McKean-Vlasov stochastic differential equations, which are relevant in the context of distribution-dependent or mean-field models, under super-linear growth conditions for both the drift and diffusion coefficients. Under certain non-globally Lipschitz conditions, the proposed numerical approaches have half-order convergence in the strong sense to the corresponding system of interacting particles associated with McKean-Vlasov SDEs. By leveraging a result on the propagation of chaos, we establish the full convergence rate of the modified Euler approximations to the solution of the McKean-Vlasov SDEs. Numerical experiments are included to validate the theoretical results.

math.NA↗

arXiv2024

Fractional-order dependent Radial basis functions meshless methods for the integral fractional Laplacian

We study the numerical evaluation of the integral fractional Laplacian and its application in solving fractional diffusion equations. We derive a pseudo-spectral formula for the integral fractional Laplacian operator based on fractional order-dependent, generalized multi-quadratic radial basis functions (RBFs) to address efficient computation of the hyper-singular integral. We apply the proposed formula to solving fractional diffusion equations and design a simple, easy-to-implement and nearly integration-free meshless method. We discuss the convergence of the novel meshless method through equivalent Galerkin formulations. We carry out numerical experiments to demonstrate the accuracy and efficiency of the proposed approach compared to the existing method using Gaussian RBFs.

math.NA↗

arXiv2024

Tensor neural networks for high-dimensional Fokker-Planck equations

We solve high-dimensional steady-state Fokker-Planck equations on the whole space by applying tensor neural networks. The tensor networks are a linear combination of tensor products of one-dimensional feedforward networks or a linear combination of several selected radial basis functions. The use of tensor feedforward networks allows us to efficiently exploit auto-differentiation (in physical variables) in major Python packages while using radial basis functions can fully avoid auto-differentiation, which is rather expensive in high dimensions. We then use the physics-informed neural networks and stochastic gradient descent methods to learn the tensor networks. One essential step is to determine a proper bounded domain or numerical support for the Fokker-Planck equation. To better train the tensor radial basis function networks, we impose some constraints on parameters, which lead to relatively high accuracy. We demonstrate numerically that the tensor neural networks in physics-informed machine learning are efficient for steady-state Fokker-Planck equations from two to ten dimensions.

math.NA↗

arXiv2024

Weak error analysis for strong approximation schemes of SDEs with super-linear coefficients II: finite moments and higher-order schemes

This paper is the second in a series of works on weak convergence of one-step schemes for solving stochastic differential equations (SDEs) with one-sided Lipschitz conditions. It is known that the super-linear coefficients may lead to a blowup of moments of solutions and numerical solutions and thus affect the convergence of numerical methods. Wang et al. (2023, IMA J. Numer. Anal.) have analyzed weak convergence of one-step numerical schemes when solutions to SDEs have all finite moments. Therein some modified Euler schemes have been discussed about their weak convergence orders. In this work, we explore the effects of limited orders of moments on the weak convergence of a family of explicit schemes. The schemes are based on approximations/modifications of terms in the Ito-Talyor expansion. We provide a systematic but simple way to establish weak convergence orders for these schemes. We present several numerical examples of these schemes and show their weak convergence orders.

math.NA↗

arXiv2024

Two-scale Neural Networks for Partial Differential Equations with Small Parameters

We propose a two-scale neural network method for solving partial differential equations (PDEs) with small parameters using physics-informed neural networks (PINNs). We directly incorporate the small parameters into the architecture of neural networks. The proposed method enables solving PDEs with small parameters in a simple fashion, without adding Fourier features or other computationally taxing searches of truncation parameters. Various numerical examples demonstrate reasonable accuracy in capturing features of large derivatives in the solutions caused by small parameters.

math.NA↗

arXiv2024

Score-fPINN: Fractional Score-Based Physics-Informed Neural Networks for High-Dimensional Fokker-Planck-Levy Equations

We introduce an innovative approach for solving high-dimensional Fokker-Planck-Lévy (FPL) equations in modeling non-Brownian processes across disciplines such as physics, finance, and ecology. We utilize a fractional score function and Physical-informed neural networks (PINN) to lift the curse of dimensionality (CoD) and alleviate numerical overflow from exponentially decaying solutions with dimensions. The introduction of a fractional score function allows us to transform the FPL equation into a second-order partial differential equation without fractional Laplacian and thus can be readily solved with standard physics-informed neural networks (PINNs). We propose two methods to obtain a fractional score function: fractional score matching (FSM) and score-fPINN for fitting the fractional score function. While FSM is more cost-effective, it relies on known conditional distributions. On the other hand, score-fPINN is independent of specific stochastic differential equations (SDEs) but requires evaluating the PINN model's derivatives, which may be more costly. We conduct our experiments on various SDEs and demonstrate numerical stability and effectiveness of our method in dealing with high-dimensional problems, marking a significant advancement in addressing the CoD in FPL equations.

cs.LG↗

arXiv2024

Tackling the Curse of Dimensionality in Fractional and Tempered Fractional PDEs with Physics-Informed Neural Networks

Fractional and tempered fractional partial differential equations (PDEs) are effective models of long-range interactions, anomalous diffusion, and non-local effects. Traditional numerical methods for these problems are mesh-based, thus struggling with the curse of dimensionality (CoD). Physics-informed neural networks (PINNs) offer a promising solution due to their universal approximation, generalization ability, and mesh-free training. In principle, Monte Carlo fractional PINN (MC-fPINN) estimates fractional derivatives using Monte Carlo methods and thus could lift CoD. However, this may cause significant variance and errors, hence affecting convergence; in addition, MC-fPINN is sensitive to hyperparameters. In general, numerical methods and specifically PINNs for tempered fractional PDEs are under-developed. Herein, we extend MC-fPINN to tempered fractional PDEs to address these issues, resulting in the Monte Carlo tempered fractional PINN (MC-tfPINN). To reduce possible high variance and errors from Monte Carlo sampling, we replace the one-dimensional (1D) Monte Carlo with 1D Gaussian quadrature, applicable to both MC-fPINN and MC-tfPINN. We validate our methods on various forward and inverse problems of fractional and tempered fractional PDEs, scaling up to 100,000 dimensions. Our improved MC-fPINN/MC-tfPINN using quadrature consistently outperforms the original versions in accuracy and convergence speed in very high dimensions.

math.NA↗

arXiv2024

A simple and fast finite difference method for the integral fractional Laplacian of variable order

For the fractional Laplacian of variable order, an efficient and accurate numerical evaluation in multi-dimension is a challenge for the nature of a singular integral. We propose a simple and easy-to-implement finite difference scheme for the multi-dimensional variable-order fractional Laplacian defined by a hypersingular integral. We prove that the scheme is of second-order convergence and apply the developed finite difference scheme to solve various equations with the variable-order fractional Laplacian. We present a fast solver with quasi-linear complexity of the scheme for computing variable-order fractional Laplacian and corresponding PDEs. Several numerical examples demonstrate the accuracy and efficiency of our algorithm and verify our theory.

math.NA↗

arXiv2024

Transformers as Neural Operators for Solutions of Differential Equations with Finite Regularity

Neural operator learning models have emerged as very effective surrogates in data-driven methods for partial differential equations (PDEs) across different applications from computational science and engineering. Such operator learning models not only predict particular instances of a physical or biological system in real-time but also forecast classes of solutions corresponding to a distribution of initial and boundary conditions or forcing terms. % DeepONet is the first neural operator model and has been tested extensively for a broad class of solutions, including Riemann problems. Transformers have not been used in that capacity, and specifically, they have not been tested for solutions of PDEs with low regularity. % In this work, we first establish the theoretical groundwork that transformers possess the universal approximation property as operator learning models. We then apply transformers to forecast solutions of diverse dynamical systems with solutions of finite regularity for a plurality of initial conditions and forcing terms. In particular, we consider three examples: the Izhikevich neuron model, the tempered fractional-order Leaky Integrate-and-Fire (LIF) model, and the one-dimensional Euler equation Riemann problem. For the latter problem, we also compare with variants of DeepONet, and we find that transformers outperform DeepONet in accuracy but they are computationally more expensive.

cs.LG↗

arXiv2024

Score-Based Physics-Informed Neural Networks for High-Dimensional Fokker-Planck Equations

The Fokker-Planck (FP) equation is a foundational PDE in stochastic processes. However, curse of dimensionality (CoD) poses challenge when dealing with high-dimensional FP PDEs. Although Monte Carlo and vanilla Physics-Informed Neural Networks (PINNs) have shown the potential to tackle CoD, both methods exhibit numerical errors in high dimensions when dealing with the probability density function (PDF) associated with Brownian motion. The point-wise PDF values tend to decrease exponentially as dimension increases, surpassing the precision of numerical simulations and resulting in substantial errors. Moreover, due to its massive sampling, Monte Carlo fails to offer fast sampling. Modeling the logarithm likelihood (LL) via vanilla PINNs transforms the FP equation into a difficult HJB equation, whose error grows rapidly with dimension. To this end, we propose a novel approach utilizing a score-based solver to fit the score function in SDEs. The score function, defined as the gradient of the LL, plays a fundamental role in inferring LL and PDF and enables fast SDE sampling. Three fitting methods, Score Matching (SM), Sliced SM (SSM), and Score-PINN, are introduced. The proposed score-based SDE solver operates in two stages: first, employing SM, SSM, or Score-PINN to acquire the score; and second, solving the LL via an ODE using the obtained score. Comparative evaluations across these methods showcase varying trade-offs. The proposed method is evaluated across diverse SDEs, including anisotropic OU processes, geometric Brownian, and Brownian with varying eigenspace. We also test various distributions, including Gaussian, Log-normal, Laplace, and Cauchy. The numerical results demonstrate the score-based SDE solver's stability, speed, and performance across different settings, solidifying its potential as a solution to CoD for high-dimensional FP equations.

cs.LG↗