SEARCH · Search NASA

Results for “Performance Optimized Space Networks”

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.

SourceResearch connectionFrom yearThrough year

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

At least 109 records · Page 6

All sources NASA NTRS DOE OSTI

DOE OSTI2025

An implementation of neural simulation-based inference for parameter estimation in ATLAS

Neural simulation-based inference (NSBI) is a powerful class of machine-learning-based methods for statistical inference that naturally handles high-dimensional parameter estimation without the need to bin data into low-dimensional summary histograms. Such methods are promising for a range of measurements, including at the Large Hadron Collider, where no single observable may be optimal to scan over the entire theoretical phase space under consideration, or where binning data into histograms could result in a loss of sensitivity. This work develops a NSBI framework for statistical inference, using neural networks to estimate probability density ratios, which enables the application to a full-scale analysis. It incorporates a large number of systematic uncertainties, quantifies the uncertainty due to the finite number of events in training samples, develops a method to construct confidence intervals, and demonstrates a series of intermediate diagnostic checks that can be performed to validate the robustness of the method. As an example, the power and feasibility of the method are assessed on simulated data for a simplified version of an off-shell Higgs boson couplings measurement in the four-lepton final states. This approach represents an extension to the standard statistical methodology used by the experiments at the Large Hadron Collider, and can benefit many physics analyses.

frequentist statistics↗

DOE OSTI2024

Automatic Extraction of Network Configurations for Realistic Simulation and Validation

Popular HPC network interconnection simulators such as SST Macro provide a variety of configurable parameters to explore the design space of hardware components such as network links and switches. While such knobs provide flexibility to explore design trade-offs for novel hardware, manually configuring simulations for existing hardware to focus on topology exploration can be cumbersome and error-prone, leading to widely inaccurate simulations. This challenge is compounded when specifications of various (proprietary) technologies are not readily available or are intentionally omitted. In this work, we provide a methodology to automatically tune the simulation configuration of the multiple network models running within SST Macro using Bayesian optimization. We perform this optimization in the context of multiple messaging regimes (i.e., small to large and latency to bandwidth-bound messages) and provide a detailed analysis of the simulation error for four systems. With our automated framework, we achieve a 5x improvement in accuracy over best-effort configurations based on available hardware specifications.

Suetterlein, Joshua D.↗

DOE OSTI2017

On Efficient Deployment of Wireless Sensors for Coverage and Connectivity in Constrained 3D Space

Sensor networks have been used in a rapidly increasing number of applications in many fields. This work generalizes a sensor deployment problem to place a minimum set of wireless sensors at candidate locations in constrained 3D space to k-cover a given set of target objects. By exhausting the combinations of discreteness/continuousness constraints on either sensor locations or target objects, we formulate four classes of sensor deployment problems in 3D space: deploy sensors at Discrete/Continuous Locations (D/CL) to cover Discrete/Continuous Targets (D/CT). We begin with the design of an approximate algorithm for DLDT and then reduce DLCT, CLDT, and CLCT to DLDT by discretizing continuous sensor locations or target objects into a set of divisions without sacrificing sensing precision. Furthermore, we consider a connected version of each problem where the deployed sensors must form a connected network, and design an approximation algorithm to minimize the number of deployed sensors with connectivity guarantee. For performance comparison, we design and implement an optimal solution and a genetic algorithm (GA)-based approach. Extensive simulation results show that the proposed deployment algorithms consistently outperform the GA-based heuristic and achieve a close-to-optimal performance in small-scale problem instances and a significantly superior overall performance than the theoretical upper bound.

47 OTHER INSTRUMENTATION↗

DOE OSTI2018

OPTIMIZATION OF FAST FISSION GAS RELEASE MODEL PARAMETERS USING MACHINE LEARNING ACCELERATED EVOLUTIONARY ALGORITHMS

Fission gas release models used in FRAPCON and FAST are based on equations that describe the physical transport phenomena that control release from the fuel pellet to the rod void volume of fission gas produced during irradiation. Although these models are physically based, many of the parameters that control the release such as the impact of burnup on diffusion and bubble formation and saturation are critical to the accurate prediction of fission gas release, but cannot be measured in any quantitative way. To overcome this problem, these parameters have been empirically derived to provide a best fit to the available data that includes rod puncture data and electron probe microanalysis (EMPA) and X-ray fluorescence (XRF) data of radial location of residual gas within the pellet. In general, a heuristic approach for deriving these parameters via practical implementation of expert analyses on just a few dependent variables has been shown to perform quite well in most situations. In this paper, we present an approach for applying machine learning to expedite model development. This approach is based on developing a deep artificial neural network which describes FRAPCON’s fission gas release models, and optimizes parameters by a differential evaluation algorithm. This approach allows us to quickly and accurately tune physical models based on expert judgment, and works as a human-in-the-loop approach, to assist the modeler in identifying and addressing regions of high uncertainty in a multi-parameter space. Results of the updated fission gas release model will be shown for all the FAST assessment data.

