Search NASA⌕ Search

SEARCH · Search NASA

Results for “large scale network”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 217 records · Page 12

FINETUNA: fine-tuning accelerated molecular simulations

Abstract Progress towards the energy breakthroughs needed to combat climate change can be significantly accelerated through the efficient simulation of atomistic systems. However, simulation techniques based on first principles, such as density functional theory (DFT), are limited in their practical use due to their high computational expense. Machine learning approaches have the potential to approximate DFT in a computationally efficient manner, which could dramatically increase the impact of computational simulations on real-world problems. However, they are limited by their accuracy and the cost of generating labeled data. Here, we present an online active learning framework for accelerating the simulation of atomic systems efficiently and accurately by incorporating prior physical information learned by large-scale pre-trained graph neural network models from the Open Catalyst Project. Accelerating these simulations enables useful data to be generated more cheaply, allowing better models to be trained and more atomistic systems to be screened. We also present a method of comparing local optimization techniques on the basis of both their speed and accuracy. Experiments on 30 benchmark adsorbate-catalyst systems show that our method of transfer learning to incorporate prior information from pre-trained models accelerates simulations by reducing the number of DFT calculations by 91%, while meeting an accuracy threshold of 0.02 eV 93% of the time. Finally, we demonstrate a technique for leveraging the interactive functionality built in to Vienna ab initio Simulation Package (VASP) to efficiently compute single point calculations within our online active learning framework without the significant startup costs. This allows VASP to work in tandem with our framework while requiring 75% fewer self-consistent cycles than conventional single point calculations. The online active learning implementation, and examples using the VASP interactive code, are available in the open source FINETUNA package on Github.

97 MATHEMATICS AND COMPUTING↗

Multimodel ensemble predictions of precipitation using bayesian neural networks

Multimodel ensembling improves predictions and considers model uncertainties. In this study, we present a Bayesian Neural Network (BNN) ensemble approach for large-scale precipitation predictions based on a set of climate models. BNN infers spatiotemporally varying model weights and biases through the calibration against observations. This ensemble scheme of BNN sufficiently leverages individual model skill for accurate predictions as well as provides interpretability about which models contribute more to the ensemble prediction at which locations and times to inform model development. Additionally, BNN accurately quantifies epistemic uncertainty to avoid overconfident projections. We demonstrate BNN’s superior prediction performance to three state-of-the-art ensemble approaches and discuss its interpretability and uncertainty quantification.

Fan, Patrick↗

Multimodel Ensemble Predictions of Precipitation using Bayesian Neural Networks

Multimodel ensembling improves predictions and considers model uncertainties. In this study, we present a Bayesian Neural Network (BNN) ensemble approach for large-scale precipitation predictions based on a set of climate models. BNN infers spatiotemporally varying model weights and biases through the calibration against observations. This ensemble scheme of BNN sufficiently leverages individual model skill for accurate predictions as well as provides interpretability about which models contribute more to the ensemble prediction at which locations and times to inform model development. Additionally, BNN accurately quantifies epistemic uncertainty to avoid overconfident projections. We demonstrate BNN’s superior prediction performance to three state-of-the-art ensemble approaches and discuss its interpretability and uncertainty quantification.

Fan, Patrick↗

METABOLIC: high-throughput profiling of microbial genomes for functional traits, metabolism, biogeochemistry, and community-scale functional networks

