arXiv subjects

Xueyu Zhu

Publications and source records attributed to Xueyu Zhu.

At least 19 recordsLinked to original sources

arXiv2026

Robust Parameter and State Estimation in Multiscale Neuronal Systems Using Physics-Informed Neural Networks

Inferring biophysical parameters and hidden state variables from partial and noisy observations is a fundamental challenge in computational neuroscience. This problem is particularly difficult for fast - slow spiking and bursting models, where strong nonlinearities, multiscale dynamics, and limited observational data often lead to severe sensitivity to initial parameter guesses and convergence failure in the methods replying on the traditional numerical forward solvers. In this work, we developed a physics-informed neural network (PINN) framework for the joint reconstruction of unobserved state variables and the estimation of unknown biophysical parameters in neuronal models. We demonstrate the effectiveness of the method on biophysical neuron models, including the Morris-Lecar model across multiple spiking and bursting regimes and a respiratory model neuron. The method requires only partial voltage observations over short observation windows and remains robust even when initialized with non-informative parameter guesses. These results suggest that PINN can deliver robust and accurate parameter inference and state reconstruction, providing a promising alternative for inverse problems in multiscale neuronal dynamics, where traditional techniques often struggle.

cs.NE↗

arXiv2025

A Bi-fidelity based asymptotic-preserving neural network for the semiconductor Boltzmann equation and its inverse problem

This paper introduces a Bi-fidelity Asymptotic-Preserving Neural Network (BI-APNNs) framework, designed to efficiently solve forward and inverse problems for the semiconductor Boltzmann equation. Our approach builds upon the Asymptotic-Preserving Neural Network (APNNs) methodology \cite{APNN-transport}, which employs a micro-macro decomposition to handle the model's multiscale nature. We specifically address a key bottleneck in the original APNNs: the slow convergence of the macroscopic density $ρ$ in the near fluid-dynamic regime, i.e., for small Knudsen numbers $\varepsilon$. The core innovation of BI-APNNs is a novel bi-fidelity decomposition of the macroscopic quantity $ρ$, which accurately approximates the true density at small $\varepsilon$, and can be efficiently pre-trained. A separate and more compact neural network is then tasked with learning only the minor correction term, $ρ_{\text{corr}}$. This strategy not only significantly {\it accelerates} the training convergence but also improves the accuracy of the forward problem solution, particularly in the challenging fluid-dynamic limit. Meanwhile, we demonstrate through extensive numerical experiments that our new BI-APNNs yields substantially more accurate and robust results for inverse problems compared to the standard APNNs. Validated on both the semiconductor Boltzmann and the Boltzmann-Poisson systems, our work shows that the bi-fidelity formulation is a powerful enhancement for tackling multiscale kinetic equations, especially when dealing with inverse problems constrained by partial observation data.

math.NA↗

arXiv2025

Uncertainty-aware Frequency-domain Acoustic Full Waveform Inversion Using Gaussian Random Fields and Ensemble Kalman Inversion

In recent years, uncertainty-aware full waveform inversion (FWI) has received increasing attention, with a growing emphasis on producing informative uncertainty estimates alongside inversion results. Bayesian inference methods--particularly Monte Carlo-based approaches--have been widely employed to quantify uncertainty. However, these techniques often require extensive posterior sampling, resulting in high computational costs. To address this challenge and enable efficient uncertainty quantification in FWI, we introduce an uncertainty-aware FWI framework--EKI-GRFs-FWI--that integrates Gaussian random fields (GRFs) with the ensemble Kalman inversion (EKI) algorithm. This approach jointly infers subsurface velocity fields and provides reliable uncertainty estimates in a computationally efficient manner. The EKI algorithm leverages a derivative-free update mechanism and employs effective stopping criteria to ensure rapid convergence, making it suitable for large-scale inverse problems. Meanwhile, GRFs incorporate prior knowledge of spatial smoothness and correlation length scales, enabling the generation of physically plausible initial ensembles for EKI. Numerical results demonstrate that EKI-GRFs-FWI yields reasonably accurate velocity reconstructions while delivering informative uncertainty estimates.

physics.geo-ph↗

arXiv2024

Asymptotic-preserving neural networks for the semiconductor Boltzmann equation and its application on inverse problems