Johns, Jesse M.↗

DOE OSTI2015

Status Report on the Water-Based NSTF RCCS Capability: Preparations and Design for the Transformation of the Natural Convection Shutdown Heat Removal Test Facility (NSTF) From Air to Water-based Cooling

The following report provides an overview of the current status of the water-based transformation, including details of the design, geometry, and fabrication of the test section and network piping, for the ½ scale water-based NSTF program at Argonne National Laboratory. In early FY2015, efforts towards a water-based design began in parallel with on-going air-based work, and began by identifying top level objectives of the transformation. Scaling studies and preparation tasks with computational modeling were carried out to guide the design decisions, minimize distortions, and ensure relevant data among scales. This entailed close collaboration with AREVA, whose water-based RCCS (included as part of their 625 MWt SC-HTGR) served as the primary design basis for incorporation into the NSTF. A literature review of previous works was made, with an emphasis placed on similar facilities, relevance to passive decay heat removal, and details pertaining to two-phase flow and measurement techniques. The study focused on input from key designers and a thermal analysis of existing cooling panels (e.g. at TAMU and UW-Madison) and two proposed AREVA cooling panels. A base case was used as a reference point for parametric studies of effects from varying tube spacing (pitch), tube diameter, fin thickness, and materials. Then, a structural analysis was performed to ensure safe material stresses during high temperature operation. Details of the pipe network geometry and guidelines for design of the water storage tank are finally presented, followed by engineering drawings in the appendix. The results of this study have identified a suitable configuration to support both the ANL/DOE project goals and the DOE vision to provide AREVA with data suitable for characterizing the RCCS of their full scale HTGR design. The dimensions were not selected for optimal RCCS performance, but instead to serve as a representative yet bounding configuration for future implementation into a full scale design. Scaling distortions are unavoidable; however, they can be accurately predicted based on earlier works of derived similarity solutions. Flexibility remained a primary design philosophy, and will allow the test facility to easily accommodate future alterations. The final design for the test section and network piping is as follows: riser tubes: 1.5” Schedule 160, 5.91” (150-mm) pitch, 304L stainless, heat transfer panels: 5/16” plates, 4.01” (102-mm) width, full penetration weld to risers, 304L stainless, split into 4 panels per riser separated by horizontal 1/8” gaps, test section: Eight (x8) riser tubes and nine (x9) heat transfer panels, fabricated into banks of two (x2) riser tubes and three (x3) fins, joined to form single section, and network geometry: 4.0” Schedule 40, 304L stainless. Details of the water storage tank will reflect competing effects such as thermal hydraulic phenomena during single and two-phase operation. These considerations include mixing during single-phase jet penetration, condensation of rising bubbles during two-phase discharge, bubble entrainment into the liquid outlet, and liquid carry-over into the steam outlet.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2019

MaLTESE: Large-Scale Simulation-Driven Machine Learning for Transient Driving Cycles

Optimal engine operation during a transient driving cycle is the key to achieving greater fuel economy, engine efficiency, and reduced emissions. In order to achieve continuously optimal engine operation, engine calibration methods use a combination of static correlations obtained from dynamometer tests for steady-state operating points and road and/or track performance data. As the parameter space of control variables, design variable constraints, and objective functions increases, the cost and duration for optimal calibration become prohibitively large. In order to reduce the number of dynamometer tests required for calibrating modern engines, a large-scale simulation-driven machine learning approach is presented in this work. A parallel, fast, robust, physics-based reduced-order engine simulator is used to obtain performance and emission characteristics of engines over a wide range of control parameters under various transient driving conditions (drive cycles). We scale the simulation up to 3,906 nodes of the Theta supercomputer at the Argonne Leadership Computing Facility to generate data required to train a machine learning model. The trained model is then used to predict various engine parameters of interest, and the results are compared with those predicted by the engine simulator. Our results show that a deepneural-network-based surrogate model achieves high accuracy: Pearson product-moment correlation values larger than 0.99 and mean absolute percentage error within 1.07% for various engine parameters such as exhaust temperature, exhaust pressure, nitric oxide, and engine torque. Once trained, the deep-neural-network-based surrogate model is fast for inference: it requires about 16 mu s for predicting the engine performance and emissions for a single design configuration compared with about 0.5 s per configuration with the engine simulator. Moreover, we demonstrate that transfer learning and retraining can be leveraged to incrementally retrain the surrogate model to cope with new configurations that fall outside the training data space.

