Search NASA⌕ Search

SEARCH · Search NASA

Results for “mathematical regularization”

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 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Machine learning unifies flexibility and efficiency of spinodal structure generation for stochastic biomaterial design

Abstract Porous biomaterials design for bone repair is still largely limited to regular structures (e.g. rod-based lattices), due to their easy parameterization and high controllability. The capability of designing stochastic structure can redefine the boundary of our explorable structure–property space for synthesizing next-generation biomaterials. We hereby propose a convolutional neural network (CNN) approach for efficient generation and design of spinodal structure—an intriguing structure with stochastic yet interconnected, smooth, and constant pore channel conducive to bio-transport. Our CNN-based approach simultaneously possesses the tremendous flexibility of physics-based model in generating various spinodal structures (e.g. periodic, anisotropic, gradient, and arbitrarily large ones) and comparable computational efficiency to mathematical approximation model. We thus successfully design spinodal bone structures with target anisotropic elasticity via high-throughput screening, and directly generate large spinodal orthopedic implants with desired gradient porosity. This work significantly advances stochastic biomaterials development by offering an optimal solution to spinodal structure generation and design.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2018

A comparative study of structural similarity and regularization for joint inverse problems governed by PDEs

Joint inversion refers to the simultaneous inference of multiple parameter fields from observations of systems governed by single or multiple forward models. In many cases these parameter fields reflect different attributes of a single medium and are thus spatially correlated or structurally similar. By imposing prior information on their spatial correlations via a joint regularization term, we seek to improve the reconstruction of the parameter fields relative to inversion for each field independently. One of the main challenges is to devise a joint regularization functional that conveys the spatial correlations or structural similarity between the fields while at the same time permitting scalable and efficient solvers for the joint inverse problem. We describe several joint regularizations that are motivated by these goals: a cross-gradient and a normalized cross-gradient structural similarity term, the vectorial total variation, and a joint regularization based on the nuclear norm of the gradients. Based on numerical results from three classes of inverse problems with piecewise-homogeneous parameter fields, we conclude that the vectorial total variation functional is preferable to the other methods considered. Besides resulting in good reconstructions in all experiments, it allows for scalable, efficient solvers for joint inverse problems governed by PDE forward models.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Data imbalance in drug response prediction: multi-objective optimization approach in deep learning setting

Abstract Drug response prediction (DRP) methods tackle the complex task of associating the effectiveness of small molecules with the specific genetic makeup of the patient. Anti-cancer DRP is a particularly challenging task requiring costly experiments as underlying pathogenic mechanisms are broad and associated with multiple genomic pathways. The scientific community has exerted significant efforts to generate public drug screening datasets, giving a path to various machine learning models that attempt to reason over complex data space of small compounds and biological characteristics of tumors. However, the data depth is still lacking compared to application domains like computer vision or natural language processing domains, limiting current learning capabilities. To combat this issue and improves the generalizability of the DRP models, we are exploring strategies that explicitly address the imbalance in the DRP datasets. We reframe the problem as a multi-objective optimization across multiple drugs to maximize deep learning model performance. We implement this approach by constructing Multi-Objective Optimization Regularized by Loss Entropy loss function and plugging it into a Deep Learning model. We demonstrate the utility of proposed drug discovery methods and make suggestions for further potential application of the work to achieve desirable outcomes in the healthcare field.

Biochemistry & Molecular Biology↗
DOE OSTI2018

Optimizing Kernel Machines Using Deep Learning

Building highly non-linear and non-parametric models is central to several state-of-the-art machine learning systems. Kernel methods form an important class of techniques that induce a reproducing kernel Hilbert space (RKHS) for inferring non-linear models through the construction of similarity functions from data. These methods are particularly preferred in cases where the training data sizes are limited and when prior knowledge of the data similarities is available. Despite their usefulness, they are limited by the computational complexity and their inability to support end-to-end learning with a task specific objective. On the other hand, deep neural networks have become the de facto solution for end-to-end inference in several learning paradigms. In this article, we explore the idea of using deep architectures to perform kernel machine optimization, for both computational efficiency and end-to-end inferencing. To this end, we develop the DKMO (Deep Kernel Machine Optimization) framework, that creates an ensemble of dense embeddings using Nystrõm kernel approximations and utilizes deep learning to generate task-specific representations through the fusion of the embeddings. Intuitively, the filters of the network are trained to fuse information from an ensemble of linear subspaces in the RKHS. Furthermore, we introduce the kernel dropout regularization to enable improved training convergence. Finally, we extend this framework to the multiple kernel case, by coupling a global fusion layer with pre-trained deep kernel machines for each of the constituent kernels. Using case studies with limited training data, and lack of explicit feature sources, we demonstrate the effectiveness of our framework over conventional model inferencing techniques.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Physically regularized machine learning emulators of aerosol activation

