Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Tree Classifiers”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Classification of Intensity Distributions of Transmission Eigenchannels of Disordered Nanophotonic Structures Using Machine Learning

Light-matter interaction optimization in complex nanophotonic structures is a critical step towards the tailored performance of photonic devices. The increasing complexity of such systems requires new optimization strategies beyond intuitive methods. For example, in disordered photonic structures, the spatial distribution of energy densities has large random fluctuations due to the interference of multiply scattered electromagnetic waves, even though the statistically averaged spatial profiles of the transmission eigenchannels are universal. Classification of these eigenchannels for a single configuration based on visualization of intensity distributions is difficult. However, successful classification could provide vital information about disordered nanophotonic structures. Emerging methods in machine learning have enabled new investigations into optimized photonic structures. In this work, we combine intensity distributions of the transmission eigenchannels and the transmitted speckle-like intensity patterns to classify the eigenchannels of a single configuration of disordered photonic structures using machine learning techniques. Specifically, we leverage supervised learning methods, such as decision trees and fully connected neural networks, to achieve classification of these transmission eigenchannels based on their intensity distributions with an accuracy greater than 99%, even with a dataset including photonic devices of various disorder strengths. Simultaneous classification of the transmission eigenchannels and the relative disorder strength of the nanophotonic structure is also possible. Our results open new directions for machine learning assisted speckle-based metrology and demonstrate a novel approach to classifying nanophotonic structures based on their electromagnetic field distributions. These insights can be of paramount importance for optimizing light-matter interactions at the nanoscale.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

The cosmological bootstrap: inflationary correlators from symmetries and singularities

Scattering amplitudes at weak coupling are highly constrained by Lorentz invariance, locality and unitarity, and depend on model details only through coupling constants and the particle content of the theory. For example, four-particle amplitudes are analytic for contact interactions and have simple poles with appropriately positive residues for tree-level exchange. In this paper, we develop an understanding of inflationary correlators which parallels that of flat-space scattering amplitudes. Specifically, we study slow-roll inflation with weak couplings to extra massive particles, for which all correlation functions are controlled by an approximate conformal symmetry on the boundary of the spacetime. After systematically classifying all possible contact terms in de Sitter space, we derive an analytic expression for the four-point function of conformally coupled scalars mediated by the tree-level exchange of massive scalars. Conformal symmetry implies that the correlator satisfies a pair of differential equations with respect to spatial momenta, encoding bulk time evolution in purely boundary terms. The absence of unphysical singularities (and the correct normalization of physical ones) completely fixes this correlator. Moreover, a “spin-raising” operator relates it to the correlators associated with the exchange of particles with spin, while “weight-shifting” operators map it to the four-point function of massless scalars. We explain how these de Sitter four-point functions can be perturbed to obtain inflationary three-point functions. Using our formalism, we reproduce many classic results in the literature, such as the three-point function of slow-roll inflation, and provide a complete classification of all inflationary three- and four-point functions arising from weakly broken conformal symmetry. Remarkably, the inflationary bispectrum associated with the exchange of particles with arbitrary spin is completely characterized by the soft limit of the simplest scalar-exchange four-point function of conformally coupled scalars and a series of contact terms. Finally, we demonstrate that the inflationary correlators contain flat-space scattering amplitudes via a suitable analytic continuation of the external momenta, which can also be directly connected with the signals for particle production seen in the squeezed limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

Contrasting allelic distribution of CO / Hd1 homologues in Miscanthus sinensis from the East Asian mainland and the Japanese archipelago

The genus Miscanthus is a perennial C 4 grass native to eastern Asia and is a promising candidate bioenergy crop for cool temperate areas. Flowering time is a crucial factor governing regional and seasonal adaptation; in addition, it is also a key target trait for extending the vegetative phase to improve biomass potential. Homologues of CONSTANS (CO)/Heading date 1(Hd1) were cloned from Miscanthus sinensis and named MsiHd1 . Sequences of MsiHd1 homologues were compared among 24 wild M. sinensis accessions from Japan, 14 from China, and three from South Korea. Two to five MsiHd1 alleles in each accession were identified, suggesting that MsiHd1 consists of at least three loci in the Miscanthus genome. Verifying the open reading frame in MsiHd1 , they were classified as putative functional alleles without mutations or non-functional alleles caused by indels. The Neighbor-Joining tree indicated that one of the multiple MsiHd1 loci is a pseudogene locus without any functional alleles. The pseudogene locus was named MsiHd1b , and the other loci were considered to be part of the MsiHd1a multi-locus family. Interestingly, in most Japanese accessions 50% or more of the MsiHd1a alleles were non-functional, whereas accessions from the East Asian mainland harboured only functional alleles. Five novel miniature inverted transposable elements (MITEs) ( MsiMITE1-MsiMITE5 ) were observed in MsiHd1a/b . MsiMITE1 , detected in exon 1 of MsiHd1a , was only observed in Japanese accessions and its revertant alleles derived from retransposition were predominantly in Chinese accessions. In conclusion, these differences in MsiHd1a show that the dependency on functional MsiHd1a alleles is different between accessions from the East Asian mainland and Japan.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2018