deep learning↗

DOE OSTI2025

Advancing Multiscale Simulation of Plasma-Surface Interfaces

We report the development of an atomistic-informed, surface-state-dependent predictive model for particle exchange in a carbon-tungsten plasma-surface interface. The predictive model uses machine learning (ML) techniques to learn the energy and angular distributions for particle exchange and rate functions for surface state evolution from molecular dynamics simulations of cumulative bombardment of tungsten by energetic carbon ions. Each predictive component is sensitive to the energy and trajectory of incident plasma species and the surface state. The surface state is represented by a set of surface state descriptors, which were derived from the atomistic surface state for each independent carbon bombardment event. These descriptors are representative of the composition and degree of amorphization of the outermost angstrom of surface material and were chosen to optimize predictive performance for particle exchange at the interface. The distributions for particle exchange (reflection/sputtering) are demonstrated to vary with each surface state descriptor, motivating the development of surface-state-dependent particle exchange models for plasma simulations. The performance of various ML methods was compared, including polynomial quantile regression, artificial neural networks, k-nearest neighbors, and random forest algorithms, with polynomial regression performing the best for interpolation and extrapolation of learned relationships. In addition to the particle exchange model, a neutral network was developed and used to identify data sufficiency throughout surface descriptor space, which will enable real-time feedback during future data production to ensure data is produced where it is most needed, and we provide commentary on improvements to the data production workflow for future endeavors.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2019

Learning nonlinear level sets for dimensionality reduction in function approximation

We developed a Nonlinear Level-set Learning (NLL) method for dimensionality reduction in high-dimensional function approximation with small data. This work is motivated by a variety of design tasks in real-world engineering applications, where practitioners would replace their computationally intensive physical models (e.g., high-resolution fluid simulators) with fast-to-evaluate predictive machine learning models, so as to accelerate the engineering design processes. There are two major challenges in constructing such predictive models: (a) high-dimensional inputs (e.g., many independent design parameters) and (b) small training data, generated by running extremely time-consuming simulations. Thus, reducing the input dimension is critical to alleviate the over-fitting issue caused by data insufficiency. Existing methods, including sliced inverse regression and active subspace approaches, reduce the input dimension by learning a linear coordinate transformation; our main contribution is to extend the transformation approach to a nonlinear regime. Specifically, we exploit reversible networks (RevNets) to learn nonlinear level sets of a high-dimensional function and parameterize its level sets in low-dimensional spaces. A new loss function was designed to utilize samples of the target functions' gradient to encourage the transformed function to be sensitive to only a few transformed coordinates. The NLL approach is demonstrated by applying it to three 2D functions and two 20D functions for showing the improved approximation accuracy with the use of nonlinear transformation, as well as to an 8D composite material design problem for optimizing the buckling-resistance performance of composite shells of rocket inter-stages.

Zhang, Guannan↗

DOE OSTI2025

AI‐Driven Defect Engineering for Advanced Thermoelectric Materials

Thermoelectric materials offer a promising pathway to directly convert waste heat to electricity. However, achieving high performance remains challenging due to intrinsic trade-offs between electrical conductivity, the Seebeck coefficient, and thermal conductivity, which are further complicated by the presence of defects. This review explores how artificial intelligence (AI) and machine learning (ML) are transforming thermoelectric materials design. Advanced ML approaches including deep neural networks, graph-based models, and transformer architectures, integrated with high-throughput simulations and growing databases, effectively capture structure-property relationships in a complex multiscale defect space and overcome the “curse of dimensionality”. This review discusses AI-enhanced defect engineering strategies such as composition optimization, entropy and dislocation engineering, and grain boundary design, along with emerging inverse design techniques for generating materials with targeted properties. Finally, it outlines future opportunities in novel physics mechanisms and sustainability, highlighting the critical role of AI in accelerating the discovery of thermoelectric materials.

36 MATERIALS SCIENCE↗

DOE OSTI2018