In this paper, we develop the Asymptotic-Preserving Neural Networks (APNNs) approach to study the forward and inverse problem for the semiconductor Boltzmann equation. The goal of the neural network is to resolve the computational challenges of conventional numerical methods and multiple scales of the model. To guarantee the network can operate uniformly in different regimes, it is desirable to carry the Asymptotic-Preservation (AP) property in the learning process. In a micro-macro decomposition framework, we design such an AP formulation of loss function. The convergence analysis of both the loss function and its neural network is shown, based on the Universal Approximation Theorem and hypocoercivity theory of the model equation. We show a series of numerical tests for forward and inverse problems of both the semiconductor Boltzmann and the Boltzmann-Poisson system to validate the effectiveness of our proposed method, which addresses the significance of the AP property when dealing with inverse problems of multiscale Boltzmann equations especially when only sparse or partially observed data are available.

math-ph↗

arXiv2024

LanePtrNet: Revisiting Lane Detection as Point Voting and Grouping on Curves

Lane detection plays a critical role in the field of autonomous driving. Prevailing methods generally adopt basic concepts (anchors, key points, etc.) from object detection and segmentation tasks, while these approaches require manual adjustments for curved objects, involve exhaustive searches on predefined anchors, require complex post-processing steps, and may lack flexibility when applied to real-world scenarios.In this paper, we propose a novel approach, LanePtrNet, which treats lane detection as a process of point voting and grouping on ordered sets: Our method takes backbone features as input and predicts a curve-aware centerness, which represents each lane as a point and assigns the most probable center point to it. A novel point sampling method is proposed to generate a set of candidate points based on the votes received. By leveraging features from local neighborhoods, and cross-instance attention score, we design a grouping module that further performs lane-wise clustering between neighboring and seeding points. Furthermore, our method can accommodate a point-based framework, (PointNet++ series, etc.) as an alternative to the backbone. This flexibility enables effortless extension to 3D lane detection tasks. We conduct comprehensive experiments to validate the effectiveness of our proposed approach, demonstrating its superior performance.

cs.CV↗

arXiv2024

Uncertainty quantification for deeponets with ensemble kalman inversion

In recent years, operator learning, particularly the DeepONet, has received much attention for efficiently learning complex mappings between input and output functions across diverse fields. However, in practical scenarios with limited and noisy data, accessing the uncertainty in DeepONet predictions becomes essential, especially in mission-critical or safety-critical applications. Existing methods, either computationally intensive or yielding unsatisfactory uncertainty quantification, leave room for developing efficient and informative uncertainty quantification (UQ) techniques tailored for DeepONets. In this work, we proposed a novel inference approach for efficient UQ for operator learning by harnessing the power of the Ensemble Kalman Inversion (EKI) approach. EKI, known for its derivative-free, noise-robust, and highly parallelizable feature, has demonstrated its advantages for UQ for physics-informed neural networks [28]. Our innovative application of EKI enables us to efficiently train ensembles of DeepONets while obtaining informative uncertainty estimates for the output of interest. We deploy a mini-batch variant of EKI to accommodate larger datasets, mitigating the computational demand due to large datasets during the training stage. Furthermore, we introduce a heuristic method to estimate the artificial dynamics covariance, thereby improving our uncertainty estimates. Finally, we demonstrate the effectiveness and versatility of our proposed methodology across various benchmark problems, showcasing its potential to address the pressing challenges of uncertainty quantification in DeepONets, especially for practical applications with limited and noisy data.

cs.LG↗

arXiv2023

A non-intrusive bi-fidelity reduced basis method for time-independent problems