Abstract. The activation of aerosol into cloud droplets is an important step in the formation of clouds and strongly influences the radiative budget of the Earth. Explicitly simulating aerosol activation in Earth system models is challenging due to the computational complexity required to resolve the necessary chemical and physical processes and their interactions. As such, various parameterizations have been developed to approximate these details at reduced computational cost and accuracy. Here, we explore how machine learning emulators can be used to bridge this gap in computational cost and parameterization accuracy. We evaluate a set of emulators of a detailed cloud parcel model using physically regularized machine learning regression techniques. We find that the emulators can reproduce the parcel model at higher accuracy than many existing parameterizations. Furthermore, physical regularization tends to improve emulator accuracy, most significantly when emulating very low activation fractions. This work demonstrates the value of physical constraints in machine learning model development and enables the implementation of improved hybrid physical and machine learning models of aerosol activation into next-generation Earth system models.

58 GEOSCIENCES↗
DOE OSTI2025

Multi-scale, Multi-disciplinary, and Multi-agent Explainable AI with Koopman-Undergirded Learning, Prediction, and Analysis (M3EA KULPA) (Project Closeout Report)

The goal of this project was to develop and use domain-aware machine learning formulations, based on the Koopman Operator (KO), for modelling multi-scale, multi-disciplinary (e.g., multi-physics), and/or multi-agent systems. The project developed these formulations for the following cases: • Systems with dynamics at two separate time scales, • Systems with a bi-level hierarchical control structure, • Systems with bi-level hierarchical control and dynamics at two separate time scales (the lower level controls operating at the faster time scale), and • Systems with n separate but interacting agents/disciplines (with/without control, respectively); the controls for each agent could include bi-level hierarchical control and dynamics at two separate time scales as described above. The project then defined a set of dynamical systems consisting of different nonlinear oscillators that could be used to test these different formulations and then subsequently learned the KO models for those systems. With the KO models, we were able to do the following: • Quantify system stability, including both long-term and transient behavior, • Quantify the effects of feedbacks between the different time scales and agents/disciplines in terms of those feedbacks’ effects on system stability, • Replace a standard Proportional-Integral (PI) control in the hierarchical control structure with a KO-based Linear-Quadratic Regular (LQR), a form of optimal control, • Calculate optimal supervisory control policies a) with and without time scale separated dynamics at the lower level control levels and b) with both PI and KO-based LQR lower level control policies, and • Calculate dynamic Nash equilibria for multi-agent systems where each agent makes its own control decisions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Situ/FASGuard: Combining Anomaly Detection with Signature Generation

Despite the best efforts of cyber security analysts, networked computing assets are regularly compromised, resulting in the loss of intellectual property, the disclosure of state secrets, and financial damages in the billions. A 2014 report from the Center for Strategic and International Studies estimated the global cost of cyber crime at $\$$400 billion annually. There has also been a rise of sophisticated attack groups that continually develop novel methods of penetrating networks that current technologies are typically unable to detect.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Nondestructive Evaluation of Concrete: Elastic Property Imaging Through Full-Waveform Inversion

Concrete is a vital material in construction—especially in the nuclear industry, where it is used in critical structures such as containment vessels. Over time, concrete can degrade due to harsh operational and environmental conditions, necessitating that its elastic properties be accurately evaluated to ensure structural integrity and safety. Traditional nondestructive evaluation methods such as ultrasound-based techniques often rely on simplifying assumptions that may not hold true for concrete. This paper presents an advanced ultrasound-based method that uses elastic full-waveform inversion (EFWI) to create detailed images of concrete’s mechanical properties. By accurately modeling wave behaviors such as scattering and reflection, we aim to overcome the limitations of conventional ultrasonic-based methods. In this work, the imaging problem involved reconstructing the various elastic properties of a heterogenous concrete block with three steel rebars embedded in it. The ultrasonic measurements were synthetically generated from multiple sources and receivers, and the reconstruction process was performed using a gradient-based optimization algorithm. Our approach leveraged EFWI to reconstruct high-resolution images of the pressure wave speed, shear wave speed, and density. Multiple misfit functions—including L2-norm, cross-correlation (CC), and L1-norm—combined with total variation (TV) regularization and parameter constraints using a Sigmoid function—were explored for the reconstruction. The results demonstrated that using the L1-norm misfit function in conjunction with TV regularization and Sigmoid constraints significantly improved the reconstruction quality in comparison to traditional methods. This approach provided clearer images with fewer artifacts and better captured background heterogeneity. Our findings highlight that, when properly designed, EFWI carries great potential for providing comprehensive, more accurate, and more reliable assessments of concrete conditions, as is crucial for the maintenance and safety of nuclear power plant structures.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Global Existence and Uniqueness of Weak and Regular Solutions of Shallow Shells with Thermal Effects