Minimizing Energy Consumption from Connected Signalized Intersections by Reinforcement Learning

Explicit energy minimization objectives are often discouraged in signal optimization algorithms due to its negative impact on mobility performance. One potential direction to solve this problem is to provide a balanced objective function to achieve desired mobility with minimized energy consumption. This research developed a reinforcement learning (RL) based control with reward functions considering energy and mobility in a joint manner-a penalty function is introduced for number of stops. Further, we proposed a clustering-based technique to make the state-space finite which is critical for a tractable implementation of the RL algorithm. We implemented the algorithm in a calibrated NG-SIM network within a traffic micro-simulator-PTV VISSIM. With sole focus on energy, we report 47% reduction in energy consumption when compared with existing signal control schemes, however causing a 65.6% increase in system travel time. In contrast, the control strategy focusing on energy minimization with penalty for stops yields 6.7% reduction in energy consumption with 27% increase in system travel time. The developed RL algorithm with a flexible penalty function in the reward will achieve desired energy goals for a network of signalized intersections without compromising on the mobility performance.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2022

Systematic quark/gluon identification with ratios of likelihoods

Discriminating between quark- and gluon-initiated jets has long been a central focus of jet substructure, leading to the introduction of numerous observables and calculations to high perturbative accuracy. At the same time, there have been many attempts to fully exploit the jet radiation pattern using tools from statistics and machine learning. We propose a new approach that combines a deep analytic understanding of jet substructure with the optimality promised by machine learning and statistics. After specifying an approximation to the full emission phase space, we show how to construct the optimal observable for a given classification task. This procedure is demonstrated for the case of quark and gluons jets, where we show how to systematically capture sub-eikonal corrections in the splitting functions, and prove that linear combinations of weighted multiplicity is the optimal observable. In addition to providing a new and powerful framework for systematically improving jet substructure observables, we demonstrate the performance of several quark versus gluon jet tagging observables in parton-level Monte Carlo simulations, and find that they perform at or near the level of a deep neural network classifier. Combined with the rapid recent progress in the development of higher order parton showers, we believe that our approach provides a basis for systematically exploiting subleading effects in jet substructure analyses at the Large Hadron Collider (LHC) and beyond.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2022

Automatic Generation of High-Performance Convolution Kernels on ARM CPUs for Deep Learning

In this work, we present FastConv, a template-based code auto-generation open source library that can automatically generate high-performance deep learning convolution kernels of arbitrary matrices/tensors shapes. FastConv is based on the Winograd algorithm, which is reportedly the highest performing algorithm for the time-consuming convolution layers of convolutional neural networks. ARM CPUs cover a wide range designs and specifications, from embedded devices to HPC-grade CPUs. The leads to the dilemma of how to consistently optimize Winograd-based convolution solvers for convolution layers of different shapes. FastConv addresses this problem by using templates to auto-generate multiple shapes of tuned kernels variants suitable for skinny tall matrices. As a performance portable library, FastConv transparently searches for the best combination of kernel shapes, cache tiles, scheduling of loop orders, packing strategies, access patterns, and online/offline computations. Auto-tuning is used to search the parameter configuration space for the best performance for a given target architecture and problem size. The experiments with layer-wise evaluation on the VGG--16 model confirms a 1.25x performance gains is got by tuning the Winograd library. Integrated comparison results shows 1.02x to 1.40x, 1.14x to 2.17x, and 1.22x and 2.48x speedup is achieved over NNPACK, Arm NN, and FeatherCNN on the Kunpeng 920 beside few cases. Furthermore, problem size performance portability experiments with various convolution shapes shows that FastConv achieves 1.2x to 1.7x speedup and 2x to 22x speedup over NNPACK and ARM NN inference engine using Winograd on Kunpeng 920 . CPU performance portability evaluation on the VGG--16 show an average speedup over NNPACK of 1.42x, 1.21x, 1.26x, 1.37x, 2.26x, and 11.02x is observed on Kunpeng 920, Snapdragon 835, 855, 888, Apple M1, and AWS Graviton2, respectively.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2017

Synthesis Study on Transitions in Signal Infrastructure and Control Algorithms for Connected and Automated Transportation

