arXiv subjects

Zhi Zhou

Publications and source records attributed to Zhi Zhou.

At least 109 records · Page 6Linked to original sources

arXiv2024

High-order BDF convolution quadrature for stochastic fractional evolution equations driven by integrated additive noise

The numerical analysis of stochastic time fractional evolution equations presents considerable challenges due to the limited regularity of the model caused by the nonlocal operator and the presence of noise. The existing time-stepping methods exhibit a significantly low order convergence rate. In this work, we introduce a smoothing technique and develop the novel high-order schemes for solving the linear stochastic fractional evolution equations driven by integrated additive noise. Our approach involves regularizing the additive noise through an $m$-fold integral-differential calculus, and discretizing the equation using the $k$-step BDF convolution quadrature. This novel method, which we refer to as the ID$m$-BDF$k$ method, is able to achieve higher-order convergence in solving the stochastic models. Our theoretical analysis reveals that the convergence rate of the ID$2$-BDF2 method is $O(τ^{α+ γ-1/2})$ for $1< α+ γ\leq 5/2$, and $O(τ^{2})$ for $5/2< α+ γ<3$, where $α\in (1, 2)$ and $γ\in (0, 1)$ denote the time fractional order and the order of the integrated noise, respectively. Furthermore, this convergence rate could be improved to $O(τ^{α+ γ-1/2})$ for any $α\in (1, 2)$ and $γ\in (0, 1)$, if we employ the ID$3$-BDF3 method. The argument could be easily extended to the subdiffusion model with $α\in (0, 1)$. Numerical examples are provided to support and complement the theoretical findings.

math.NA↗

arXiv2023

Conductivity Imaging from Internal Measurements with Mixed Least-Squares Deep Neural Networks

In this work we develop a novel approach using deep neural networks to reconstruct the conductivity distribution in elliptic problems from one measurement of the solution over the whole domain. The approach is based on a mixed reformulation of the governing equation and utilizes the standard least-squares objective, with deep neural networks as ansatz functions to approximate the conductivity and flux simultaneously. We provide a thorough analysis of the deep neural network approximations of the conductivity for both continuous and empirical losses, including rigorous error estimates that are explicit in terms of the noise level, various penalty parameters and neural network architectural parameters (depth, width and parameter bound). We also provide multiple numerical experiments in two- and multi-dimensions to illustrate distinct features of the approach, e.g., excellent stability with respect to data noise and capability of solving high-dimensional problems.

math.NA↗

arXiv2023

Numerical Recovery of a Time-Dependent Potential in Subdiffusion

In this work we investigate an inverse problem of recovering a time-dependent potential in a semilinear subdiffusion model from an integral measurement of the solution over the domain. The model involves the Djrbashian--Caputo fractional derivative in time. Theoretically, we prove a novel conditional Lipschitz stability result, and numerically, we develop an easy-to-implement fixed point iteration for recovering the unknown coefficient. In addition, we establish rigorous error bounds on the discrete approximation. These results are obtained by crucially using smoothing properties of the solution operators and suitable choice of a weighted $L^p(0,T)$ norm. The efficiency and accuracy of the scheme are showcased on several numerical experiments in one- and two-dimensions.

math.NA↗

arXiv2023

Ray computational ghost imaging based on rotational modulation method

The CGI (CGI) has the potential of low cost, low dose, and high resolution, which is very attractive for the development of radiation imaging field. However, many sub-coding plates must be used in the modulation process, which greatly affects the development of CGI technology. In order to reduce the coding plates, we refer to the rotation method of computed tomography (CT), then propose a novel CGI method based on rotational modulation method of a single-column striped coding plate. This method utilizes the spatial variation of a single sub-coding plate (rotation) to realize multiple modulation of the ray field and improves the utilization rate of a single sub-coding plate. However, for this rotation scheme of CGI, the traditional binary modulation matrix is no longer applicable. To obtain the system matrix of the rotated striped coding plate, an area model based on beam boundaries is established. Subsequently, numerical and Monte Carlo simulations were conducted. The results reveal that our scheme enables high-quality imaging of N*N resolution objects using only N sub-coding plates, under both full-sampling and under-sampling scenarios. Moreover, our scheme demonstrates superiority over the Hadamard scheme in both imaging quality and the number of required sub-coding plates, whether in scenarios of full-sampling or under-sampling. Finally, an α ray imaging platform was established to further demonstrate the feasibility of the rotational modulation method. By employing our scheme, a mere 8 sub-coding plates were employed to achieve CGI of the radiation source intensity distribution, achieving a resolution of 8*8. Therefore, the novel ray CGI based on rotational modulation method can achieve high-quality imaging effect with fewer sub-coding plates, which has important practical value and research significance for promoting single-pixel radiation imaging technology.