Background Advances in microbiome science are being driven in large part due to our ability to study and infer microbial ecology from genomes reconstructed from mixed microbial communities using metagenomics and single-cell genomics. Such omics-based techniques allow us to read genomic blueprints of microorganisms, decipher their functional capacities and activities, and reconstruct their roles in biogeochemical processes. Currently available tools for analyses of genomic data can annotate and depict metabolic functions to some extent; however, no standardized approaches are currently available for the comprehensive characterization of metabolic predictions, metabolite exchanges, microbial interactions, and microbial contributions to biogeochemical cycling. Results We present METABOLIC (METabolic And BiogeOchemistry anaLyses In miCrobes), a scalable software to advance microbial ecology and biogeochemistry studies using genomes at the resolution of individual organisms and/or microbial communities. The genome-scale workflow includes annotation of microbial genomes, motif validation of biochemically validated conserved protein residues, metabolic pathway analyses, and calculation of contributions to individual biogeochemical transformations and cycles. The community-scale workflow supplements genome-scale analyses with determination of genome abundance in the microbiome, potential microbial metabolic handoffs and metabolite exchange, reconstruction of functional networks, and determination of microbial contributions to biogeochemical cycles. METABOLIC can take input genomes from isolates, metagenome-assembled genomes, or single-cell genomes. Results are presented in the form of tables for metabolism and a variety of visualizations including biogeochemical cycling potential, representation of sequential metabolic transformations, community-scale microbial functional networks using a newly defined metric “MW-score” (metabolic weight score), and metabolic Sankey diagrams. METABOLIC takes ~ 3 h with 40 CPU threads to process ~ 100 genomes and corresponding metagenomic reads within which the most compute-demanding part of hmmsearch takes ~ 45 min, while it takes ~ 5 h to complete hmmsearch for ~ 3600 genomes. Tests of accuracy, robustness, and consistency suggest METABOLIC provides better performance compared to other software and online servers. To highlight the utility and versatility of METABOLIC, we demonstrate its capabilities on diverse metagenomic datasets from the marine subsurface, terrestrial subsurface, meadow soil, deep sea, freshwater lakes, wastewater, and the human gut. Conclusion METABOLIC enables the consistent and reproducible study of microbial community ecology and biogeochemistry using a foundation of genome-informed microbial metabolism, and will advance the integration of uncultivated organisms into metabolic and biogeochemical models. METABOLIC is written in Perl and R and is freely available under GPLv3 at https://github.com/AnantharamanLab/METABOLIC.

59 BASIC BIOLOGICAL SCIENCES↗

Holistic Small-Signal Stability Analysis for Large-Scale Inverter-Intensive Power Systems with Coupled and Full-Order Dynamics from Control Systems and Power Networks

The increasing penetration of inverter-based resources (IBRs) into the existing power systems introduces tremendous benefits for enhanced sustainability but also poses inevitable challenges in terms of insufficient inertia, potential instability, and complex network dynamics, among others. However, the additional coupling introduced by the interactions among gridfollowing (GFL) and grid-forming (GFM) IBRs and the other components (i.e., synchronous generators [SGs], loads, and network, etc.) has not been clearly explored. A holistic, scalable, and quantitative stability analysis framework with the control systems and power networks is still missing. Here, in this paper, to fill in the technical gaps, a holistic small-signal model of the entire system with both rotating generation units and IBRs is established. An extended power flow model with operation dynamics from both generator control schemes and power networks is proposed to provide the varying steady-state operating points for small-signal modeling. The proposed method is compared with MATLAB solvers, and the results show that the proposed approach has a minimum calculation time, which can be less than 12 seconds for a large-scale power system with up to 2,000 buses. Furthermore, a quantitative method is developed to identify the impacts of IBRs on system performance with emphases on the potential stability issues with GFL IBRs, additional benefits of employing GFM IBRs, the feasibility of replacing SGs with GFM IBRs, and the impact of penetration level of different kinds of generation units. Finally, a field island power system is used to verify the proposed approach, and hardware-in-the-loop (HIL) tests are provided to further demonstrate the effectiveness of the proposed analysis.

14 SOLAR ENERGY↗

Graph network heterogeneity predicts interplant wake losses

Wind plants generate large-scale wakes, which can affect the performance of neighboring installations. Such wakes are challenging to estimate due to the inherent complexity in modeling wake interactions between large quantities of turbines at various distances. Weighted directed graph networks can inform complex models by linking turbine pairs into chains of upstream and downstream neighbors for a given wind direction. A novel interpretation of the graph network adjacency matrix is proposed where each element of the matrix represents the cumulative impact of upstream turbines on an individual. In this study, wake losses were estimated with an engineering wake model across a range of inflow conditions for nine parametric variations of a system containing two neighboring wind plants. The parametric nature of the study isolates turbine spacing within the plant, separation distance between plants, and wind direction as the main drivers of wake losses. Spatial heterogeneity is computed from the weighted average adjacency matrix of each plant arrangement. The proposed method is orders of magnitude faster than wake modeling and does not require detailed turbine information or atmospheric conditions. Furthermore, the weighted average adjacency matrix provides insight on the spatial organization of wake losses at various scales. Plant heterogeneity is correlated with wake losses within and among plants. Framing wind plant wake interaction in terms of graph network spatial heterogeneity provides an efficient approach for predicting wake losses within and among neighboring wind plants with applications to other complex systems where wake interactions are key factor.