A subleading power operator basis for the scalar quark current

Factorization theorems play a crucial role in our understanding of the strong interaction. For collider processes they are typically formulated at leading power and much less is known about power corrections in the λ << 1 expansion. Here we present a complete basis of power suppressed operators for a scalar quark current at O(λ 2 ) in the amplitude level power expansion in the Soft Collinear Effective Theory, demonstrating that helicity selection rules significantly simplify the construction. This basis applies for the production of any color singlet scalar in qq¯¯ annihilation (such as bb¯¯→H ). We also classify all operators which contribute to the cross section at O(λ 2 ) and perform matching calculations to determine their tree level Wilson coefficients. Furthermore, these results can be exploited to study power corrections in both resummed and fixed order perturbation theory, and for analyzing the factorization properties of gauge theory amplitudes and cross sections at subleading power.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2014

Leptophilic dark matter and the anomalous magnetic moment of the muon

We consider renormalizable theories such that the scattering of dark matter off leptons arises at tree level, but scattering off nuclei only arises at loop. In this framework, the various dark matter candidates can be classified by their spins and by the forms of their interactions with leptons. In this study, we determine the corrections to the anomalous magnetic moment of the muon that arise from its interactions with dark matter. We then consider the implications of these results for a set of simplified models of leptophilic dark matter. When a dark matter candidate reduces the existing tension between the standard model prediction of the anomalous magnetic moment and the experimental measurement, the region of parameter space favored to completely remove the discrepancy is highlighted. Conversely, when agreement is worsened, we place limits on the parameters of the corresponding simplified model. These bounds and favored regions are compared against the experimental constraints on the simplified model from direct detection and from collider searches. Although these constraints are severe, we find there do exist limited regions of parameter space in these simple theories that can explain the observed anomaly in the muon magnetic moment while remaining consistent with all experimental bounds.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2016

Machine- z : Rapid machine-learned redshift indicator for Swift gamma-ray bursts

Studies of high-redshift gamma-ray bursts (GRBs) provide important information about the early Universe such as the rates of stellar collapsars and mergers, the metallicity content, constraints on the re-ionization period, and probes of the Hubble expansion. Rapid selection of high-z candidates from GRB samples reported in real time by dedicated space missions such as Swift is the key to identifying the most distant bursts before the optical afterglow becomes too dim to warrant a good spectrum. Here, we introduce ‘machine-z’, a redshift prediction algorithm and a ‘high-z’ classifier for Swift GRBs based on machine learning. Our method relies exclusively on canonical data commonly available within the first few hours after the GRB trigger. Using a sample of 284 bursts with measured redshifts, we trained a randomized ensemble of decision trees (random forest) to perform both regression and classification. Cross-validated performance studies show that the correlation coefficient between machine-z predictions and the true redshift is nearly 0.6. At the same time, our high-z classifier can achieve 80 per cent recall of true high-redshift bursts, while incurring a false positive rate of 20 per cent. With 40 per cent false positive rate the classifier can achieve ~100 per cent recall. As a result, the most reliable selection of high-redshift GRBs is obtained by combining predictions from both the high-z classifier and the machine-z regressor.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2019

Situational Awareness in Distribution Grid Using Micro-PMU Data: A Machine Learning Approach

The recent development of distribution-level phasor measurement units, a.k.a. micro-PMUs, has been an important step towards achieving situational awareness in power distribution networks. The challenge however is to transform the large amount of data that is generated by micro-PMUs to actionable information and then match the information to use cases with practical value to system operators. This open problem is addressed in this paper. First, we introduce a novel data-driven event detection technique to pick out valuable portion of data from extremely large raw micro-PMU data. Subsequently, a datadriven event classifier is developed to effectively classify power quality events. Importantly, we use field expert knowledge and utility records to conduct an extensive data-driven event labeling. Moreover, certain aspects from event detection analysis are adopted as additional features to be fed into the classifier model. In this regard, a multi-class support vector machine (multi-SVM) classifier is trained and tested over 15 days of real-world data from two micro-PMUs on a distribution feeder in Riverside, CA. In total, we analyze 1.2 billion measurement points, and 10,700 events. Here, the effectiveness of the developed event classifier is compared with prevalent multi-class classification methods, including k-nearest neighbor method as well as decision-tree method. Importantly, two real-world use-cases are presented for the proposed data analytics tools, including remote asset monitoring and distribution-level oscillation analysis.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

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↗
DOE OSTI2016

