Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “random 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.

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

At least 289 records · Page 16

Scalable algorithms for physics-informed neural and graph networks

Physics-informed machine learning (PIML) has emerged as a promising new approach for simulating complex physical and biological systems that are governed by complex multiscale processes for which some data are also available. In some instances, the objective is to discover part of the hidden physics from the available data, and PIML has been shown to be particularly effective for such problems for which conventional methods may fail. Unlike commercial machine learning where training of deep neural networks requires big data, in PIML big data are not available. Instead, we can train such networks from additional information obtained by employing the physical laws and evaluating them at random points in the space–time domain. Such PIML integrates multimodality and multifidelity data with mathematical models, and implements them using neural networks or graph networks. Here, we review some of the prevailing trends in embedding physics into machine learning, using physics-informed neural networks (PINNs) based primarily on feed-forward neural networks and automatic differentiation. For more complex systems or systems of systems and unstructured data, graph neural networks (GNNs) present some distinct advantages, and here we review how physics-informed learning can be accomplished with GNNs based on graph exterior calculus to construct differential operators; we refer to these architectures as physics-informed graph networks (PIGNs). We present representative examples for both forward and inverse problems and discuss what advances are needed to scale up PINNs, PIGNs and more broadly GNNs for large-scale engineering problems.

42 ENGINEERING↗

Source Analysis of Ozone Pollution in Liaoyuan City’s Atmosphere Based on Machine Learning Models and HYSPLIT Clustering Method

Firstly, this study investigates the spatiotemporal distribution characteristics of the ozone (O 3 ) pollution in Liaoyuan City using monitoring data from 2015 to 2024. Then, three machine learning models (ML)—random forest (RF), support vector machine (SVM), and artificial neural network (ANN)—are employed to quantify the influence of meteorological and non-meteorological factors on O 3 concentrations. Finally, the HYSPLIT clustering method and CMAQ model are utilized to analyze inter-regional transport characteristics, identifying the causes of O 3 pollution. The results indicate that O 3 pollution in Liaoyuan exhibits a distinct seasonal pattern, with the highest concentrations found in spring and summer, peaking in the afternoon. Among the three ML models, the random forest model demonstrates the best predictive performance (R 2 = 0.9043). Feature importance identifies NO 2 as the primary driving factor, followed by meteorological conditions in the second quarter and land surface characteristics. Furthermore, regional transport significantly contributes to O 3 pollution, with approximately 80% of air mass trajectories in heavily polluted episodes originating from adjacent industrial areas and the sea. The combined effects of transboundary precursors and O 3 transport with local emissions and meteorological conditions further increase the O 3 pollution level. This study highlights the need to strengthen coordinated NO X and VOCs emission reductions and enhance regional joint prevention and control strategies in China.

HYSPLIT clustering↗

Growing grasses in unprofitable areas of US Midwest croplands could increase species richness

The US has large potential to grow perennial energy crops, but because these crops are rarely grown in current agricultural landscapes, it is unclear how biodiversity may be affected. Over time, as agriculture has increased, many grassland species have declined. In addition, not all agricultural land is profitable for growing annual crops. Unprofitable areas were responsible for a loss of approximately $110 million USD per year from 2013 to 2016. Based on this, we want to know how converting less-profitable portions of agricultural fields to switchgrass, a native prairie grass, would influence species occurrence. To address this question, we developed an alternative landscape in which clustered corn/soy acres with a low return on investment (ROI) were replaced with grassland. We also developed and validated species distribution models to predict changes in species occurrence for 28 avian species in Iowa in response to landscape management. Furthermore, we compared results for three different models: Random forest (RF), Stochastic gradient boosting (GBM), and Neural network (Nnet) and found that all models performed well and predicted similar species distribution. Predicted species richness increased by 3.66% (RF), 2.79% (GBM), and 7.51% (Nnet) when we simulated a change in management for ~3% of Iowa's low ROI corn/soybean areas to grassland. If harvested, these areas could generate approximately 7.6 million dry tons/year of switchgrass for bioenergy, thereby increasing farmers earnings. Unprofitable areas tended to occur along streams, which suggest that incorporating partially harvested riparian buffers can benefit avian biodiversity, while improving water quality and reducing unnecessary costs for farmers.

59 BASIC BIOLOGICAL SCIENCES↗