We study a dynamical thin shallow shell whose elastic deformations are described by a nonlinear system of Marguerre–Vlasov’s type under the presence of thermal effects. Our main result is the proof of a global existence and uniqueness of a weak solution in the case of clamped boundary conditions. Standard techniques for uniqueness do not work directly in this case. We overcame this difficulty using recent work due to Lasiecka (Appl Anal 4:1376–1422, 1998).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Cognition at the Point of Sensing

Over the last 15 years, compressive sensing techniques have been developed which have the potential to greatly reduce the amount of data collected by systems while preserving the amount of information obtained. A cost of this efficiency is that a computationally-intensive optimization routine must be used to put the sensed data into a form that a person can interpret. At the same time, machine learning techniques have experienced tremendous growth as well. Machines have demonstrated the ability learn how to effectively perform tasks such as detection and classification at speeds much faster than humanly possible. Our goal in this project was to study the feasibility of using compressive sensing systems "at the edge." That is, how can compressive sensing sensors be deployed such that information is created at the remote sensor rather than sending raw data to a central processing location? Studies were performed to analyze whether machine learning could be done on the compressively sensed data in its raw form. If a machine is performing the task, is it possible to do so without putting the data into a human interpretable form? We show that this is possible for some systems, in particular a compressive sensing snapshot imaging spectrometer. Machine learning tasks were demonstrated to be more effective and more robust to noise when the machine learning algorithm worked on data in its raw form. This system is shown to outperform a traditional spectrometer. Techniques for reducing the complexity of the reconstruction routine were also analyzed. Techniques for such as data regularization, deep neural networks, and matrix completion were studied and shown to have benefits over traditional reconstruction techniques. In this project we showed that compressive sensing sensors are indeed feasible at the edge. As always, sensors and algorithms must be carefully tuned to work in the constrained environment. In this project we developed tools and techniques to enable those analyses.

47 OTHER INSTRUMENTATION↗
DOE OSTI2025

A Polar Scaling Technique for the Regularization of Strongly Singular and Strongly Near-Singular Helmholtz Surface Integrals Evaluated Over 2-D Domains

The numerical integration of expressions containing strong singularities or strong near-singularities has long been a challenging problem in the electromagnetics community. Much attention has been paid to this problem, as strong $1/R^{{2}}$ singularities routinely appear when implementing electromagnetic simulation techniques like the method of moments (MoM). To date, several techniques, from singularity extraction to singularity cancellation (SC), have been employed to deal with problems that require the evaluation of 2-D strongly singular integrals. However, no single technique has been proposed that can deal with both strong singularities and strong near-singularities in a fully numerical manner for arbitrary 2-D domains. Moreover, it has been claimed that the Helmholtz-type strongly singular integral found in the MoM is convergent in a principal value sense, but this convergence value has yet to be proven mathematically. In this work, we will conduct the convergence proof and introduce a “polar scaling” change of variables method that may be used to evaluate Helmholtz integrals with both strong and weak singularities/near-singularities. The technique is fully numerical and can in principle be applied to any planar or curved polygon and any nonsingular basis function. We will also provide numerical results showing useful convergence behavior for integrals involving both exact and near-singularities.

47 OTHER INSTRUMENTATION↗
NASA NTRS1986

Multistep modeling (MSM) of biomolecular structure application to the A-G mispair in the B-DNA environment

A multistep modeling procedure has been evolved to study the structural changes introduced by lesions in DNA. We report here the change in the structure of regular B-DNA geometry due to the incorporation of Ganti-Aanti mispair in place of a regular G-C pair, preserving the helix continuity. The energetics of the structure so obtained is compared with the Ganti-Asyn configuration under similar constrained conditions. We present the methodology adopted and discuss the results.

Non-NASA Center↗
DOE OSTI2022

Nonconvex regularization for sparse neural networks

Convex ℓ 1 regularization using an infinite dictionary of neurons has been suggested for constructing neural networks with desired approximation guarantees, but can be affected by an arbitrary amount of over-parametrization. This can lead to a loss of sparsity and result in networks with too many active neurons for the given data, in particular if the number of data samples is large. As a remedy, in this paper, a nonconvex regularization method is investigated in the context of shallow ReLU networks: We prove that in contrast to the convex approach, any resulting (locally optimal) network is finite even in the presence of infinite data (i.e., if the data distribution is known and the limiting case of infinite samples is considered). Moreover, here we show that approximation guarantees and existing bounds on the network size for finite data are maintained.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