17 WIND ENERGY↗

FedCSpc: A Cross-Silo Federated Learning System With Error-Bounded Lossy Parameter Compression

Cross-Silo federated learning is widely used for scaling deep neural network (DNN) training over data silos from different locations worldwide while guaranteeing data privacy. Communication has been identified as the main bottleneck when training large-scale models due to large-volume model parameters and gradient transmission across public networks with limited bandwidth. Most previous works focus on gradient compression, while limited work tries to compress parameters that can not be ignored and extremely affect communication performance during the training. Here, to bridge this gap, we propose FedCSpc: an efficient cross-silo federated learning system with an XAI-driven adaptive parameter compression strategy for large-scale model training. Our work substantially differs from existing gradient compression techniques due to the distinct data features of gradient and parameter. The key contributions of this paper are fourfold. (1) Our designed FedCSpc proposes to compress the parameter during the training using the state-of-the-art error-bounded lossy compressor – SZ3. (2) We develop an adaptive compression error bound adjustment algorithm to guarantee the model accuracy effectively. (3) We exploit an efficient approach to utilize the idle CPU resources of clients to compress the parameters. (4) We perform a comprehensive evaluation with a wide range of models and benchmarks on a GPU cluster with 65 GPUs. Results show that FedCSpc can achieve the same model accuracy as FedAvg while reducing the data volume of parameters and gradients in communication by up to 7.39× and 288×, respectively. With 32 clients on a 4 Gb size model, FedCSpc significantly outperforms FedAvg in wall-clock time in the emulated WAN environment (at the bandwidth of 1 Gbps or lower without loss of generality).

SZ3↗

Data for: A Synoptic System for Capturing Ecosystem Control Points Across Terrestrial-Aquatic Interfaces

The investigation of how climate change and water level fluctuations impact variable and interconnected ecosystems, like the interfaces between terrestrial and aquatic environments, requires the collection and integration of many data types. We describe an integrative and autonomous environmental monitoring approach that uses environmental sensors and data loggers to monitor surface water, groundwater, soil, and vegetation changes and generate essential data for predictive models. We established the network at seven sites along the Chesapeake Bay and Lake Erie coastlines, including a large-scale flood manipulation experiment, collectively generating over three million observations per month. Such sensor networks hold great promise for tracking and comprehending environmental changes where land and water intersect. The sensor system and overall approach to sensor management that we have designed is intended to be widely accessible for research teams spanning in size from an individual investigator to large multi-institution projects. This dataset shows example data generated by the sensor network described above. Data output for data loggers connected to groundwater water quality sondes measuring dissolved oxygen, pH, oxidative redox potential (ORP), groundwater elevation, groundwater salinity and temperature, and groundwater elevation; replicate soil moisture and conductivity probes installed at 10 and 30 cm below the ground surface; rainfall and solar radiation; and mean sap flow from 8 replicate probes. Sensors are installed at upland forest (UP), wetlands (W), and transitional locations between these ecosystems (TR). Example datasets are from Goodwin Islands in the Chesapeake Bay and Portage River along the Lake Erie coastline.

54 ENVIRONMENTAL SCIENCES↗

Overcoming the Technical Challenges of Coordinating Distributed Load Resources at Scale (Final Report)