Scientific and engineering problems often involve parametric partial differential equations (PDEs), such as uncertainty quantification, optimizations, and inverse problems. However, solving these PDEs repeatedly can be prohibitively expensive, especially for large-scale complex applications. To address this issue, reduced order modeling (ROM) has emerged as an effective method to reduce computational costs. However, ROM often requires significant modifications to the existing code, which can be time-consuming and complex, particularly for large-scale legacy codes. Non-intrusive methods have gained attention as an alternative approach. However, most existing non-intrusive approaches are purely data-driven and may not respect the underlying physics laws during the online stage, resulting in less accurate approximations of the reduced solution. In this study, we propose a new non-intrusive bi-fidelity reduced basis method for time-independent parametric PDEs. Our algorithm utilizes the discrete operator, solutions, and right-hand sides obtained from the high-fidelity legacy solver. By leveraging a low-fidelity model, we efficiently construct the reduced operator and right-hand side for new parameter values during the online stage. Unlike other non-intrusive ROM methods, we enforce the reduced equation during the online stage. In addition, the non-intrusive nature of our algorithm makes it straightforward and applicable to general nonlinear time-independent problems. We demonstrate its performance through several benchmark examples, including nonlinear and multiscale PDEs.

math.NA↗

arXiv2023

Forward and inverse problems for Eikonal equation based on DeepONet

Seismic forward and inverse problems are significant research areas in geophysics. However, the time burden of traditional numerical methods hinders their applications in scenarios that require fast predictions. Machine learning-based methods also have limitations as retraining is required for every change in initial conditions. In this letter, we adopt deep operator network (DeepONet) to solve forward and inverse problems based on the Eikonal equation, respectively. DeepONet approximates the operator through two sub-networks, branch net and trunk net, which offers good generalization and flexibility. Different structures of DeepONets are proposed to respectively learn the operators in forward and inverse problems. We train the networks on different categories of datasets separately, so that they can deliver accurate predictions with different initial conditions for the specific velocity model. The numerical results demonstrate that DeepONet can not only predict the travel time fields with different sources for different velocity models, but also provide velocity models based on the observed travel time data.

physics.geo-ph↗

arXiv2023

Efficient Bayesian Physics Informed Neural Networks for Inverse Problems via Ensemble Kalman Inversion

Bayesian Physics Informed Neural Networks (B-PINNs) have gained significant attention for inferring physical parameters and learning the forward solutions for problems based on partial differential equations. However, the overparameterized nature of neural networks poses a computational challenge for high-dimensional posterior inference. Existing inference approaches, such as particle-based or variance inference methods, are either computationally expensive for high-dimensional posterior inference or provide unsatisfactory uncertainty estimates. In this paper, we present a new efficient inference algorithm for B-PINNs that uses Ensemble Kalman Inversion (EKI) for high-dimensional inference tasks. We find that our proposed method can achieve inference results with informative uncertainty estimates comparable to Hamiltonian Monte Carlo (HMC)-based B-PINNs with a much reduced computational cost. These findings suggest that our proposed approach has great potential for uncertainty quantification in physics-informed machine learning for practical applications.

stat.ML↗

arXiv2022

Bayesian Physics-Informed Neural Networks for the Subsurface Tomography based on the Eikonal Equation

The high cost of acquiring a sufficient amount of seismic data for training has limited the use of machine learning in seismic tomography. In addition, the inversion uncertainty due to the noisy data and data scarcity is less discussed in conventional seismic tomography literature. To mitigate the uncertainty effects and quantify their impacts in the prediction, the so-called Bayesian Physics-Informed Neural Networks (BPINNs) based on the eikonal equation are adopted to infer the velocity field and reconstruct the travel-time field. In BPINNs, two inference algorithms including Stein Variational Gradient Descent (SVGD) and Gaussian variational inference (VI) are investigated for the inference task. The numerical results of several benchmark problems demonstrate that the velocity field can be estimated accurately and the travel-time can be well approximated with reasonable uncertainty estimates by BPINNs. This suggests that the inferred velocity model provided by BPINNs may serve as a valid initial model for seismic inversion and migration.

physics.geo-ph↗

arXiv2022

Asymptotic-Preserving Neural Networks for multiscale hyperbolic models of epidemic spread