SU-C-207B-05: Tissue Segmentation of Computed Tomography Images Using a Random Forest Algorithm: A Feasibility Study

Purpose: Develop an automated Random Forest algorithm for tissue segmentation of CT examinations. Methods: Seven materials were classified for segmentation: background, lung/internal gas, fat, muscle, solid organ parenchyma, blood/contrast, and bone using Matlab and the Trainable Weka Segmentation (TWS) plugin of FIJI. The following classifier feature filters of TWS were investigated: minimum, maximum, mean, and variance each evaluated over a pixel radius of 2n, (n = 0–4). Also noise reduction and edge preserving filters, Gaussian, bilateral, Kuwahara, and anisotropic diffusion, were evaluated. The algorithm used 200 trees with 2 features per node. A training data set was established using an anonymized patient’s (male, 20 yr, 72 kg) chest-abdomen-pelvis CT examination. To establish segmentation ground truth, the training data were manually segmented using Eclipse planning software, and an intra-observer reproducibility test was conducted. Six additional patient data sets were segmented based on classifier data generated from the training data. Accuracy of segmentation was determined by calculating the Dice similarity coefficient (DSC) between manual and auto segmented images. Results: The optimized autosegmentation algorithm resulted in 16 features calculated using maximum, mean, variance, and Gaussian blur filters with kernel radii of 1, 2, and 4 pixels, in addition to the original CT number, and Kuwahara filter (linear kernel of 19 pixels). Ground truth had a DSC of 0.94 (range: 0.90–0.99) for adult and 0.92 (range: 0.85–0.99) for pediatric data sets across all seven segmentation classes. The automated algorithm produced segmentation with an average DSC of 0.85 ± 0.04 (range: 0.81–1.00) for the adult patients, and 0.86 ± 0.03 (range: 0.80–0.99) for the pediatric patients. Conclusion: The TWS Random Forest auto-segmentation algorithm was optimized for CT environment, and able to segment seven material classes over a range of body habitus and CT protocol parameters with an average DSC of 0.86 ± 0.04 (range: 0.80–0.99).

60 APPLIED LIFE SCIENCES↗
DOE OSTI2018

Climate sensitive size-dependent survival in tropical trees

Survival rates of large trees determine forest biomass dynamics. Survival rates of small trees are linked to mechanisms that maintain biodiversity across tropical forests. How species survival rates change with size offers insight into the links between biodiversity and ecosystem function across tropical forests. We tested patterns of size-dependent tree survival across the tropics using data from 1781 species and over two million individuals to assess whether tropical forests can be characterized by size-dependent life-history survival strategies. We found species were classifiable into four “survival modes” that explain life-history variation that shapes carbon-cycling and the relative abundances within forests. Frequently collected functional traits, such as wood density, leaf mass per area, and seed mass, were not generally predictive of species’ survival modes. Mean annual temperature and cumulative water deficit predicted the proportion of biomass of survival modes, indicating important links between evolutionary strategies, climate, and carbon cycling. The application of survival modes in demographic simulations predicted biomass change across forest sites. Our results reveal globally identifiable size-dependent survival strategies that differ across diverse systems in a consistent way. The abundance of survival modes and interaction with climate ultimately determine forest structure, carbon storage in biomass, and future forest trajectories.

Johnson, Daniel J.↗
DOE OSTI2021

A k-mer based approach for classifying viruses without taxonomy identifies viral associations in human autism and plant microbiomes