Parallel sorting algorithm classification: is manual instrumentation necessary?

Understanding parallel algorithms is crucial for accelerating scientific simulations on complex, distributed memory, high-performance computers. Modern algorithm classification approaches learn semantics directly from source code to differentiate between algorithms, however, accessing source code is not always possible. We can learn about parallel algorithms from observing their performance, as programs running the same algorithms and using the same hardware should exhibit similar performance characteristics. We present an approach to learn algorithm classes from parallel performance data directly in order to classify algorithms without access to the source code. We extend previous work to enable classifying parallel sorting algorithms using automatic instrumentation instead of requiring manual region annotations in the source code. In this work, we design and demonstrate a study for classification of parallel sorting algorithms using parallel performance data collected from automatic instrumentation, and evaluate the performance of our new methodology on classification. We leverage Caliper to collect the performance data, Thicket for our exploratory data analysis (EDA), and PyTorch and Scikit-learn to evaluate the effectiveness of random forests, support vector machines (SVMs), decision trees, neural networks, and logistic regressions on parallel performance data. Additionally, we study noise in parallel performance data, whether the removal of noise and pre-processing of the data is necessary to accurately classify parallel sorting algorithms, and determine the effectiveness of features created from performance data. In conclusion, we demonstrate classification accuracy for these five different models of up to 97.7% across four different parallel algorithm classes.

Algorithm Classification↗

Machine learning-enabled discovery of ionic liquid–solvent electrolytes exhibiting high ionic conductivity

Ionic liquids (ILs), which are a class of materials with versatile nature and growing popularity, are facing impediments toward widespread usage as electrolytes due to various factors such as low ionic conductivity, high viscosity, high market price etc. One of the ways these limitations can be addressed is by mixing ILs with a molecular solvent. In a combinatorial sense, there exists an immense number of specific IL–solvent combinations. An exhaustive experimental or even simulation-based investigation of the chemical space spanned by such combinations can be extremely time-consuming, expensive, and nearly impossible. An alternative approach is to employ machine learning-based models developed from available databases. Although there exists prior literature that integrates machine learning to investigate mixtures of specific solvents with ILs, these models lack generalization necessitating development of a large number of ML models to handle various solvents. To remedy this shortcoming, as a part of designing green electrolytes with high ionic conductivity that can have potential applications in next-generation batteries and solar cells, this work aims to develop a unified machine learning model to predict ionic conductivity of any IL–solvent mixture system. In this regard, three models, namely, Random Forest, extreme gradient boosting (XGBoost), and artificial neural network (ANN) were formulated using the NIST ILThermo database. The dataset contained 549 unique ionic liquids from 16 cation families and 81 unique solvents, representing a total of 23 712 datapoints. SHAPLEY additive explanation (SHAP) method was used to assess the impact of various features on model prediction and their significance was compared with literature to gain physical insight about the model behavior. Finally, using the developed models, approximately 2.5 million IL–solvent mixtures at five different compositions were screened at room temperature. The high-throughput screening yielded nearly 19 000 IL–solvent mixtures for which ionic conductivity was found to exceed the ionic conductivity of conventional Li-ion battery electrolyte.

25 ENERGY STORAGE↗

Modeling freight mode choice using machine learning classifiers: a comparative study using Commodity Flow Survey (CFS) data

This study explores the usefulness of machine learning classifiers for modeling freight mode choice. We investigate eight commonly used machine learning classifiers, namely Naïve Bayes, Support Vector Machine, Artificial Neural Network, K-Nearest Neighbors, Classification and Regression Tree, Random Forest, Boosting and Bagging, along with the classical Multinomial Logit model. US 2012 Commodity Flow Survey data are used as the primary data source; we augment it with spatial attributes from secondary data sources. The performance of the classifiers is compared based on prediction accuracy results. The current research also examines the role of sample size and training-testing data split ratios on the predictive ability of the various approaches. In addition, the importance of variables is estimated to determine how the variables influence freight mode choice. The results show that the tree-based ensemble classifiers perform the best. Specifically, Random Forest produces the most accurate predictions, closely followed by Boosting and Bagging. With regard to variable importance, shipment characteristics, such as shipment distance, industry classification of the shipper and shipment size, are the most significant factors for freight mode choice decisions.

42 ENGINEERING↗

