arXiv subjects

Yating Wang

Publications and source records attributed to Yating Wang.

52 records · Page 3Linked to original sources

arXiv2022

AMS-Net: Adaptive Multiscale Sparse Neural Network with Interpretable Basis Expansion for Multiphase Flow Problems

In this work, we propose an adaptive sparse learning algorithm that can be applied to learn the physical processes and obtain a sparse representation of the solution given a large snapshot space. Assume that there is a rich class of precomputed basis functions that can be used to approximate the quantity of interest. We then design a neural network architecture to learn the coefficients of solutions in the spaces which are spanned by these basis functions. The information of the basis functions are incorporated in the loss function, which minimizes the differences between the downscaled reduced order solutions and reference solutions at multiple time steps. The network contains multiple submodules and the solutions at different time steps can be learned simultaneously. We propose some strategies in the learning framework to identify important degrees of freedom. To find a sparse solution representation, a soft thresholding operator is applied to enforce the sparsity of the output coefficient vectors of the neural network. To avoid over-simplification and enrich the approximation space, some degrees of freedom can be added back to the system through a greedy algorithm. In both scenarios, that is, removing and adding degrees of freedom, the corresponding network connections are pruned or reactivated guided by the magnitude of the solution coefficients obtained from the network outputs. The proposed adaptive learning process is applied to some toy case examples to demonstrate that it can achieve a good basis selection and accurate approximation. More numerical tests are performed on two-phase multiscale flow problems to show the capability and interpretability of the proposed method on complicated applications.

cs.LG↗

arXiv2022

Multirate partially explicit scheme for multiscale flow problems

For time-dependent problems with high-contrast multiscale coefficients, the time step size for explicit methods is affected by the magnitude of the coefficient parameter. With a suitable construction of multiscale space, one can achieve a stable temporal splitting scheme where the time step size is independent of the contrast. Consider the parabolic equation with heterogeneous diffusion parameter, the flow rates vary significantly in different regions due to the high-contrast features of the diffusivity. In this work, we aim to introduce a multirate partially explicit splitting scheme to achieve efficient simulation with the desired accuracy. We first design multiscale subspaces to handle flow with different speed. For the fast flow, we obtain a low-dimensional subspace with respect to the high-diffusive component and adopt an implicit time discretization scheme. The other multiscale subspace will take care of the slow flow, and the corresponding degrees of freedom are treated explicitly. Then a multirate time stepping is introduced for the two parts. The stability of the multirate methods is analyzed for the partially explicit scheme. Moreover, we derive local error estimators corresponding to the two components of the solutions and provide an upper bound of the errors. An adaptive local temporal refinement framework is then proposed to achieve higher computational efficiency. Several numerical tests are presented to demonstrate the performance of the proposed method.

math.NA↗

arXiv2021

Multi-variance replica exchange stochastic gradient MCMC for inverse and forward Bayesian physics-informed neural network

Physics-informed neural network (PINN) has been successfully applied in solving a variety of nonlinear non-convex forward and inverse problems. However, the training is challenging because of the non-convex loss functions and the multiple optima in the Bayesian inverse problem. In this work, we propose a multi-variance replica exchange stochastic gradient Langevin diffusion method to tackle the challenge of the multiple local optima in the optimization and the challenge of the multiple modal posterior distribution in the inverse problem. Replica exchange methods are capable of escaping from the local traps and accelerating the convergence. However, it may not be efficient to solve mathematical inversion problems by using the vanilla replica method directly since the method doubles the computational cost in evaluating the forward solvers (likelihood functions) in the two chains. To address this issue, we propose to make different assumptions on the energy function estimation and this facilities one to use solvers of different fidelities in the likelihood function evaluation. We give an unbiased estimate of the swapping rate and give an estimation of the discretization error of the scheme. To verify our idea, we design and solve four inverse problems which have multiple modes. The proposed method is also employed to train the Bayesian PINN to solve the forward and inverse problems; faster and more accurate convergence has been observed when compared to the stochastic gradient Langevin diffusion (SGLD) method and vanila replica exchange methods.

math.NA↗

arXiv2020

MFPC-Net: Multi-fidelity Physics-Constrained Neural Process