Documenting existing state of practice is an initial step in developing future control infrastructure to be co-deployed for heterogeneous mix of connected and automated vehicles with human drivers while leveraging benefits to safety, congestion, and energy. With advances in information technology and extensive deployment of connected and automated vehicle technology anticipated over the coming decades, cities globally are making efforts to plan and prepare for these transitions. CAVs not only offer opportunities to improve transportation systems through enhanced safety and efficient operations of vehicles. There are also significant needs in terms of exploring how best to leverage vehicle-to-vehicle (V2V) technology, vehicle-to-infrastructure (V2I) technology and vehicle-to-everything (V2X) technology. Both Connected Vehicle (CV) and Connected and Automated Vehicle (CAV) paradigms feature bi-directional connectivity and share similar applications in terms of signal control algorithm and infrastructure implementation. The discussion in our synthesis study assumes the CAV/CV context where connectivity exists with or without automated vehicles. Our synthesis study explores the current state of signal control algorithms and infrastructure, reports the completed and newly proposed CV/CAV deployment studies regarding signal control schemes, reviews the deployment costs for CAV/AV signal infrastructure, and concludes with a discussion on the opportunities such as detector free signal control schemes and dynamic performance management for intersections, and challenges such as dependency on market adaptation and the need to build a fault-tolerant signal system deployment in a CAV/CV environment. The study will serve as an initial critical assessment of existing signal control infrastructure (devices, control instruments, and firmware) and control schemes (actuated, adaptive, and coordinated-green wave). Also, the report will help to identify the future needs for the signal infrastructure to act as the nervous system for urban transportation networks, providing not only signaling, but also observability, surveillance, and measurement capacity. The discussion of the opportunities space includes network optimization and control theory perspectives, and the current states of observability for key system parameters (what can be detected, how frequently can it be reported) as well as controllability of dynamic parameters (this includes adjusting not only the signal phase and timing, but also the ability to alter vehicle trajectories through information or direct control). The perspective of observability and controllability of the dynamic systems provides an appropriate lens to discuss future directions as CAV/CV become more prevalent in the future.

33 ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2024

Role of depth in optical diffractive neural networks

Free-space all-optical diffractive neural networks have emerged as promising systems for neuromorphic scene classification. Understanding the fundamental properties of these systems is important to establish their ultimate performance. Here we consider the case of diffraction by subwavelength apertures and study the behavior of the system as a function of the number of diffractive layers by employing a co-design modeling approach. We show that adding depth allows the system to achieve high classification accuracies with a reduced number of diffractive features compared to a single layer, but that it does not allow the system to surpass the performance of an optimized single layer. The improvement from depth is found to be limited to the first few layers. These properties originate from the constraints imposed by the physics of light, in particular the weakening electric field with distance from the aperture.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

RandONets: Shallow networks with random projections for learning linear and nonlinear operators

Deep neural networks have been extensively used for the solution of both the forward and the inverse problem for dynamical systems. However, their implementation necessitates optimizing a high-dimensional space of parameters and hyperparameters. This fact, along with the requirement of substantial computational resources, pose a barrier to achieving high numerical accuracy, but also interpretability. Here, to address the above challenges, we present Random Projection-based Operator Networks (RandONets): shallow networks with random projections and tailor-made numerical analysis methods that learn accurately and fast linear and nonlinear operators. Building on previous works, we prove that RandOnets are universal approximators of linear and nonlinear operators. Due to their simplicity, RandONets provide a one-step transformation of the input space, facilitating interpretability. For the evaluation of their performance, we focus on operators of PDEs. We show, that RandONets outperform by several orders of magnitude, both in terms of numerical approximation accuracy and computational cost, the “vanilla” DeepONets. Hence, we believe that our method will trigger further developments in the field of scientific machine learning, for the development of new ‘’light”schemes that will provide high accuracy while reducing dramatically the computational cost. A MATLAB toolbox for RandONets, including demos, is available on GitHub at https://github.com/GianlucaFabiani/RandONets.

Interpretable machine learning↗

DOE OSTI2013

Exploring Hardware Support For Scaling Irregular Applications on Multi-node Multi-core Architectures