Binary operations on neuromorphic hardware with application to linear algebraic operations and stochastic equations

Abstract Non-von Neumann computational hardware, based on neuron-inspired, non-linear elements connected via linear, weighted synapses—so-called neuromorphic systems—is a viable computational substrate. Since neuromorphic systems have been shown to use less power than CPUs for many applications, they are of potential use in autonomous systems such as robots, drones, and satellites, for which power resources are at a premium. The power used by neuromorphic systems is approximately proportional to the number of spiking events produced by neurons on-chip. However, typical information encoding on these chips is in the form of firing rates that unarily encode information. That is, the number of spikes generated by a neuron is meant to be proportional to an encoded value used in a computation or algorithm. Unary encoding is less efficient (produces more spikes) than binary encoding. For this reason, here we present neuromorphic computational mechanisms for implementing binary two’s complement operations. We use the mechanisms to construct a neuromorphic, binary matrix multiplication algorithm that may be used as a primitive for linear differential equation integration, deep networks, and other standard calculations. We also construct a random walk circuit and apply it in Brownian motion simulations. We study how both algorithms scale in circuit size and iteration time.

97 MATHEMATICS AND COMPUTING↗

Probabilistic Voltage Sensitivity based Preemptive Voltage Monitoring in Unbalanced Distribution Networks

With increasing penetration of renewable energy and active consumers, control and management of power distribution networks has become challenging. Renewable energy sources can cause random voltage fluctuations as their output power depends on weather conditions. Conventional voltage control schemes such as tap changers and capacitor banks lack the foresight required to quickly alleviate voltage violations. Thus, there is an urgent need for effective approaches for predicting and mitigating voltage violations as a result of random fluctuations in power injections. This work proposes a novel voltage monitoring approach based on low-complexity, data-driven probabilistic voltage sensitivity analysis. The usefulness of this work is not only in predicting voltage violations in unbalanced distribution grids, but also in opening up the door for optimal voltage control. Using system data and forecasts, the proposed approach predicts the distribution of system node voltages which is then used to to identify nodes that may violate the nominal operational limits with high probability. The method is tested on the IEEE 37 node distribution system considering integrated distributed solar energy sources. The method is validated against the classic load flow based method and offers over 95% accuracy in predicting voltage violations.

Abujubbeh, Mohammad↗

Optimizing transmit field inhomogeneity of parallel RF transmit design in 7T MRI using deep learning

Ultrahigh field (UHF) Magnetic Resonance Imaging (MRI) provides a higher signal-to-noise ratio and, thereby, higher spatial resolution. However, UHF MRI introduces challenges such as transmit radiofrequency (RF) field (B+1) inhomogeneities, leading to uneven flip angles and image intensity anomalies. These issues can significantly degrade imaging quality and its medical applications. This study addresses B+1 field homogeneity through a novel deep learning-based strategy. Traditional methods like Magnitude Least Squares (MLS) optimization have been effective but are time-consuming and dependent on the patient’s presence. Recent machine learning approaches, such as RF Shim Prediction by Iteratively Projected Ridge Regression and deep learning frameworks, have shown promise but face limitations like extensive training times and oversimplified architectures. We propose a two-step deep learning strategy. First, we obtain the desired reference RF shimming weights from multi-channel B+1 fields using random-initialized Adaptive Moment Estimation. Then, we employ Residual Networks (ResNets) to train a model that maps B+1 fields to target RF shimming outputs. Our approach does not rely on pre-calculated reference optimizations for the testing process and efficiently learns residual functions. Comparative studies with traditional MLS optimization demonstrate our method’s advantages in terms of speed and accuracy. The proposed strategy achieves a faster and more efficient RF shimming design, significantly improving imaging quality at UHF. This advancement holds potential for broader applications in medical imaging and diagnostics.

Lu, Zhengyi [Vanderbilt University]↗

Machine Learning Classification of Molten Salt Heat Exchanger Channel Plugging using Synthetic Data