Viruses are an underrepresented taxa in the study and identification of microbiome constituents; however, they play an essential role in health, microbiome regulation, and transfer of genetic material. Only a few thousand viruses have been isolated, sequenced, and assigned a taxonomy, which limits the ability to identify and quantify viruses in the microbiome. Additionally, the vast diversity of viruses represents a challenge for classification, not only in constructing a viral taxonomy, but also in identifying similarities between a virus’ genotype and its phenotype. However, the diversity of viral sequences can be leveraged to classify their sequences in metagenomic and metatranscriptomic samples, even if they do not have a taxonomy. To identify and quantify viruses in transcriptomic and genomic samples, we developed a dynamic programming algorithm for creating a classification tree out of 715,672 metagenome viruses. To create the classification tree, we clustered proportional similarity scores generated from the k-mer profiles of each of the metagenome viruses to create a database of metagenomic viruses. The resulting Kraken2 database of the metagenomic viruses can be found here: https://www.osti.gov/biblio/1615774 and is compatible with Kraken2. We then integrated the viral classification database with databases created with genomes from NCBI for use with ParaKraken (a parallelized version of Kraken provided in Supplemental Zip 1), a metagenomic/transcriptomic classifier. To illustrate the breadth of our utility for classifying metagenome viruses, we analyzed data from a plant metagenome study identifying genotypic and compartment specific differences between two Populus genotypes in three different compartments. We also identified a significant increase in abundance of eight viral sequences in post mortem brains in a human metatranscriptome study comparing Autism Spectrum Disorder patients and controls. We also show the potential accuracy for classifying viruses by utilizing both the JGI and NCBI viral databases to identify the uniqueness of viral sequences. Finally, we validate the accuracy of viral classification with NCBI databases containing viruses with taxonomy to identify pathogenic viruses in known COVID-19 and cassava brown streak virus infection samples. Our method represents the compulsory first step in better understanding the role of viruses in the microbiome by allowing for a more complete identification of sequences without taxonomy. Better classification of viruses will improve identifying associations between viruses and their hosts as well as viruses and other microbiome members. Despite the lack of taxonomy, this database of metagenomic viruses can be used with any tool that utilizes a taxonomy, such as Kraken, for accurate classification of viruses.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2018

Jet charge and machine learning

Modern machine learning techniques, such as convolutional, recurrent and recursive neural networks, have shown promise for jet substructure at the Large Hadron Collider. For example, they have demonstrated effectiveness at boosted top or W boson identification or for quark/gluon discrimination. We explore these methods for the purpose of classifying jets according to their electric charge. We find that both neural networks that incorporate distance within the jet as an input and boosted decision trees including radial distance information can provide significant improvement in jet charge extraction over current methods. Specifically, convolutional, recurrent, and recursive networks can provide the largest improvement over traditional methods, in part by effectively utilizing distance within the jet or clustering history. Furthermore, the advantages of using a fixed-size input representation (as with the CNN) or a small input representation (as with the RNN) suggest that both convolutional and recurrent networks will be essential to the future of modern machine learning at colliders.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Machine Learning Benchmarks for the Classification of Equivalent Circuit Models from Electrochemical Impedance Spectra

Analysis of Electrochemical Impedance Spectroscopy (EIS) data for electrochemical systems often consists of defining an Equivalent Circuit Model (ECM) using expert knowledge and then optimizing the model parameters to deconvolute various resistance, capacitive, inductive, or diffusion responses. For small data sets, this procedure can be conducted manually; however, it is not feasible to manually define a proper ECM for extensive data sets with a wide range of EIS responses. Automatic identification of an ECM would substantially accelerate the analysis of large sets of EIS data. We showcase machine learning methods to classify the ECMs of 9,300 impedance spectra provided by QuantumScape for the BatteryDEV hackathon. The best-performing approach is a gradient-boosted tree model utilizing a library to automatically generate features, followed by a random forest model using the raw spectral data. A convolutional neural network using boolean images of Nyquist representations is presented as an alternative, although it achieves a lower accuracy. We publish the data and open source the associated code. The approaches described in this article can serve as benchmarks for further studies. A key remaining challenge is the identifiability of the labels, underlined by the model performances and the comparison of misclassified spectra.

25 ENERGY STORAGE↗
DOE OSTI2022

Classification of Nuclear Reactor Operations Using Spatial Importance and Multisensor Networks

Distributed multisensor networks record multiple data streams that can be used as inputs to machine learning models designed to classify operations relevant to proliferation at nuclear reactors. The goal of this work is to demonstrate methods to assess the importance of each node (a single multisensor) and region (a group of proximate multisensors) to machine learning model performance in a reactor monitoring scenario. This, in turn, provides insight into model behavior, a critical requirement of data-driven applications in nuclear security. Using data collected at the High Flux Isotope Reactor at Oak Ridge National Laboratory via a network of Merlyn multisensors, two different models were trained to classify the reactor’s operational state: a hidden Markov model (HMM), which is simpler and more transparent, and a feed-forward neural network, which is less inherently interpretable. Traditional wrapper methods for feature importance were extended to identify nodes and regions in the multisensor network with strong positive and negative impacts on the classification problem. These spatial-importance algorithms were evaluated on the two different classifiers. The classification accuracy was then improved relative to baseline models via feature selection from 0.583 to 0.839 and from 0.811 ± 0.005 to 0.884 ± 0.004 for the HMM and feed-forward neural network, respectively. While some differences in node and region importance were observed when using different classifiers and wrapper methods, the nodes near the facility’s cooling tower were consistently identified as important—a conclusion further supported by studies on feature importance in decision trees. Node and region importance methods are model-agnostic, inform feature selection for improved model performance, and can provide insight into opaque classification models in the nuclear security domain.