With the recent emergence of large-scale knowledge dis- covery, data mining and social network analysis, irregular applications have gained renewed interest. Classic cache-based high-performance architectures do not provide optimal performances with such kind of workloads, mainly due to the very low spatial and temporal locality of the irregular control and memory access patterns. In this paper, we present a multi-node, multi-core, fine-grained multi-threaded shared-memory system architecture specifically designed for the execution of large-scale irregular applications, and built on top of three pillars, that we believe are fundamental to support these workloads. First, we offer transparent hardware support for Partitioned Global Address Space (PGAS) to provide a large globally-shared address space with no software library overhead. Second, we employ multi-threaded multi-core processing nodes to achieve the necessary latency tolerance required by accessing global memory, which potentially resides in a remote node. Finally, we devise hardware support for inter-thread synchronization on the whole global address space. We first model the performances by using an analytical model that takes into account the main architecture and application characteristics. We describe the hardware design of the proposed cus- tom architectural building blocks that provide support for the above- mentioned three pillars. Finally, we present a limited-scale evaluation of the system on a multi-board FPGA prototype with typical irregular kernels and benchmarks. The experimental evaluation demonstrates the architecture performance scalability for different configurations of the whole system.

FPGA↗

DOE OSTI2023

Quantitative Representativeness and Constituency of the Long-Term Agroecosystem Research Network and Analysis of Complementarity with Existing Ecological Networks

Abstract Studies conducted at sites across ecological research networks usually strive to scale their results to larger areas, trying to reach conclusions that are valid throughout larger enclosing regions. Network representativeness and constituency can show how well conditions at sampling locations represent conditions also found elsewhere and can be used to help scale-up results over larger regions. Multivariate statistical methods have been used to design networks and select sites that optimize regional representation, thereby maximizing the value of datasets and research. However, in networks created from already established sites, an immediate challenge is to understand how well existing sites represent the range of environments in the whole area of interest. We performed an analysis to show how well sites in the USDA Long-Term Agroecosystem Research (LTAR) Network represent all agricultural working lands within the conterminous United States (CONUS). Our analysis of 18 LTAR sites, based on 15 climatic and edaphic characteristics, produced maps of representativeness and constituency. Representativeness of the LTAR sites was quantified through an exhaustive pairwise Euclidean distance calculation in multivariate space, between the locations of experiments within each LTAR site and every 1 km cell across the CONUS. Network representativeness is from the perspective of all CONUS locations, but we also considered the perspective from each LTAR site. For every LTAR site, we identified the region that is best represented by that particular site—its constituency—as the set of 1 km grid locations best represented by the environmental drivers at that particular LTAR site. Representativeness shows how well the combination of characteristics at each CONUS location was represented by the LTAR sites’ environments, while constituency shows which LTAR site was the closest match for each location. LTAR representativeness was good across most of the CONUS. Representativeness for croplands was higher than for grazinglands, probably because croplands have more specific environmental criteria. Constituencies resemble ecoregions but have their environmental conditions “centered” on those at particular existing LTAR sites. Constituency of LTAR sites can be used to prioritize the locations of experimental research at or even within particular sites, or to identify the extents that can likely be included when generalizing knowledge across larger regions of the CONUS. Sites with a large constituency have generalist environments, while those with smaller constituency areas have more specialized environmental combinations. These “specialist” sites are the best representatives for smaller, more unusual areas. The potential of sharing complementary sites from the Long-Term Ecological Research (LTER) Network and the National Ecological Observatory Network (NEON) to boost representativeness was also explored. LTAR network representativeness would benefit from borrowing several NEON sites and the Sevilleta LTER site. Later network additions must include such specialist sites that are targeted to represent unique missing environments. While this analysis exhaustively considered principal environmental characteristics related to production on working lands, we did not consider the focal agronomic systems under study, or their socio-economic context.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2024

Semi-supervised Learning of Dynamical Systems with Neural Ordinary Differential Equations: A Teacher-Student Model Approach

Modeling dynamical systems is crucial for a wide range of tasks, but it remains challenging due to complex nonlinear dynamics, limited observations, or lack of prior knowledge. Recently, data-driven approaches such as Neural Ordinary Differential Equations (NODE) have shown promising results by leveraging the expressive power of neural networks to model unknown dynamics. However, these approaches often suffer from limited labeled training data, leading to poor generalization and suboptimal predictions. On the other hand, semi-supervised algorithms can utilize abundant unlabeled data and have demonstrated good performance in classification and regression tasks. We propose TS-NODE, the first semi-supervised approach to modeling dynamical systems with NODE. TS-NODE explores cheaply generated synthetic pseudo rollouts to broaden exploration in the state space and to tackle the challenges brought by lack of ground-truth system data under a teacher-student model. TS-NODE employs an unified optimization framework that corrects the teacher model based on the student's feedback while mitigating the potential false system dynamics present in pseudo rollouts. TS-NODE demonstrates significant performance improvements over a baseline Neural ODE model on multiple dynamical system modeling tasks.

Wang, Yu↗