PANNA: Properties from Artificial Neural Network Architectures

We report prediction of material properties from first principles is often a computationally expensive task. Recently, artificial neural networks and other machine learning approaches have been successfully employed to obtain accurate models at a low computational cost by leveraging existing example data. Here, we present a software package “Properties from Artificial Neural Network Architectures” (PANNA) that provides a comprehensive toolkit for creating neural network models for atomistic systems following the Behler–Parrinello topology. Besides the core routines for neural network training, it includes data parser, descriptor builder for Behler–Parrinello class of symmetry functions and force-field generator suitable for integration within molecular dynamics packages. PANNA offers a variety of activation and cost functions, regularization methods, as well as the possibility of using fully-connected networks with custom size for each atomic species. PANNA benefits from the optimization and hardware-flexibility of the underlying TensorFlow engine which allows it to be used on multiple CPU/GPU/TPU systems, making it possible to develop and optimize neural network models based on large datasets.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Unified Medical Language System resources improve sieve-based generation and Bidirectional Encoder Representations from Transformers (BERT)–based ranking for concept normalization

Concept normalization, the task of linking phrases in text to concepts in an ontology, is useful for many downstream tasks including relation extraction, information retrieval, etc. We present a generate-and-rank concept normalization system based on our participation in the 2019 National NLP Clinical Challenges Shared Task Track 3 Concept Normalization. The shared task provided 13 609 concept mentions drawn from 100 discharge summaries. We first design a sieve-based system that uses Lucene indices over the training data, Unified Medical Language System (UMLS) preferred terms, and UMLS synonyms to generate a list of possible concepts for each mention. We then design a listwise classifier based on the BERT (Bidirectional Encoder Representations from Transformers) neural network to rank the candidate concepts, integrating UMLS semantic types through a regularizer. Our generate-and-rank system was third of 33 in the competition, outperforming the candidate generator alone (81.66% vs 79.44%) and the previous state of the art (76.35%). During postevaluation, the model’s accuracy was increased to 83.56% via improvements to how training data are generated from UMLS and incorporation of our UMLS semantic type regularizer. Analysis of the model shows that prioritizing UMLS preferred terms yields better performance, that the UMLS semantic type regularizer results in qualitatively better concept predictions, and that the model performs well even on concepts not seen during training. Our generate-and-rank framework for UMLS concept normalization integrates key UMLS features like preferred terms and semantic types with a neural network–based ranking model to accurately link phrases in text to UMLS concepts.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2020

Quantum self-authenticating timing system

An improved method of distributing timing information is provided. The method includes transmitting encrypted timing signals from two or more beacons at different locations. The encrypted timing signals are transmitted at regular intervals and are received by a receiver. The receiver then performs a logic operation on the encrypted timing signals and validates, based on the logic operation, the authenticity of the timing signals. The logic operation also results in a decrypted message from the beacons, which can contain additional information, for example, data to be sent back to the beacons to verify receipt.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1990

Resolution of the 1D regularized Burgers equation using a spatial wavelet approximation

The Burgers equation with a small viscosity term, initial and periodic boundary conditions is resolved using a spatial approximation constructed from an orthonormal basis of wavelets. The algorithm is directly derived from the notions of multiresolution analysis and tree algorithms. Before the numerical algorithm is described these notions are first recalled. The method uses extensively the localization properties of the wavelets in the physical and Fourier spaces. Moreover, the authors take advantage of the fact that the involved linear operators have constant coefficients. Finally, the algorithm can be considered as a time marching version of the tree algorithm. The most important point is that an adaptive version of the algorithm exists: it allows one to reduce in a significant way the number of degrees of freedom required for a good computation of the solution. Numerical results and description of the different elements of the algorithm are provided in combination with different mathematical comments on the method and some comparison with more classical numerical algorithms.

Liandrat, J.↗
DOE OSTI2018

Topology optimization of finite strain viscoplastic systems under transient loads [Dynamic topology optimization based on finite strain visco-plasticity]

In this paper, a transient finite strain viscoplastic model is implemented in a gradient-based topology optimization framework to design impact mitigating structures. The model's kinematics relies on the multiplicative split of the deformation gradient, and the constitutive response is based on isotropic hardening viscoplasticity. To solve the mechanical balance laws, the implicit Newmark-beta method is used together with a total Lagrangian finite element formulation. The optimization problem is regularized using a partial differential equation filter and solved using the method of moving asymptotes. Sensitivities required to solve the optimization problem are derived using the adjoint method. To demonstrate the capability of the algorithm, several protective systems are designed, in which the absorbed viscoplastic energy is maximized. Finally, the numerical examples demonstrate that transient finite strain viscoplastic effects can successfully be combined with topology optimization.

42 ENGINEERING↗