This report addresses the requirements of Milestone M3.4 AI capability to identify and predict maintenance events. Development of digital twins (DT) for molten salt reactor (MSR) components is crucial for reducing operating and maintenance costs (O&M) and ensuring commercial viability of these reactors. Our focus is on development of DT for MSR primary system heat exchanger (HX), a critical component, the fault in which can reduce operating efficiency and force reactor shutdown. We are investigating the feasibility of a conceptual DT of HX consisting of internal distributed temperature sensing with fiber optics and machine learning (ML) algorithms to detect and localize faults. To determine the optimal approach to detection and localization of channel plugging, we benchmark seven different ML models: Logistic Regression, K-Nearest Neighbors (KNN), Gaussian Naïve Bayes, Support Vector Machines (SVM), Decision Tree Classifier, Random Forest Tree Classifier, and Feed-Forward Neural Network. ML algorithms are benchmarked using synthetic HX plugging data generated with computational fluid dynamics COMSOL software, with added brown noise to represent experimental noise. We show that the best performance is obtained with the Decision Tree classifier.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Linac_Gen: Integrating Machine Learning and Particle-in-Cell Methods for Enhanced Beam Dynamics at Fermilab

Here, we introduce Linac_Gen, a tool developed at Fermilab, which combines machine learning algorithms with Particle-in-Cell methods to advance beam dynamics in linacs. Linac_Gen employs techniques such as Random Forest, Genetic Algorithms, Support Vector Machines, and Neural Networks, achieving a tenfold increase in speed for phase-space matching in Linacs over traditional methods, through the use of genetic algorithms. Crucially, Linac_Gen's adept handling of 3D field maps elevates the precision and realism in simulating beam instabilities and resonances, marking a key advancement in the field. Benchmarked against established codes, Linac_Gen demonstrates not only improved efficiency and precision in beam dynamics studies but also in the design and optimization of Linac systems, as evidenced in its application to Fermilab's PIP-II Linac project. This work represents a notable advancement in accelerator physics, marrying ML with PIC methods to set new standards for efficiency and accuracy in accelerator design and research. Linac_Gen exemplifies a novel approach in accelerator technology, offering substantial improvements in both theoretical and practical aspects of beam dynamics.

43 PARTICLE ACCELERATORS↗

Integration of LIBS with Machine Learning for Real-Time Monitoring of Feedstock in H 2 Gasification Applications

This project, funded by the U.S. Department of Energy (DOE) – Office of Fossil Energy under Award Number DE-FE0032177, aimed to assess the feasibility of an integrated Laser-Induced Breakdown Spectroscopy (LIBS) system with advanced machine learning (ML) models for real-time characterization and potential control of hydrogen gasifiers running on waste materials as feedstocks. This was a multidisciplinary effort that encompassed the acquisition and standardized analysis of individual and blended feedstocks—comprising biomass, coal waste, and plastic waste, followed by the development of a dynamic LIBS bench system for material sample analysis and development of predictive ML models. Comprehensive laboratory testing enabled the creation of a robust elemental dataset that served as the foundation for ML model training. Techniques such as Random Forest, Gradient Boosting, Support Vector Regression, and Neural Networks were employed to predict key feedstock properties, including higher heating value (HHV), moisture content, thermal conductivity, and ash composition with high accuracy. The results were validated against experimental data and demonstrated strong potential for real-time application in gasifier control systems. The project concluded with a study on the integration of the LIBS+ML approach for gasifier control and a techno-economic analysis of the implementation of the approach into hydrogen (H 2 ) gasification systems. Dissemination of results was carried out at a DOE meeting. This work establishes a scalable framework for automated, in-line feedstock quality assessment, offering significant implications for process optimization and emissions reduction in hydrogen production.

01 COAL, LIGNITE, AND PEAT↗

The direct and indirect drivers shaping RNA viral communities in grassland soil