Tibbetts, Jake↗
DOE OSTI2022

Predicting resistive wall mode stability in NSTX through balanced random forests and counterfactual explanations

Abstract Recent progress in the disruption event characterization and forecasting framework has shown that machine learning guided by physics theory can be easily implemented as a supporting tool for fast computations of ideal stability properties of spherical tokamak plasmas. In order to extend that idea, a customized random forest (RF) classifier that takes into account imbalances in the training data is hereby employed to predict resistive wall mode (RWM) stability for a set of high beta discharges from the NSTX spherical tokamak. More specifically, with this approach each tree in the forest is trained on samples that are balanced via a user-defined over/under-sampler. The proposed approach outperforms classical cost-sensitive methods for the problem at hand, in particular when used in conjunction with a random under-sampler, while also resulting in a threefold reduction in the training time. In order to further understand the model’s decisions, a diverse set of counterfactual explanations based on determinantal point processes (DPP) is generated and evaluated. Via the use of DPP, the underlying RF model infers that the presence of hypothetical magnetohydrodynamic activity would have prevented the RWM from concurrently going unstable, which is a counterfactual that is indeed expected by prior physics knowledge. Given that this result emerges from the data-driven RF classifier and the use of counterfactuals without hand-crafted embedding of prior physics intuition, it motivates the usage of counterfactuals to simulate real-time control by generating the β N levels that would have kept the RWM stable for a set of unstable discharges.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Distinguishing Orbiting and Infalling Dark Matter Particles with Machine Learning

Dark matter halos are typically defined as spheres that enclose some overdensity, but these sharp, somewhat arbitrary boundaries introduce nonphysical artifacts such as backsplash halos, pseudo-volution, and an incomplete accounting of halo mass. A more physically motivated alternative is to define halos as the collection of particles that are physically orbiting within their potential well. However, existing methods to classify particles as orbiting or infalling suffer from trade-offs between accuracy, computational cost, and generalizability across cosmologies. We present an efficient, yet accurate, supervised machine learning approach using decision trees. The classification is based on only the particle radii and velocities at two epochs. Compared to detailed analysis of particle trajectories, we find that our model matches the classification of 97% of particles. Consequently, we are able to quickly and accurately reproduce the density profiles of the orbiting and infalling components out to many virial radii. We demonstrate that our model generalizes to a significantly different cosmology that lies outside the training data set. We make publicly available both our final model and the code to train similar models.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

A spy among the trees: The story of Oscar Seborer

It’s long been known that during World War II, Theodore “Ted” Hall, Klaus Fuchs and David Greenglass committed espionage at Los Alamos. Each worked at the secret laboratory charged with creating the world’s first atomic bomb, stole classified weapons information and shared it with the Soviet Union. Just recently, though, in September 2019, historians confirmed a fourth wartime spy: Oscar Seborer. But who was he, what do we know about him, what did he steal, and what happened to him?

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗
DOE OSTI2015

Group‐sparsity regularization for ill‐posed subsurface flow inverse problems

Abstract Sparse representations provide a flexible and parsimonious description of high‐dimensional model parameters for reconstructing subsurface flow property distributions from limited data. To further constrain ill‐posed inverse problems, group‐sparsity regularization can take advantage of possible relations among the entries of unknown sparse parameters when: (i) groups of sparse elements are either collectively active or inactive and (ii) only a small subset of the groups is needed to approximate the parameters of interest. Since subsurface properties exhibit strong spatial connectivity patterns they may lead to sparse descriptions that satisfy the above conditions. When these conditions are established, a group‐sparsity regularization can be invoked to facilitate the solution of the resulting inverse problem by promoting sparsity across the groups. The proposed regularization penalizes the number of groups that are active without promoting sparsity within each group. Two implementations are presented in this paper: one based on the multiresolution tree structure of Wavelet decomposition, without a need for explicit prior models, and another learned from explicit prior model realizations using sparse principal component analysis (SPCA). In each case, the approach first classifies the parameters of the inverse problem into groups with specific connectivity features, and then takes advantage of the grouped structure to recover the relevant patterns in the solution from the flow data. Several numerical experiments are presented to demonstrate the advantages of additional constraining power of group‐sparsity in solving ill‐posed subsurface model calibration problems.

Golmohammadi, Azarang↗