Significant recent research has investigated the potential for loads to provide balancing services to the grid. However, this research has not addressed key issues that may arise when such schemes are applied at scale including: 1. Distribution Network Issues. Coordination of large numbers of loads could result in power flows that violate distribution network constraints; 2. Stability Issues. Certain strategies to control loads can exhibit nonlinearity in the form of period-adding bifurcations and chaos. Other control strategies can potentially synchronize the behavior of large numbers of loads. In both cases, the outcome can be power oscillations and instability; 3. Communication Network Issues. Bidirectional low-latency communication channels between a central controller (or several distributed controllers) and each resource are expensive and likely not necessary for effective coordination. Our research questions were: What network, stability, and communication issues might arise in practice when we coordinate large aggregations of loads? How can we coordinate loads to achieve performance objectives in a cost effective manner while avoiding these issues? The ultimate technical goal of the project was the development of network-aware, communication-constrained, non-disruptive load control strategies with stability guarantees that achieve the performance requirements of typical balancing services at a sufficiently low cost to enable the load aggregator and customer to profit. The overall goal was to establish credibility for load control at scale and contribute to U.S. energy security and environmental goals. The team succeeded in answering these research questions and developing these control strategies. The overall approach was based on the development of three testing environments: a simulation testbed, an experimental testbed (20 physical model houses with window-box air conditioners) coupled with the simulation testbed, and a field testbed (100 actual homes in Austin, TX) coupled with the simulation testbed, which enabled controller testing, identification of issues, controller development, and controller validation. The resulting controller was used to demonstrate fast timescale grid balancing (frequency regulation) by aggregations of physical and virtual air conditioners, with sufficient quality to participate in the electricity market. Cost benefit analysis showed overall benefits to the participating households, load aggregators, and the grid, especially if the control technology was integrated directly into existing programmable communicating thermostats. The project provides a variety of wider benefits. Our technology transfer and outreach activities lead us to choose an open-source licensing commercialization pathway, enabling the project results to be available to researchers, industry, and the public. Furthermore, new grid balancing technologies will increase grid flexibility and will enable higher penetrations of intermittent renewable energy resources, such as wind and solar, to be connected to the grid, reducing its environmental impact, and mitigating climate change to the benefit of society.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Robust neural network-enhanced estimation of local primordial non-Gaussianity

When applied to the nonlinear matter distribution of the universe, neural networks have been shown to be very statistically sensitive probes of cosmological parameters, such as the linear perturbation amplitude σ 8 . However, when used as a “black box,” neural networks are not robust to baryonic uncertainty. We propose a robust architecture for constraining primordial non-Gaussianity f NL , by training a neural network to locally estimate σ 8 , and correlating these local estimates with the large-scale density field. We apply our method to N-body simulations, and show that σ⁡(f NL ) is 3.5 times better than the constraint obtained from a standard halo-based approach. Finally, we show that our method has the same robustness property as large-scale halo bias: baryonic physics can change the normalization of the estimated f NL , but cannot change whether f NL is detected.

79 ASTRONOMY AND ASTROPHYSICS↗

KETCHUP: Parameterizing of large-scale kinetic models using multiple datasets with different reference states

Large-scale kinetic models provide the computational means to dynamically link metabolic reaction fluxes to metabolite concentrations and enzyme levels while also conforming to substrate level regulation. However, the development of broadly applicable frameworks for efficiently and robustly parameterizing models remains a challenge. Challenges arise due to both the heterogeneity, paucity, and difficulty in obtaining flux and/or concentration data but also due to the computational difficulties of the underlying parameter identification problem. Both the computational demands for parameterization, degeneracy of obtained parameter solutions and interpretability of results has so far limited widespread adoption of large-scale kinetic models despite their potential. Herein, we introduce the Kinetic Estimation Tool Capturing Heterogeneous Datasets Using Pyomo (KETCHUP), a flexible parameter estimation tool that leverages a primal-dual interior-point algorithm to solve a nonlinear programming (NLP) problem that identifies a set of parameters capable of recapitulating the (non)steady-state fluxes and concentrations in wild-type and perturbed metabolic networks. KETCHUP is benchmarked against previously parameterized large-scale kinetic models demonstrating an at least an order of magnitude faster convergence than the tool K-FIT while at the same time attaining better data fits. Finally, this versatile toolbox accepts different kinetic descriptions, metabolic fluxes, enzyme levels and metabolite concentrations, under either steady-state or instationary conditions to enable robust kinetic model construction and parameterization. KETCHUP supports the SBML format and can be accessed at https://github.com/maranasgroup/KETCHUP.

59 BASIC BIOLOGICAL SCIENCES↗

Tuning successive linear programming to solve AC optimal power flow problem for large networks