physics.med-ph↗

arXiv2023

Electrical Impedance Tomography with Deep Calderón Method

Electrical impedance tomography (EIT) is a noninvasive medical imaging modality utilizing the current-density/voltage data measured on the surface of the subject. Calderón's method is a relatively recent EIT imaging algorithm that is non-iterative, fast, and capable of reconstructing complex-valued electric impedances. However, due to the regularization via low-pass filtering and linearization, the reconstructed images suffer from severe blurring and under-estimation of the exact conductivity values. In this work, we develop an enhanced version of Calderón's method, using {deep} convolution neural networks (i.e., U-net) {as an effective targeted post-processing step, and term the resulting method by deep Calderón's method.} Specifically, we learn a U-net to postprocess the EIT images generated by Calderón's method so as to have better resolutions and more accurate estimates of conductivity values. We simulate chest configurations with which we generate the current-density/voltage boundary measurements and the corresponding reconstructed images by Calderón's method. With the paired training data, we learn the deep neural network and evaluate its performance on real tank measurement data. The experimental results indicate that the proposed approach indeed provides a fast and direct (complex-valued) impedance tomography imaging technique, and substantially improves the capability of the standard Calderón's method.

math.NA↗

arXiv2023

DYNAMITE: Dynamic Interplay of Mini-Batch Size and Aggregation Frequency for Federated Learning with Static and Streaming Dataset

Federated Learning (FL) is a distributed learning paradigm that can coordinate heterogeneous edge devices to perform model training without sharing private data. While prior works have focused on analyzing FL convergence with respect to hyperparameters like batch size and aggregation frequency, the joint effects of adjusting these parameters on model performance, training time, and resource consumption have been overlooked, especially when facing dynamic data streams and network characteristics. This paper introduces novel analytical models and optimization algorithms that leverage the interplay between batch size and aggregation frequency to navigate the trade-offs among convergence, cost, and completion time for dynamic FL training. We establish a new convergence bound for training error considering heterogeneous datasets across devices and derive closed-form solutions for co-optimized batch size and aggregation frequency that are consistent across all devices. Additionally, we design an efficient algorithm for assigning different batch configurations across devices, improving model accuracy and addressing the heterogeneity of both data and system characteristics. Further, we propose an adaptive control algorithm that dynamically estimates network states, efficiently samples appropriate data batches, and effectively adjusts batch sizes and aggregation frequency on the fly. Extensive experiments demonstrate the superiority of our offline optimal solutions and online adaptive algorithm.

cs.LG↗

arXiv2023

BeeFlow: Behavior Tree-based Serverless Workflow Modeling and Scheduling for Resource-Constrained Edge Clusters

Serverless computing has gained popularity in edge computing due to its flexible features, including the pay-per-use pricing model, auto-scaling capabilities, and multi-tenancy support. Complex Serverless-based applications typically rely on Serverless workflows (also known as Serverless function orchestration) to express task execution logic, and numerous application- and system-level optimization techniques have been developed for Serverless workflow scheduling. However, there has been limited exploration of optimizing Serverless workflow scheduling in edge computing systems, particularly in high-density, resource-constrained environments such as system-on-chip clusters and single-board-computer clusters. In this work, we discover that existing Serverless workflow scheduling techniques typically assume models with limited expressiveness and cause significant resource contention. To address these issues, we propose modeling Serverless workflows using behavior trees, a novel and fundamentally different approach from existing directed-acyclic-graph- and state machine-based models. Behavior tree-based modeling allows for easy analysis without compromising workflow expressiveness. We further present observations derived from the inherent tree structure of behavior trees for contention-free function collections and awareness of exact and empirical concurrent function invocations. Based on these observations, we introduce BeeFlow, a behavior tree-based Serverless workflow system tailored for resource-constrained edge clusters. Experimental results demonstrate that BeeFlow achieves up to 3.2X speedup in a high-density, resource-constrained edge testbed and 2.5X speedup in a high-profile cloud testbed, compared with the state-of-the-art.

cs.DC↗

arXiv2023

Numerical Reconstruction of Diffusion and Potential Coefficients from Two Observations: Decoupled Recovery and Error Estimates

The focus of this paper is on the concurrent reconstruction of both the diffusion and potential coefficients present in an elliptic/parabolic equation, utilizing two internal measurements of the solutions. A decoupled algorithm is constructed to sequentially recover these two parameters. In the first step, we implement a straightforward reformulation that results in a standard problem of identifying the diffusion coefficient. This coefficient is then numerically recovered, with no requirement for knowledge of the potential, by utilizing an output least-square method coupled with finite element discretization. In the second step, the previously recovered diffusion coefficient is employed to reconstruct the potential coefficient, applying a method similar to the first step. Our approach is stimulated by a constructive conditional stability, and we provide rigorous a priori error estimates in $L^2(Ω)$ for the recovered diffusion and potential coefficients. Our approach is stimulated by a constructive conditional stability, and we provide rigorous a priori error estimates in $L^2(Ω)$ for the recovered diffusion and potential coefficients. To derive these estimates, we develop a weighted energy argument and suitable positivity conditions. These estimates offer a beneficial guide for choosing regularization parameters and discretization mesh sizes, in accordance with the noise level. Some numerical experiments are presented to demonstrate the accuracy of the numerical scheme and support our theoretical results.

math.NA↗

arXiv2023

High-order splitting finite element methods for the subdiffusion equation with limited smoothing property

In contrast with the diffusion equation which smoothens the initial data to $C^\infty$ for $t>0$ (away from the corners/edges of the domain), the subdiffusion equation only exhibits limited spatial regularity. As a result, one generally cannot expect high-order accuracy in space in solving the subdiffusion equation with nonsmooth initial data. In this paper, a new splitting of the solution is constructed for high-order finite element approximations to the subdiffusion equation with nonsmooth initial data. The method is constructed by splitting the solution into two parts, i.e., a time-dependent smooth part and a time-independent nonsmooth part, and then approximating the two parts via different strategies. The time-dependent smooth part is approximated by using high-order finite element method in space and convolution quadrature in time, while the steady nonsmooth part could be approximated by using smaller mesh size or other methods that could yield high-order accuracy. Several examples are presented to show how to accurately approximate the steady nonsmooth part, including piecewise smooth initial data, Dirac--Delta point initial data, and Dirac measure concentrated on an interface. The argument could be directly extended to subdiffusion equations with nonsmooth source data. Extensive numerical experiments are presented to support the theoretical analysis and to illustrate the performance of the proposed high-order splitting finite element methods.

math.NA↗

arXiv2023

Recovery of Multiple Parameters in Subdiffusion from One Lateral Boundary Measurement

This work is concerned with numerically recovering multiple parameters simultaneously in the subdiffusion model from one single lateral measurement on a part of the boundary, while in an incompletely known medium. We prove that the boundary measurement corresponding to a fairly general boundary excitation uniquely determines the order of the fractional derivative and the polygonal support of the diffusion coefficient, without knowing either the initial condition or the source. The uniqueness analysis further inspires the development of a robust numerical algorithm for recovering the fractional order and diffusion coefficient. The proposed algorithm combines small-time asymptotic expansion, analytic continuation of the solution and the level set method. We present extensive numerical experiments to illustrate the feasibility of the simultaneous recovery. In addition, we discuss the uniqueness of recovering general diffusion and potential coefficients from one single partial boundary measurement, when the boundary excitation is more specialized.

math.NA↗

arXiv2023

Serving Graph Neural Networks With Distributed Fog Servers For Smart IoT Services

Graph Neural Networks (GNNs) have gained growing interest in miscellaneous applications owing to their outstanding ability in extracting latent representation on graph structures. To render GNN-based service for IoT-driven smart applications, traditional model serving paradigms usually resort to the cloud by fully uploading geo-distributed input data to remote datacenters. However, our empirical measurements reveal the significant communication overhead of such cloud-based serving and highlight the profound potential in applying the emerging fog computing. To maximize the architectural benefits brought by fog computing, in this paper, we present Fograph, a novel distributed real-time GNN inference framework that leverages diverse and dynamic resources of multiple fog nodes in proximity to IoT data sources. By introducing heterogeneity-aware execution planning and GNN-specific compression techniques, Fograph tailors its design to well accommodate the unique characteristics of GNN serving in fog environments. Prototype-based evaluation and case study demonstrate that Fograph significantly outperforms the state-of-the-art cloud serving and fog deployment by up to 5.39x execution speedup and 6.84x throughput improvement.

cs.DC↗

arXiv2023

LAMDA-SSL: Semi-Supervised Learning in Python

LAMDA-SSL is open-sourced on GitHub and its detailed usage documentation is available at https://ygzwqzd.github.io/LAMDA-SSL/. This documentation introduces LAMDA-SSL in detail from various aspects and can be divided into four parts. The first part introduces the design idea, features and functions of LAMDA-SSL. The second part shows the usage of LAMDA-SSL by abundant examples in detail. The third part introduces all algorithms implemented by LAMDA-SSL to help users quickly understand and choose SSL algorithms. The fourth part shows the APIs of LAMDA-SSL. This detailed documentation greatly reduces the cost of familiarizing users with LAMDA-SSL toolkit and SSL algorithms.

cs.LG↗

arXiv2023

Towards Carbon-Neutral Edge Computing: Greening Edge AI by Harnessing Spot and Future Carbon Markets

Provisioning dynamic machine learning (ML) inference as a service for artificial intelligence (AI) applications of edge devices faces many challenges, including the trade-off among accuracy loss, carbon emission, and unknown future costs. Besides, many governments are launching carbon emission rights (CER) for operators to reduce carbon emissions further to reverse climate change. Facing these challenges, to achieve carbon-aware ML task offloading under limited carbon emission rights thus to achieve green edge AI, we establish a joint ML task offloading and CER purchasing problem, intending to minimize the accuracy loss under the long-term time-averaged cost budget of purchasing the required CER. However, considering the uncertainty of the resource prices, the CER purchasing prices, the carbon intensity of sites, and ML tasks' arrivals, it is hard to decide the optimal policy online over a long-running period time. To overcome this difficulty, we leverage the two-timescale Lyapunov optimization technique, of which the $T$-slot drift-plus-penalty methodology inspires us to propose an online algorithm that purchases CER in multiple timescales (on-preserved in carbon future market and on-demanded in the carbon spot market) and makes decisions about where to offload ML tasks. Considering the NP-hardness of the $T$-slot problems, we further propose the resource-restricted randomized dependent rounding algorithm to help to gain the near-optimal solution with no help of any future information. Our theoretical analysis and extensive simulation results driven by the real carbon intensity trace show the superior performance of the proposed algorithms.

cs.LG↗

arXiv2023

Solving Elliptic Problems with Singular Sources using Singularity Splitting Deep Ritz Method

In this work, we develop an efficient solver based on neural networks for second-order elliptic equations with variable coefficients and singular sources. This class of problems covers general point sources, line sources and the combination of point-line sources, and has a broad range of practical applications. The proposed approach is based on decomposing the true solution into a singular part that is known analytically using the fundamental solution of the Laplace equation and a regular part that satisfies a suitable modified elliptic PDE with a smoother source, and then solving for the regular part using the deep Ritz method. A path-following strategy is suggested to select the penalty parameter for enforcing the Dirichlet boundary condition. Extensive numerical experiments in two- and multi-dimensional spaces with point sources, line sources or their combinations are presented to illustrate the efficiency of the proposed approach, and a comparative study with several existing approaches based on neural networks is also given, which shows clearly its competitiveness for the specific class of problems. In addition, we briefly discuss the error analysis of the approach.

math.NA↗

arXiv2023

Hybrid Neural-Network FEM Approximation of Diffusion Coefficient in Elliptic and Parabolic Problems

In this work we investigate the numerical identification of the diffusion coefficient in elliptic and parabolic problems using neural networks. The numerical scheme is based on the standard output least-squares formulation where the Galerkin finite element method (FEM) is employed to approximate the state and neural networks (NNs) act as a smoothness prior to approximate the unknown diffusion coefficient. A projection operation is applied to the NN approximation in order to preserve the physical box constraint on the unknown coefficient. The hybrid approach enjoys both rigorous mathematical foundation of the FEM and inductive bias / approximation properties of NNs. We derive \textsl{a priori} error estimates in the standard $L^2(Ω)$ norm for the numerical reconstruction, under a positivity condition which can be verified for a large class of problem data. The error bounds depend explicitly on the noise level, regularization parameter and discretization parameters (e.g., spatial mesh size, time step size, and depth, upper bound and number of nonzero parameters of NNs). We also provide extensive numerical experiments, indicating that the hybrid method is very robust for large noise when compared with the pure FEM approximation.

math.NA↗

arXiv2023

HiFlash: Communication-Efficient Hierarchical Federated Learning with Adaptive Staleness Control and Heterogeneity-aware Client-Edge Association

Federated learning (FL) is a promising paradigm that enables collaboratively learning a shared model across massive clients while keeping the training data locally. However, for many existing FL systems, clients need to frequently exchange model parameters of large data size with the remote cloud server directly via wide-area networks (WAN), leading to significant communication overhead and long transmission time. To mitigate the communication bottleneck, we resort to the hierarchical federated learning paradigm of HiFL, which reaps the benefits of mobile edge computing and combines synchronous client-edge model aggregation and asynchronous edge-cloud model aggregation together to greatly reduce the traffic volumes of WAN transmissions. Specifically, we first analyze the convergence bound of HiFL theoretically and identify the key controllable factors for model performance improvement. We then advocate an enhanced design of HiFlash by innovatively integrating deep reinforcement learning based adaptive staleness control and heterogeneity-aware client-edge association strategy to boost the system efficiency and mitigate the staleness effect without compromising model accuracy. Extensive experiments corroborate the superior performance of HiFlash in model accuracy, communication reduction, and system efficiency.

cs.NI↗

arXiv2022

Nonlocal diffusion models with consistent local and fractional limits

For some spatially nonlocal diffusion models with a finite range of nonlocal interactions measured by a positive parameter $δ$, we review their formulation defined on a bounded domain subject to various conditions that correspond to some inhomogeneous data. We consider their consistency to similar inhomogeneous boundary value problems of classical partial differential equation (PDE) models as the nonlocal interaction kernel gets localized in the local $δ\to 0$ limit, and at the same time, for rescaled fractional type kernels, to corresponding inhomogeneous nonlocal boundary value problems of fractional equations in the global $δ\to \infty$ limit. Such discussions help to delineate issues related to nonlocal problems defined on a bounded domain with inhomogeneous data.

math.AP↗

arXiv2022

Convergence Rate Analysis of Galerkin Approximation of Inverse Potential Problem

In this work we analyze the inverse problem of recovering the space-dependent potential coefficient in an elliptic / parabolic problem from distributed observation. We establish novel (weighted) conditional stability estimates under very mild conditions on the problem data. Then we provide an error analysis of a standard reconstruction scheme based on the standard output least-squares formulation with Tikhonov regularization (by an $H^1$-seminorm penalty), which is then discretized by the Galerkin finite element method with continuous piecewise linear finite elements in space (and also backward Euler method in time for parabolic problems). We present a detailed analysis of the discrete scheme, and provide convergence rates in a weighted $L^2(Ω)$ for discrete approximations with respect to the exact potential. The error bounds are explicitly dependent on the noise level, regularization parameter and discretization parameter(s). Under suitable conditions, we also derive error estimates in the standard $L^2(Ω)$ and interior $L^2$ norms. The analysis employs sharp a priori error estimates and nonstandard test functions. Several numerical experiments are given to complement the theoretical analysis.

math.NA↗