Recent studies have revealed diverse RNA viral communities in soils. Yet, how environmental factors influence soil RNA viruses remains largely unknown. Here, we recovered RNA viral communities from 24 metatranscriptomes sequenced from grassland soils managed under a range of environmental conditions including 1) water content: 100% and 25% water holding capacity, 2) plant presence: planted with tall wheatgrass (Thinopyrum ponticum) and bare soil, 3) cultivar type: Alkar and Jose, and 4) soil depth: 0-5 cm and 15-25 cm. The recovered RNA viral communities were novel with nearly one-third of the RNA viral contigs uniquely detected in the studied grassland. The classified RNA viral contigs are mostly known as eukaryotic RNA viruses (74.7%) belonging to Phyla Duplornaviricota, Kitrinoviricota, Lenarviricota, and Pisuviricota. Eukaryotic RNA viruses of Family Mitoviridae as well as their natural hosts, Fungi, are one of the most dominant taxa. Consistent with the results of nonmetric multidimensional scaling analysis, the four environmental conditions (water content, plant presence, cultivar, and soil depth) significantly influence the assemblages of soil RNA viral communities as suggested by the correlation analysis and the random forest algorithm. The modularity analysis of the factor network and the structural equation modeling further support the hierarchical associations among the four environmental factors and the community factors representing the co-existing eukaryotic, prokaryotic, and RNA viral communities. The soil water content, plant presence, and type of cultivar demonstrate a significant positive impact on eukaryotic RNA viral richness directly as well as indirectly on eukaryotic RNA viral abundance via influencing the co-existing eukaryotic members in this soil. Our data also provide statistical support for the negative influence of soil depth on soil eukaryotic richness and abundances resulting in its indirect impact on soil eukaryotic RNA viral communities. This study provides field-relevant information on how environmental and community factors collectively shape soil RNA communities and contribute to ecological understanding of RNA viral survival under various environmental conditions and virus-host interactions in soil.

Wu, Ruonan↗

Construction of Women’s All-Around Speed Skating Event Performance Prediction Model and Competition Strategy Analysis Based on Machine Learning Algorithms

Introduction Accurately predicting the competitive performance of elite athletes is an essential prerequisite for formulating competitive strategies. Women’s all-around speed skating event consists of four individual subevents, and the competition system is complex and challenging to make accurate predictions on their performance. Objective The present study aims to explore the feasibility and effectiveness of machine learning algorithms for predicting the performance of women’s all-around speed skating event and provide effective training and competition strategies. Methods The data, consisting of 16 seasons of world-class women’s all-around speed skating competition results, used in the present study came from the International Skating Union (ISU). According to the competition rules, distinct features are filtered using lasso regression, and a 5,000 m race model and a medal model are built using a fivefold cross-validation method. Results The results showed that the support vector machine model was the most stable among the 5,000 m race and the medal models, with the highest AUC (0.86, 0.81, respectively). Furthermore, 3,000 m points are the main characteristic factors that decide whether an athlete can qualify for the final. The 11th lap of the 5,000 m, the second lap of the 500 m, and the fourth lap of the 1,500 m are the main characteristic factors that affect the athlete’s ability to win medals. Conclusion Compared with logistic regression, random forest, K-nearest neighbor, naive Bayes, neural network, support vector machine is a more viable algorithm to establish the performance prediction model of women’s all-around speed skating event; excellent performance in the 3,000 m event can facilitate athletes to advance to the final, and athletes with outstanding performance in the 500 m event are more likely competitive for medals.

Liu, Meng↗

Predicting Biomass Yields of Advanced Switchgrass Cultivars for Bioenergy and Ecosystem Services Using Machine Learning

The production of advanced perennial bioenergy crops within marginal areas of the agricultural landscape is gaining interest due to its potential to sustainably produce feedstocks for biofuels and bioproducts while also improving the sustainability and resilience of commodity crop production. However, predicting the biomass yields of this production system is challenging because marginal areas are often relatively small and spread around agricultural fields and are typically associated with various abiotic conditions that limit crop production. Machine learning (ML) offers a viable solution as a biomass yield prediction tool because it is suited to predicting relationships with complex functional associations. The objectives of this study were to (1) evaluate the accuracy of commonly applied ML algorithms in agricultural applications for predicting the biomass yields of advanced switchgrass cultivars for bioenergy and ecosystem services and (2) determine the most important biomass yield predictors. Datasets on biomass yield, weather, land marginality, soil properties, and agronomic management were generated from three field study sites in two U.S. Midwest states (Illinois and Iowa) over three growing seasons. The ML algorithms evaluated in the study included random forests (RFs), gradient boosting machines (GBMs), artificial neural networks (ANNs), K-neighbors regressor (KNR), AdaBoost regressor (ABR), and partial least squares regression (PLSR). Coefficient of determination (R 2 ) and mean absolute error (MAE) were used to evaluate the predictive accuracy of the tested algorithms. Results showed that the ensemble methods, RF (R 2 = 0.86, MAE = 0.62 Mg/ha), GBM (R 2 = 0.88, MAE = 0.57 Mg/ha), and GBM (R 2 = 0.78, MAE = 0.66 Mg/ha), were the most accurate in predicting biomass yields of the Independence, Liberty, and Shawnee switchgrass cultivars, respectively. This is in agreement with similar studies that apply ML to multi-feature problems where traditional statistical methods are less applicable and datasets used were considered to be relatively small for ANNs. Consistent with previous studies on switchgrass, the most important predictors of biomass yield included average annual temperature, average growing season temperature, sum of the growing season precipitation, field slope, and elevation. This study helps pave the way for applying ML as a management tool for alternative bioenergy landscapes where understanding agronomic and environmental performance of a multifunctional cropping system seasonally and interannually at the sub-field scale is critical.