When investigating epidemic dynamics through differential models, the parameters needed to understand the phenomenon and to simulate forecast scenarios require a delicate calibration phase, often made even more challenging by the scarcity and uncertainty of the observed data reported by official sources. In this context, Physics-Informed Neural Networks (PINNs), by embedding the knowledge of the differential model that governs the physical phenomenon in the learning process, can effectively address the inverse and forward problem of data-driven learning and solving the corresponding epidemic problem. In many circumstances, however, the spatial propagation of an infectious disease is characterized by movements of individuals at different scales governed by multiscale PDEs. This reflects the heterogeneity of a region or territory in relation to the dynamics within cities and in neighboring zones. In presence of multiple scales, a direct application of PINNs generally leads to poor results due to the multiscale nature of the differential model in the loss function of the neural network. To allow the neural network to operate uniformly with respect to the small scales, it is desirable that the neural network satisfies an Asymptotic-Preservation (AP) property in the learning process. To this end, we consider a new class of AP Neural Networks (APNNs) for multiscale hyperbolic transport models of epidemic spread that, thanks to an appropriate AP formulation of the loss function, is capable to work uniformly at the different scales of the system. A series of numerical tests for different epidemic scenarios confirms the validity of the proposed approach, highlighting the importance of the AP property in the neural network when dealing with multiscale problems especially in presence of sparse and partially observed systems.

math.NA↗

arXiv2022

Physics-informed neural networks for learning the homogenized coefficients of multiscale elliptic equations

Multiscale elliptic equations with scale separation are often approximated by the corresponding homogenized equations with slowly varying homogenized coefficients (the G-limit). The traditional homogenization techniques typically rely on the periodicity of the multiscale coefficients, thus finding the G-limits often requires sophisticated techniques in more general settings even when multiscale coefficient is known, if possible. Alternatively, we propose a simple approach to estimate the G-limits from (noisy-free or noisy) multiscale solution data, either from the existing forward multiscale solvers or sensor measurements. By casting this problem into an inverse problem, our approach adopts physics-informed neural networks (PINNs) algorithm to estimate the G-limits from the multiscale solution data by leveraging a priori knowledge of the underlying homogenized equations. Unlike the existing approaches, our approach does not rely on the periodicity assumption or the known multiscale coefficient during the learning stage, allowing us to estimate homogenized coefficients in more general settings beyond the periodic setting. We demonstrate that the proposed approach can deliver reasonable and accurate approximations to the G-limits as well as homogenized solutions through several benchmark problems.

math.NA↗

arXiv2021

Multi-fidelity methods for uncertainty propagation in kinetic equations

The construction of efficient methods for uncertainty quantification in kinetic equations represents a challenge due to the high dimensionality of the models: often the computational costs involved become prohibitive. On the other hand, precisely because of the curse of dimensionality, the construction of simplified models capable of providing approximate solutions at a computationally reduced cost has always represented one of the main research strands in the field of kinetic equations. Approximations based on suitable closures of the moment equations or on simplified collisional models have been studied by many authors. In the context of uncertainty quantification, it is therefore natural to take advantage of such models in a multi-fidelity setting where the original kinetic equation represents the high-fidelity model, and the simplified models define the low-fidelity surrogate models. The scope of this article is to survey some recent results about multi-fidelity methods for kinetic equations that are able to accelerate the solution of the uncertainty quantification process by combining high-fidelity and low-fidelity model evaluations with particular attention to the case of compressible and incompressible hydrodynamic limits. We will focus essentially on two classes of strategies: multi-fidelity control variates methods and bi-fidelity stochastic collocation methods. The various approaches considered are analyzed in light of the different surrogate models used and the different numerical techniques adopted. Given the relevance of the specific choice of the surrogate model, an application-oriented approach has been chosen in the presentation.

math.NA↗

arXiv2021

Bi-fidelity stochastic collocation methods for epidemic transport models with uncertainties

Uncertainty in data is certainly one of the main problems in epidemiology, as shown by the recent COVID-19 pandemic. The need for efficient methods capable of quantifying uncertainty in the mathematical model is essential in order to produce realistic scenarios of the spread of infection. In this paper, we introduce a bi-fidelity approach to quantify uncertainty in spatially dependent epidemic models. The approach is based on evaluating a high-fidelity model on a small number of samples properly selected from a large number of evaluations of a low-fidelity model. In particular, we will consider the class of multiscale transport models recently introduced in Bertaglia, Boscheri, Dimarco & Pareschi, Math. Biosci. Eng. (2021) and Boscheri, Dimarco & Pareschi, Math. Mod. Meth. App. Scie. (2021) as the high-fidelity reference and use simple two-velocity discrete models for low-fidelity evaluations. Both models share the same diffusive behavior and are solved with ad-hoc asymptotic-preserving numerical discretizations. A series of numerical experiments confirm the validity of the approach.

