Digital health technologies (DHT), such as wearable devices, provide personalized, continuous, and real-time monitoring of patient. These technologies are contributing to the development of novel therapies and personalized medicine. Gaining insight from these technologies requires appropriate modeling techniques to capture clinically-relevant changes in disease state. The data generated from these devices is characterized by being stochastic in nature, may have missing elements, and exhibits considerable inter-individual variability - thereby making it difficult to analyze using traditional longitudinal modeling techniques. We present a novel pharmacology-informed neural stochastic differential equation (SDE) model capable of addressing these challenges. Using synthetic data, we demonstrate that our approach is effective in identifying treatment effects and learning causal relationships from stochastic data, thereby enabling counterfactual simulation.
We present a scalable strategy for development of mesh-free hybrid neuro-symbolic partial differential equation solvers based on existing mesh-based numerical discretization methods. Particularly, this strategy can be used to efficiently train neural network surrogate models of partial differential equations by (i) leveraging the accuracy and convergence properties of advanced numerical methods, solvers, and preconditioners, as well as (ii) better scalability to higher order PDEs by strictly limiting optimization to first order automatic differentiation. The presented neural bootstrapping method (hereby dubbed NBM) is based on evaluation of the finite discretization residuals of the PDE system obtained on implicit Cartesian cells centered on a set of random collocation points with respect to trainable parameters of the neural network. Importantly, the conservation laws and symmetries present in the bootstrapped finite discretization equations inform the neural network about solution regularities within local neighborhoods of training points. We apply NBM to the important class of elliptic problems with jump conditions across irregular interfaces in three spatial dimensions. We show the method is convergent such that model accuracy improves by increasing number of collocation points in the domain and predonditioning the residuals. We show NBM is competitive in terms of memory and training speed with other PINN-type frameworks. The algorithms presented here are implemented using \texttt{JAX} in a software package named \texttt{JAX-DIPS} (https://github.com/JAX-DIPS/JAX-DIPS), standing for differentiable interfacial PDE solver. We open sourced \texttt{JAX-DIPS} to facilitate research into use of differentiable algorithms for developing hybrid PDE solvers.
We present a highly scalable strategy for developing mesh-free neuro-symbolic partial differential equation solvers from existing numerical discretizations found in scientific computing. This strategy is unique in that it can be used to efficiently train neural network surrogate models for the solution functions and the differential operators, while retaining the accuracy and convergence properties of state-of-the-art numerical solvers. This neural bootstrapping method is based on minimizing residuals of discretized differential systems on a set of random collocation points with respect to the trainable parameters of the neural network, achieving unprecedented resolution and optimal scaling for solving physical and biological systems.
We propose a novel composite framework to find unknown fields in the context of inverse problems for partial differential equations (PDEs). We blend the high expressibility of deep neural networks as universal function estimators with the accuracy and reliability of existing numerical algorithms for partial differential equations as custom layers in semantic autoencoders. Our design brings together techniques of computational mathematics, machine learning and pattern recognition under one umbrella to incorporate domain-specific knowledge and physical constraints to discover the underlying hidden fields. The network is explicitly aware of the governing physics through a hard-coded PDE solver layer in contrast to most existing methods that incorporate the governing equations in the loss function or rely on trainable convolutional layers to discover proper discretizations from data. This subsequently focuses the computational load to only the discovery of the hidden fields and therefore is more data efficient. We call this architecture Blended inverse-PDE networks (hereby dubbed BiPDE networks) and demonstrate its applicability for recovering the variable diffusion coefficient in Poisson problems in one and two spatial dimensions, as well as the diffusion coefficient in the time-dependent and nonlinear Burgers' equation in one dimension. We also show that the learned hidden parameters are robust to added noise on input data. (C) 2021 Elsevier Inc. All rights reserved.
We present a theoretical framework to model the electric response of cell aggregates. We establish a coarse representation for each cell as a combination of membrane and cytoplasm dipole moments. Then we compute the effective conductivity of the resulting system, and thereafter derive a Fokker-Planck partial differential equation that captures the time-dependent evolution of the distribution of induced cellular polarizations in an ensemble of cells. Our model predicts that the polarization density parallel to an applied pulse follows a skewed t-distribution, while the transverse polarization density follows a symmetric t-distribution, which are in accordance with our direct numerical simulations. Furthermore, we report a reduced order model described by a coupled pair of ordinary differential equations that reproduces the average and the variance of induced dipole moments in the aggregate. We extend our proposed formulation by considering fractional order time derivatives that we find necessary to explain anomalous relaxation phenomena observed in experiments as well as our direct numerical simulations. Owing to its time-domain formulation, our framework can be easily used to consider nonlinear membrane effects or intercellular couplings that arise in several scientific, medical and technological applications.
In this chapter, following the previous one, we briefly present the modern approach to real-space renormalization group (RG) theory based on tensor network formulations which was developed during the last two decades. The aim of this sequel is to suggest a novel framework based on tensor networks in order to find the fixed points of complex systems via coarse-graining. The main result of RG is that it provides a systematic way to study the collective dynamics of a large ensemble of elements that interact according to a complex underlying network topology. RG explicitly seeks the fixed points of the complex system in the space of interactions and unravels the universality class of the complex system as well as calculates a plethora of important observables. We hope that tensor networks can particularly pave the way for better understanding of the sustainable interdependent networks (Amini et al., Sustainable interdependent networks: from theory to application, 2018) through proposing efficient computational strategies and discovering insightful features of the network behaviors.
Complex networks are composed of nodes (entities) and edges (connections) with any arbitrary topology. There may also exist multiple types of interactions among these nodes and each node may admit different states in each of its interactions with its neighbors. Understanding complex networks dwells on understanding their structure and function. However, current representations model nodes as single-state entities that are connected to each other differently and treat their dynamics separately with some differential equations. Alternatively, a unified framework might be accessible using the tensor network representation that is already utilized in physics communities. In a sequel of chapters we introduce tensor network representation and renormalization as an alternative framework to explore the universal behaviors of complex systems. We hope that tensor networks can particularly pave the way for better understanding of the sustainable interdependent networks (Amini et al., Sustainable interdependent networks: from theory to application, 2018) through proposing efficient computational strategies and discovering insightful features of the network behaviors.