Successive linear programming (SLP) is a practical approach for solving large-scale nonlinear optimization problems. Alternating current optimal power flow (ACOPF) is no exception, particularly the large size of real-world networks. However, in order to achieve tractability, it is essential to tune the SLP algorithm presented in the literature. This paper presents a modified SLP algorithm to solve the ACOPF problem, specified by the U.S. Department of Energy’s (DOE) Grid Optimization (GO) Competition Challenge 1, within strict time limits. The algorithm first finds a near-optimal solution for the relaxed problem (i.e., Stage 1). Then, it finds a feasible solution in the proximity of the near-optimal solution (i.e., Stage 2 and Stage 3). The numerical experiments on test cases ranging from 500-bus to 30,000-bus systems show that the algorithm is tractable. Here the results show that our proposed algorithm is tractable and can solve more than 80% of test cases faster than the well-known Interior Point Method while significantly reduce the number of iterations required to solve ACOPF. The number of iterations is considered an important factor in the examination of tractability which can drastically reduce the computational time required within each iteration.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Learning local equivariant representations for large-scale atomistic dynamics

Abstract A simultaneously accurate and computationally efficient parametrization of the potential energy surface of molecules and materials is a long-standing goal in the natural sciences. While atom-centered message passing neural networks (MPNNs) have shown remarkable accuracy, their information propagation has limited the accessible length-scales. Local methods, conversely, scale to large simulations but have suffered from inferior accuracy. This work introduces Allegro, a strictly local equivariant deep neural network interatomic potential architecture that simultaneously exhibits excellent accuracy and scalability. Allegro represents a many-body potential using iterated tensor products of learned equivariant representations without atom-centered message passing. Allegro obtains improvements over state-of-the-art methods on QM9 and revMD17. A single tensor product layer outperforms existing deep MPNNs and transformers on QM9. Furthermore, Allegro displays remarkable generalization to out-of-distribution data. Molecular simulations using Allegro recover structural and kinetic properties of an amorphous electrolyte in excellent agreement with ab-initio simulations. Finally, we demonstrate parallelization with a simulation of 100 million atoms.

74 ATOMIC AND MOLECULAR PHYSICS↗

Generating Massive Scale-free Networks: Novel Parallel Algorithms using the Preferential Attachment Model

Recently, there has been substantial interest in the study of various random networks as mathematical models of complex systems. As real-life complex systems grow larger, the ability to generate progressively large random networks becomes all the more important. This motivates the need for efficient parallel algorithms for generating such networks. Naïve parallelization of sequential algorithms for generating random networks is inefficient due to inherent dependencies among the edges and the possibility of creating duplicate (parallel) edges. In this article, we present message passing interface-based distributed memory parallel algorithms for generating random scale-free networks using the preferential-attachment model. Our algorithms are experimentally verified to scale very well to a large number of processing elements (PEs), providing near-linear speedups. The algorithms have been exercised with regard to scale and speed to generate scale-free networks with one trillion edges in 6 minutes using 1,000 PEs.

97 MATHEMATICS AND COMPUTING↗

Critical values of cyber parameters in a dynamic microgrid system

An islanded microgrid can be used to serve critcal load as a resiliency source when a severe outage occurs. In an islanded mode, control of a microgrid relies on the communication system significantly. Hence, microgrids are cyberphysical systems and, therefore, the cyber system plays a crucial role in the performance of the cyber-power system. A microgrid control scheme is proposed for power dispatch and regulation based on the droop and proportional-integral (PI) feedback control. The proposed control strategy is validated for transient stability following dynamic events. To evaluate the impact of a networked control system on control performance, a cyber model is developed to represent data acquisition periods and communication delays. An analytical method is proposed to determine the critical values for the data reporting periods and communication delays. The analytical method based on a state space model of a networked control system is applicable for large-scale systems. A 2-dimensional stability region of a microgrid in the space of cyber parameters can be obtained by the proposed method, and the critical values of cyber parameters are determined based on the stability region. Simulation results validate that the design of a microgrid as a cyber-physical system needs to be guided by critical values for the data reporting period and communication delay to prevent system instability.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Cyber-physical cascading failure and resilience of power grid: A comprehensive review