math.NA↗

arXiv2021

A bi-fidelity stochastic collocation method for transport equations with diffusive scaling and multi-dimensional random inputs

In this paper, we consider the development of efficient numerical methods for linear transport equations with random parameters and under the diffusive scaling. We extend to the present case the bi-fidelity stochastic collocation method introduced in [33,50,51]. For the high-fidelity transport model, the asymptotic-preserving scheme [29] is used for each stochastic sample. We employ the simple two-velocity Goldstein-Taylor equation as low-fidelity model to accelerate the convergence of the uncertainty quantification process. The choice is motivated by the fact that both models, high fidelity and low fidelity, share the same diffusion limit. Speed-up is achieved by proper selection of the collocation points and relative approximation of the high-fidelity solution. Extensive numerical experiments are conducted to show the efficiency and accuracy of the proposed method, even in non diffusive regimes, with empirical error bound estimations as studied in [16].

math.NA↗

arXiv2020

Nonnegativity-Enforced Gaussian Process Regression

Gaussian Process (GP) regression is a flexible non-parametric approach to approximate complex models. In many cases, these models correspond to processes with bounded physical properties. Standard GP regression typically results in a proxy model which is unbounded for all temporal or spacial points, and thus leaves the possibility of taking on infeasible values. We propose an approach to enforce the physical constraints in a probabilistic way under the GP regression framework. In addition, this new approach reduces the variance in the resulting GP model.

cs.LG↗

arXiv2019

A bi-fidelity method for the multiscale Boltzmann equation with random parameters

In this paper, we study the multiscale Boltzmann equation with multi-dimensional random parameters by a bi-fidelity stochastic collocation (SC) method developed in [A. Narayan, C. Gittelson and D. Xiu, SIAM J. Sci. Comput., 36 (2014); X. Zhu, A. Narayan and D. Xiu, SIAM J. Uncertain. Quantif., 2 (2014)]. By choosing the compressible Euler system as the low-fidelity model, we adapt the bi-fidelity SC method to combine computational efficiency of the low-fidelity model with high accuracy of the high-fidelity (Boltzmann) model. With only a small number of high-fidelity asymptotic-preserving solver runs for the Boltzmann equation, the bi-fidelity approximation can capture well the macroscopic quantities of the solution to the Boltzmann equation in the random space. A priori estimate on the accuracy between the high- and bi-fidelity solutions together with a convergence analysis is established. Finally, we present extensive numerical experiments to verify the efficiency and accuracy of our proposed method.

math.NA↗

arXiv2019

A Bi-fidelity Surrogate Modeling Approach for Uncertainty Propagation in Three-Dimensional Hemodynamic Simulations

Image-based computational fluid dynamics (CFD) modeling enables derivation of hemodynamic information, which has become a paradigm in cardiovascular research and healthcare. Nonetheless, the predictive accuracy largely depends on precisely specified boundary conditions and model parameters, which, however, are usually uncertain in most patient-specific cases. Quantifying the uncertainties in model predictions due to input randomness can provide predictive confidence and is critical to promote the transition of CFD modeling in clinical applications. In the meantime, forward propagation of input uncertainties often involves numerous expensive CFD simulations, which is computationally prohibitive in most practical scenarios. This paper presents an efficient bi-fidelity surrogate modeling framework for uncertainty quantification (UQ) in cardiovascular simulations, by leveraging the accuracy of high-fidelity models and efficiency of low-fidelity models. Contrary to most data-fit surrogate models with several scalar quantities of interest, this work aims to provide high-resolution, full-field predictions. Moreover, a novel empirical error bound estimation approach is introduced to evaluate the performance of the surrogate a priori. The proposed framework is tested on a number of vascular flows with both standardized and patient-specific vessel geometries, and different combinations of high- and low-fidelity models are investigated. The results show that the bi-fidelity approach can achieve high predictive accuracy with a significant reduction of computational cost, exhibiting its merit and effectiveness. Particularly, the uncertainties from a high-dimensional input space can be accurately propagated to clinically relevant quantities of interest in the patient-specific case using only a limited number of high-fidelity simulations, suggesting a good potential in practical clinical applications.

physics.flu-dyn↗