In this work, we propose a network which can utilize computational cheap low-fidelity data together with limited high-fidelity data to train surrogate models, where the multi-fidelity data are generated from multiple underlying models. The network takes a context set as input (physical observation points, low fidelity solution at observed points) and output (high fidelity solution at observed points) pairs. It uses the neural process to learn a distribution over functions conditioned on context sets and provide the mean and standard deviation at target sets. Moreover, the proposed framework also takes into account the available physical laws that govern the data and imposes them as constraints in the loss function. The multi-fidelity physical constraint network (MFPC-Net) (1) takes datasets obtained from multiple models at the same time in the training, (2) takes advantage of available physical information, (3) learns a stochastic process which can encode prior beliefs about the correlation between two fidelity with a few observations, and (4) produces predictions with uncertainty. The ability of representing a class of functions is ensured by the property of neural process and is achieved by the global latent variables in the neural network. Physical constraints are added to the loss using Lagrange multipliers. An algorithm to optimize the loss function is proposed to effectively train the parameters in the network on an ad hoc basis. Once trained, one can obtain fast evaluations at the entire domain of interest given a few observation points from a new low-and high-fidelity model pair. Particularly, one can further identify the unknown parameters such as permeability fields in elliptic PDEs with a simple modification of the network. Several numerical examples for both forward and inverse problems are presented to demonstrate the performance of the proposed method.

physics.comp-ph↗

arXiv2020

An adaptive Hessian approximated stochastic gradient MCMC method

Bayesian approaches have been successfully integrated into training deep neural networks. One popular family is stochastic gradient Markov chain Monte Carlo methods (SG-MCMC), which have gained increasing interest due to their scalability to handle large datasets and the ability to avoid overfitting. Although standard SG-MCMC methods have shown great performance in a variety of problems, they may be inefficient when the random variables in the target posterior densities have scale differences or are highly correlated. In this work, we present an adaptive Hessian approximated stochastic gradient MCMC method to incorporate local geometric information while sampling from the posterior. The idea is to apply stochastic approximation to sequentially update a preconditioning matrix at each iteration. The preconditioner possesses second-order information and can guide the random walk of a sampler efficiently. Instead of computing and saving the full Hessian of the log posterior, we use limited memory of the sample and their stochastic gradients to approximate the inverse Hessian-vector multiplication in the updating formula. Moreover, by smoothly optimizing the preconditioning matrix, our proposed algorithm can asymptotically converge to the target distribution with a controllable bias under mild conditions. To reduce the training and testing computational burden, we adopt a magnitude-based weight pruning method to enforce the sparsity of the network. Our method is user-friendly and is scalable to standard SG-MCMC updating rules by implementing an additional preconditioner. The sparse approximation of inverse Hessian alleviates storage and computational complexities for large dimensional models. The bias introduced by stochastic approximation is controllable and can be analyzed theoretically. Numerical experiments are performed on several problems.

math.NA↗

arXiv2020

Bayesian Sparse learning with preconditioned stochastic gradient MCMC and its applications

In this work, we propose a Bayesian type sparse deep learning algorithm. The algorithm utilizes a set of spike-and-slab priors for the parameters in the deep neural network. The hierarchical Bayesian mixture will be trained using an adaptive empirical method. That is, one will alternatively sample from the posterior using preconditioned stochastic gradient Langevin Dynamics (PSGLD), and optimize the latent variables via stochastic approximation. The sparsity of the network is achieved while optimizing the hyperparameters with adaptive searching and penalizing. A popular SG-MCMC approach is Stochastic gradient Langevin dynamics (SGLD). However, considering the complex geometry in the model parameter space in non-convex learning, updating parameters using a universal step size in each component as in SGLD may cause slow mixing. To address this issue, we apply a computationally manageable preconditioner in the updating rule, which provides a step-size parameter to adapt to local geometric properties. Moreover, by smoothly optimizing the hyperparameter in the preconditioning matrix, our proposed algorithm ensures a decreasing bias, which is introduced by ignoring the correction term in preconditioned SGLD. According to the existing theoretical framework, we show that the proposed algorithm can asymptotically converge to the correct distribution with a controllable bias under mild conditions. Numerical tests are performed on both synthetic regression problems and learning the solutions of elliptic PDE, which demonstrate the accuracy and efficiency of present work.

math.NA↗

arXiv2019

XCloud: Design and Implementation of AI Cloud Platform with RESTful API Service

In recent years, artificial intelligence (AI) has aroused much attention among both industrial and academic areas. However, building and maintaining efficient AI systems are quite difficult for many small business companies and researchers if they are not familiar with machine learning and AI. In this paper, we first evaluate the difficulties and challenges in building AI systems. Then an cloud platform termed XCloud, which provides several common AI services in form of RESTful APIs, is constructed. Technical details are discussed in Section 2. This project is released as open-source software and can be easily accessed for late research. Code is available at https://github.com/lucasxlu/XCloud.git.

cs.DC↗

arXiv2019

Efficient Deep Learning Techniques for Multiphase Flow Simulation in Heterogeneous Porous Media