09 BIOMASS FUELS↗

Linac_Gen: integrating machine learning and particle-in-cell methods for enhanced beam dynamics at Fermilab

Here, we introduce Linac_Gen, a tool developed at Fermilab, which combines machine learning algorithms with Particle-in-Cell methods to advance beam dynamics in linacs. Linac_Gen employs techniques such as Random Forest, Genetic Algorithms, Support Vector Machines, and Neural Networks, achieving a tenfold increase in speed for phase-space matching in linacs over traditional methods through the use of genetic algorithms. Crucially, Linac_Gen's adept handling of 3D field maps elevates the precision and realism in simulating beam instabilities and resonances, marking a key advancement in the field. Benchmarked against established codes, Linac_Gen demonstrates not only improved efficiency and precision in beam dynamics studies but also in the design and optimization of linac systems, as evidenced in its application to Fermilab's PIP-II linac project. This work represents a notable advancement in accelerator physics, marrying ML with PIC methods to set new standards for efficiency and accuracy in accelerator design and research. Linac_Gen exemplifies a novel approach in accelerator technology, offering substantial improvements in both theoretical and practical aspects of beam dynamics.

43 PARTICLE ACCELERATORS↗

MONACO: accurate biological network alignment through optimal neighborhood matching between focal nodes

Motivation: Alignment of protein–protein interaction networks can be used for the unsupervised prediction of functional modules, such as protein complexes and signaling pathways, that are conserved across different species. To date, various algorithms have been proposed for biological network alignment, many of which attempt to incorporate topological similarity between the networks into the alignment process with the goal of constructing accurate and biologically meaningful alignments. Especially, random walk models have been shown to be effective for quantifying the global topological relatedness between nodes that belong to different networks by diffusing node-level similarity along the interaction edges. However, these schemes are not ideal for capturing the local topological similarity between nodes. Results: Here, we propose MONACO, a novel and versatile network alignment algorithm that finds highly accurate pairwise and multiple network alignments through the iterative optimal matching of ‘local’ neighborhoods around focal nodes. Extensive performance assessment based on real networks as well as synthetic networks, for which the ground truth is known, demonstrates that MONACO clearly and consistently outperforms all other state-of-the-art network alignment algorithms that we have tested, in terms of accuracy, coherence and topological quality of the aligned network regions. Furthermore, despite the sharply enhanced alignment accuracy, MONACO remains computationally efficient and it scales well with increasing size and number of networks.

97 MATHEMATICS AND COMPUTING↗

Gradient Coding With Iterative Block Leverage Score Sampling

Gradient coding is a method for mitigating straggling servers in a centralized computing network that uses erasure-coding techniques to distributively carry out first-order optimization methods. Randomized numerical linear algebra uses randomization to develop improved algorithms for large-scale linear algebra computations. In this study, we propose a method for distributed optimization that combines gradient coding and randomized numerical linear algebra. The proposed method uses a randomized ℓ 2 -subspace embedding and a gradient coding technique to distribute blocks of data to the computational nodes of a centralized network, and at each iteration the central server only requires a small number of computations to obtain the steepest descent update. The novelty of our approach is that the data is replicated according to importance scores, called block leverage scores, in contrast to most gradient coding approaches that uniformly replicate the data blocks. Furthermore, we do not require a decoding step at each iteration, avoiding a bottleneck in previous gradient coding schemes. We show that our approach results in a valid ℓ 2 -subspace embedding, and that our resulting approximation converges to the optimal solution.

97 MATHEMATICS AND COMPUTING↗