Smart grid technologies are based on the integration of the cyber network and the power grid into a cyber-physical power system (CPPS). The increasing cyber-physical interdependencies bring about tremendous opportunities for the modeling, monitoring, control, and protection of power grids, but also create new types of vulnerabilities and failure mechanisms threatening the reliability and resiliency of system operation. A major concern regarding the interdependent networks is the cascading failure (CF), where a small initial disturbance/failure in the network results in a seemingly unexpected large-scale failure. Although there has been a significant volume of recent work in the CF research of CPPS, a comprehensive review remains unavailable. This article aims to fill the gap by providing a systematic literature survey regarding the modeling, analysis, and mitigation of CF in CPPS. The open research questions for further research are also discussed. This article allows researchers to easily understand the state of the art of CF research in CPPS and fosters future work required towards full resolutions to the remaining questions and challenges.

24 POWER TRANSMISSION AND DISTRIBUTION↗

ExaSGD: 2022 Kernel Thrust Activities

The Kernel Thrust milestone ADSE22-407 covers the development of device-capable optimization algorithms and solvers technologies required by the ExaSGD project’s software stack in order to solve security-constrained alternating current optimal power flow (SC-ACOPF) problems on emerging exascale architectures. To this extent, in FY22 the main objective of the Kernel Thrust was (i) provide sparse optimization solver that runs efficiently on hardware accelerator devices (i.e., NVIDIA and AMD GPUs) to perform intra-node computations, (ii) strengthen the reliability and increase the performance of the mixed-dense sparse (MDS) solver of HiOp for deployment on the FY22 target architectures, Summit and Crusher, and (iii) increase performance by improving the mathematical algorithm and refining the parallel MPI-based implementation of the coarse-grain parallel solver HiOp-PriDec for capabilities deployment on the FY22 target architectures, Summit and Crusher. This document presents the developments and contributions done by the Kernels Thrust Team in FY22 toward completion of the above-mentioned objectives. These contributions progressed along four main development (sub)thrusts: (1) Design and implementation of a sparse optimization solver for use on hardware accelerators; (2) Improvement of the mathematical algorithm and of the parallel implementation of HiOp-PriDec to ensure readiness and efficient coarse-grain parallelism for FY23 target exascale machine; and (3) Support Software and Application Development Thrusts of the exaSGD project in their deployment of the project’s software stack on AMD- and NVIDIA-based architectures. The development of the sparse optimization solver (thrust 1 above) was new in FY22 and resulted in a new sparse solver in HiOp (available as of version 0.6). The second development thrust was a continuation of the efforts from FY21 and improved the mathematical algorithm and the communication strategy of the HiOp-PriDec solver. The last developement thrust is a large collaborative effort. Namely, the project’s teams from multiple labs (LLNL, PNNL, ORNL, and NREL) performed large-scale demonstration of the ExaSGD software stack, namely the optimization solvers of HiOp interfaced with the modeling front-end ExaGO and the stochastic sampler PowerScenarios. These demonstration efforts solved large-scale instances of the SC-ACOPF challenge problem of medium network sizes (10, 000-bus system) and large number of contingencies on Summit (NVIDIA accelerators) and Crusher (AMD accelerators) systems at ORNL.

97 MATHEMATICS AND COMPUTING↗

Accurate Compression of Tabulated Chemistry Models with Partition of Unity Networks

Tabulated chemistry models are widely used to simulate large-scale turbulent fires in applications including energy generation and fire safety. Tabulation via piecewise Cartesian interpolation suffers from the curse-of-dimensionality, leading to a prohibitive exponential growth in parameters and memory usage as more dimensions are considered. Artificial neural networks (ANNs) have attracted attention for constructing surrogates for chemistry models due to their ability to perform high-dimensional approximation. However, due to well-known pathologies regarding the realization of suboptimal local minima during training, in practice they do not converge and provide unreliable accuracy. Partition of unity networks (POUnets) are a recently introduced family of ANNs which preserve notions of convergence while performing high-dimensional approximation, discovering a mesh-free partition of space which may be used to perform optimal polynomial approximation. In this work, we assess their performance with respect to accuracy and model complexity in reconstructing unstructured flamelet data representative of nonadiabatic pool fire models. Our results show that POUnets can provide the desirable accuracy of classical spline-based interpolants with the low memory footprint of traditional ANNs while converging faster to significantly lower errors than ANNs. For example, we observe POUnets obtaining target accuracies in two dimensions with 40 to 50 times less memory and roughly double the compression in three dimensions. We also address the practical matter of efficiently training accurate POUnets by studying convergence over key hyperparameters, the impact of partition/basis formulation, and the sensitivity to initialization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