We present efficient deep learning techniques for approximating flow and transport equations for both single phase and two-phase flow problems. The proposed methods take advantages of the sparsity structures in the underlying discrete systems and can be served as efficient alternatives to the system solvers at the full order. In particular, for the flow problem, we design a network with convolutional and locally connected layers to perform model reductions. Moreover, we employ a custom loss function to impose local mass conservation constraints. This helps to preserve the physical property of velocity solution which we are interested in learning. For the saturation problem, we propose a residual type of network to approximate the dynamics. Our main contribution here is the design of custom sparsely connected layers which take into account the inherent sparse interaction between the input and output. After training, the approximated feed-forward map can be applied iteratively to predict solutions in the long range. Our trained networks, especially in two-phase flow where the maps are nonlinear, show their great potential in accurately approximating the underlying physical system and improvement in computational efficiency. Some numerical experiments are performed and discussed to demonstrate the performance of our proposed techniques.

math.NA↗

arXiv2019

Data-driven Approach for Quality Evaluation on Knowledge Sharing Platform

In recent years, voice knowledge sharing and question answering (Q&A) platforms have attracted much attention, which greatly facilitate the knowledge acquisition for people. However, little research has evaluated on the quality evaluation on voice knowledge sharing. This paper presents a data-driven approach to automatically evaluate the quality of a specific Q&A platform (Zhihu Live). Extensive experiments demonstrate the effectiveness of the proposed method. Furthermore, we introduce a dataset of Zhihu Live as an open resource for researchers in related areas. This dataset will facilitate the development of new methods on knowledge sharing services quality evaluation.

cs.SI↗

arXiv2018

Prediction of Discretization of GMsFEM using Deep Learning

In this paper, we propose a deep-learning-based approach to a class of multiscale problems. THe Generalized Multiscale Finite Element Method (GMsFEM) has been proven successful as a model reduction technique of flow problems in heterogeneous and high-contrast porous media. The key ingredients of GMsFEM include mutlsicale basis functions and coarse-scale parameters, which are obtained from solving local problems in each coarse neighborhood. Given a fixed medium, these quantities are precomputed by solving local problems in an offline stage, and result in a reduced-order model. However, these quantities have to be re-computed in case of varying media. The objective of our work is to make use of deep learning techniques to mimic the nonlinear relation between the permeability field and the GMsFEM discretizations, and use neural networks to perform fast computation of GMsFEM ingredients repeatedly for a class of media. We provide numerical experiments to investigate the predictive power of neural networks and the usefulness of the resultant multiscale model in solving channelized porous media flow problems.

math.NA↗

arXiv2018

Nonlocal multicontinua upscaling for multicontinua flow problems in fractured porous media

Our goal of this paper is to develop a new upscaling method for multicontinua flow problems in fractured porous media. We consider a system of equations that describes flow phenomena with multiple flow variables defined on both matrix and fractures. To construct our upscaled model, we will apply the nonlocal multicontinua (NLMC) upscaling technique. The upscaled coefficients are obtained by using some multiscale basis functions, which are solutions of local problems defined on oversampled regions. For each continuum within a target coarse element, we will solve a local problem defined on an oversampling region obtained by extending the target element by few coarse grid layers, with a set of constraints which enforce the local solution to have mean value one on the chosen continuum and zero mean otherwise. The resulting multiscale basis functions have been shown to have good approximation properties. To illustrate the idea of our approach, we will consider a dual continua background model consisting of discrete fractures in two space dimensions, that is, we consider a system with three continua. We will present several numerical examples, and they show that our method is able to capture the interaction between matrix continua and discrete fractures on the coarse grid efficiently.

math.NA↗

arXiv2018

Deep Multiscale Model Learning

The objective of this paper is to design novel multi-layer neural network architectures for multiscale simulations of flows taking into account the observed data and physical modeling concepts. Our approaches use deep learning concepts combined with local multiscale model reduction methodologies to predict flow dynamics. Using reduced-order model concepts is important for constructing robust deep learning architectures since the reduced-order models provide fewer degrees of freedom. Flow dynamics can be thought of as multi-layer networks. More precisely, the solution (e.g., pressures and saturations) at the time instant $n+1$ depends on the solution at the time instant $n$ and input parameters, such as permeability fields, forcing terms, and initial conditions. One can regard the solution as a multi-layer network, where each layer, in general, is a nonlinear forward map and the number of layers relates to the internal time steps. We will rely on rigorous model reduction concepts to define unknowns and connections for each layer. In each layer, our reduced-order models will provide a forward map, which will be modified ("trained") using available data. It is critical to use reduced-order models for this purpose, which will identify the regions of influence and the appropriate number of variables. Because of the lack of available data, the training will be supplemented with computational data as needed and the interpolation between data-rich and data-deficient models. We will also use deep learning algorithms to train the elements of the reduced model discrete system. We will present main ingredients of our approach and numerical results. Numerical results show that using deep learning and multiscale models, we can improve the forward models, which are conditioned to the available data.

math.NA↗

arXiv2018

Upscaling method for problems in perforated domains with non-homogeneous boundary conditions on perforations using Non-Local Multi-Continuum method (NLMC)

In this paper, we present an upscaling method for problems in perforated domains with non-homogeneous boundary conditions on perforations. Our methodology is based on the recently developed Non-local multicontinuum method (NLMC). The main ingredient of the method is the construction of suitable local basis functions with the capability of capturing multiscale features and non-local effects. We will construct multiscale basis functions for the coarse regions and additional multiscale basis functions for perforations, with the aim of handling non-homogeneous boundary conditions on perforations. We start with describing our method for the Laplace equation, and then extending the framework for the elasticity problem and parabolic equations. The resulting upscaled model has minimal size and the solution has physical meaning on the coarse grid. We will present numerical results (1) for steady and unsteady problems, (2) for Laplace and Elastic operators, and (3) for Neumann and Robin non-homogeneous boundary conditions on perforations. Numerical results show that the proposed method can provide good accuracy and provide significant reduction on the degrees of freedom.

math.NA↗

arXiv2017

Non-local Multi-continua Upscaling for Flows in Heterogeneous Fractured Media

In this paper, we propose a rigorous and accurate non-local (in the oversampled region) upscaling framework based on some recently developed multiscale methods [10]. Our proposed method consists of identifying multi-continua parameters via local basis functions and constructing non-local (in the oversampled region) transfer and effective properties. To achieve this, we significantly modify our recent work proposed within Generalized Multiscale Finite Element Method (GMsFEM) in [10] and derive appropriate local problems in oversampled regions once we identify important modes representing each continua. We use piecewise constant functions in each fracture network and in the matrix to write an upscaled equation. Thus, the resulting upscaled equation is of minimal size and the unknowns are average pressures in the fractures and the matrix. We note that the use of non-local upscaled model for porous media flows is not new, e.g., in [14], the authors derive non-local approach. Our main contribution is identifying appropriate local problems together with local spectral modes to represent each continua. The model problem for fractures assumes that one can identify fracture networks. The resulting non-local equation (restricted to the oversampling region, which is several times larger compared to the target coarse block) has the same form as \cite{Hamdi_Nonlocal} with much smaller local regions. We present numerical results, which show that the proposed approach can provide good accuracy.

math.NA↗

arXiv2016

A conservative local multiscale model reduction technique for Stokes flows in heterogeneous perforated domains

In this paper, we present a new multiscale model reduction technique for the Stokes flows in heterogeneous perforated domains. The challenge in the numerical simulations of this problem lies in the fact that the solution contains many multiscale features and requires a very fine mesh to resolve all details. In order to efficiently compute the solutions, some model reductions are necessary. To obtain a reduced model, we apply the generalized multiscale finite element approach, which is a framework allowing systematic construction of reduced models. Based on this general framework, we will first construct a local snapshot space, which contains many possible multiscale features of the solution. Using the snapshot space and a local spectral problem, we identify dominant modes in the snapshot space and use them as the multiscale basis functions. Our basis functions are constructed locally with non-overlapping supports, which enhances the sparsity of the resulting linear system. In order to enforce the mass conservation, we propose a hybridized technique, and uses a Lagrange multiplier to achieve mass conservation. We will mathematically analyze the stability and the convergence of the proposed method. In addition, we will present some numerical examples to show the performance of the scheme. We show that, with a few basis functions per coarse region, one can obtain a solution with excellent accuracy.

math.NA↗

arXiv2016

Online Adaptive Local Multiscale Model Reduction for Heterogeneous Problems in Perforated Domains

In this paper, we develop and analyze an adaptive multiscale approach for heterogeneous problems in perforated domains. In many applications, these problems have a multiscale nature arising because of the perforations, their geometries, the sizes of the perforations, and configurations. In this paper, we present a general offline/online procedure, which can adequately and adaptively represent the local degrees of freedom and derive appropriate coarse-grid equations. The main contributions of this paper are (1) the rigorous analysis of the offline approach (2) the development of the online procedures and their analysis (3) the development of adaptive strategies. We present an online procedure, which allows adaptively incorporating global information and is important for a fast convergence when combined with the adaptivity. Our methodology allows adding and guides constructing new online multiscale basis functions adaptively in appropriate regions. We present the convergence analysis of the online adaptive enrichment algorithm for the Stokes system. In particular, we show that the online procedure has a rapid convergence with a rate related to the number of offline basis functions, and one can obtain fast convergence by a sufficient number of offline basis functions, which are computed in the offline stage. To illustrate the performance of our method, we present numerical results with both small and large perforations. We see that only a few (1 or 2) online iterations can significantly improve the offline solution.

math.NA↗