Search NASA⌕ Search

SEARCH · Search NASA

Results for “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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

Exploring the spectrum of regularized bosonic string theory

We implement a UV regularization of the bosonic string by truncating its mode expansion and keeping the regularized theory “as diffeomorphism invariant as possible.” We compute the regularized determinant of the 2d Laplacian for the closed string winding around a compact dimension, obtaining the effective action in this way. The minimization of the effective action reliably determines the energy of the string ground state for a long string and/or for a large number of space-time dimensions. We discuss the possibility of a scaling limit when the cutoff is taken to infinity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2019

Pauli–Villars regularization elucidated in Bopp–Podolsky’s generalized electrodynamics

We discuss an inherent Pauli–Villars regularization in Bopp–Podolsky’s generalized electrodynamics. Introducing gauge-fixing terms for Bopp–Podolsky’s generalized electrodynamic action, we realize a unique feature for the corresponding photon propagator with a built-in Pauli–Villars regularization independent of the gauge choice made in Maxwell’s usual electromagnetism. According to our realization, the length dimensional parameter a associated with Bopp–Podolsky’s higher order derivatives corresponds to the inverse of the Pauli–Villars regularization mass scale Λ, i.e. a=1/Λ. Solving explicitly the classical static Bopp–Podolsky’s equations of motion for a specific charge distribution, we explore the physical meaning of the parameter a in terms of the size of the charge distribution. As an offspring of the generalized photon propagator analysis, we also discuss our findings regarding on the issue of the two-term vs. three-term photon propagator in light-front dynamics.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2018

Two-level structural sparsity regularization for identifying lattices and defects in noisy images

Here, this paper presents a regularized regression model with a two-level structural sparsity penalty applied to locate individual atoms in a noisy scanning transmission electron microscopy image (STEM). In crystals, the locations of atoms is symmetric, condensed into a few lattice groups. Therefore, by identifying the underlying lattice in a given image, individual atoms can be accurately located. We propose to formulate the identification of the lattice groups as a sparse group selection problem. Furthermore, real atomic scale images contain defects and vacancies, so atomic identification based solely on a lattice group may result in false positives and false negatives. To minimize error, model includes an individual sparsity regularization in addition to the group sparsity for a within-group selection, which results in a regression model with a two-level sparsity regularization. We propose a modification of the group orthogonal matching pursuit (gOMP) algorithm with a thresholding step to solve the atom finding problem. The convergence and statistical analyses of the proposed algorithm are presented. The proposed algorithm is also evaluated through numerical experiments with simulated images. The applicability of the algorithm on determination of atom structures and identification of imaging distortions and atomic defects was demonstrated using three real STEM images. In conclusion, we believe this is an important step toward automatic phase identification and assignment with the advent of genomic databases for materials.

36 MATERIALS SCIENCE↗
DOE OSTI2019

Epi-Regularization of Risk Measures

Uncertainty pervades virtually every branch of science and engineering, and in many disciplines, the underlying phenomena can be modeled by partial differential equations (PDEs) with uncertain or random inputs. This work is motivated by risk-averse stochastic programming problems constrained by PDEs. These problems are posed in infinite dimensions, which leads to a significant increase in the scale of the (discretized) problem. In order to handle the inherent nonsmoothness of, for example, coherent risk measures and to exploit existing solution techniques for smooth, PDE-constrained optimization problems, we propose a variational smoothing technique called epigraphical (epi-)regularization. Here, we investigate the effects of epi-regularization on the axioms of coherency and prove differentiability of the smoothed risk measures. In addition, we demonstrate variational convergence of the epi-regularized risk measures and prove the consistency of minimizers and first-order stationary points for the approximate risk-averse optimization problem. We conclude with numerical experiments confirming our theoretical results.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

RegularizedOptimization.jl: A Julia framework for regularized and nonsmooth optimization

RegularizedOptimization.jl is a Julia package that implements families of quadratic regularization and trust-region methods for solving the nonsmooth optimization problem $^{\textrm{minimize}}_{𝑥∈ℝ^𝑛}$ 𝑓(𝑥) + ℎ(𝑥) subject to 𝑐(𝑥) = 0, (1) where 𝑓 ∶ ℝ 𝑛 → ℝ and 𝑐 ∶ ℝ 𝑛 → ℝ 𝑚 are continuously differentiable, and ℎ ∶ ℝ 𝑛 → ℝ∪{+∞} is lower semi-continuous. The nonsmooth objective ℎ can be a regularizer, such as a sparsity inducing penalty, model simple constraints, such as 𝑥 belonging to a simple convex set, or can be a combination of both. All 𝑓, ℎ, and 𝑐 can be nonconvex. RegularizedOptimization.jl provides a modular and extensible framework for solving (1), and developing novel solvers. Currently, the following solvers are implemented: • Trust-region solvers TR and TRDH (Aravkin et al., 2022; Leconte & Orban, 2025) • Quadratic regularization solvers R2, R2DH and R2N (Aravkin et al., 2022; Diouane, Habiboullah, et al., 2024) • Levenberg-Marquardt solvers LM and LMTR (Aravkin et al., 2024) used when 𝑓 is a least-squares residual. • Augmented Lagrangian solver AL (De Marchi et al., 2023). All solvers rely on first derivatives of 𝑓 and 𝑐, and optionally on their second derivatives in the form of Hessian-vector products. If second derivatives are not available, quasi-Newton approximations can be used. In addition, the proximal mapping of the nonsmooth part ℎ, or adequate models thereof, must be evaluated. At each iteration, a step is computed by solving a subproblem of the form (1) inexactly, in which 𝑓, ℎ, and 𝑐 are replaced with appropriate models around the current iterate. The solvers R2, R2DH, and TRDH are particularly well suited to solve the subproblems, though they are general enough to solve (1). All solvers are allocation-free, so re-solves incur no additional allocations. To illustrate our claim of extensibility, a first version of the AL solver was implemented by an external contributor. Furthermore, a nonsmooth penalty approach, described in Diouane, Gollier, et al. (2024), is currently being developed, that relies on the library to efficiently solve the subproblems.

Gollier, Maxence [Polytechnique Montréal, QC (Cana↗
DOE OSTI2024

On the connection between least squares, regularization, and classical shadows

Classical shadows (CS) offer a resource-efficient means to estimate quantum observables, circumventing the need for exhaustive state tomography. Here, we clarify and explore the connection between CS techniques and least squares (LS) and regularized least squares (RLS) methods commonly used in machine learning and data analysis. By formal identification of LS and RLS ``shadows'' completely analogous to those in CS---namely, point estimators calculated from the empirical frequencies of single measurements---we show that both RLS and CS can be viewed as regularizers for the underdetermined regime, replacing the pseudoinverse with invertible alternatives. Through numerical simulations, we evaluate RLS and CS from three distinct angles: the tradeoff in bias and variance, mismatch between the expected and actual measurement distributions, and the interplay between the number of measurements and number of shots per measurement. Compared to CS, RLS attains lower variance at the expense of bias, is robust to distribution mismatch, and is more sensitive to the number of shots for a fixed number of state copies---differences that can be understood from the distinct approaches taken to regularization. Conceptually, our integration of LS, RLS, and CS under a unifying ``shadow'' umbrella aids in advancing the overall picture of CS techniques, while practically our results highlight the tradeoffs intrinsic to these measurement approaches, illuminating the circumstances under which either RLS or CS would be preferred, such as unverified randomness for the former or unbiased estimation for the latter.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Ultrasound waveform tomography with spatial and edge regularization

Synthetic-aperture ultrasound tomography systems and methods using scanning arrays and algorithms configured to simultaneously acquire ultrasound transmission and reflection data, and process the data for improved ultrasound tomography imaging, wherein the tomography imaging comprises total-variation regularization, or a modified total variation regularization, particularly with edge-guided or spatially variant regularization.

47 OTHER INSTRUMENTATION↗
DOE OSTI2022

Ultrasound waveform tomography with spatial and edge regularization

Synthetic-aperture ultrasound tomography systems and methods using scanning arrays and algorithms configured to simultaneously acquire ultrasound transmission and reflection data, and process the data for improved ultrasound tomography imaging, wherein the tomography imaging comprises total-variation regularization, or a modified total variation regularization, particularly with edge-guided or spatially variant regularization.

Huang, Lianjie↗
DOE OSTI2022

Posterior Regularized Bayesian Neural Network incorporating soft and hard knowledge constraints

Neural Networks (NNs) have been widely used in supervised learning due to their ability to model complex nonlinear patterns, often presented in high-dimensional data such as images and text. However, traditional NNs often lack the ability for uncertainty quantification. Bayesian NNs (BNNS) could help measure the uncertainty by considering the distributions of the NN model parameters. Besides, domain knowledge is commonly available and could improve the performance of BNNs if it can be appropriately incorporated. In this work, we propose a novel Posterior-Regularized Bayesian Neural Network (PR-BNN) model by incorporating different types of knowledge constraints, such as the soft and hard constraints, as a posterior regularization term. Furthermore, we propose to combine the augmented Lagrangian method and the existing BNN solvers for efficient inference. Furthermore, the experiments in simulation and two case studies about aviation landing prediction and solar energy output prediction have shown the knowledge constraints and the performance improvement of the proposed model over traditional BNNs without the constraints.

14 SOLAR ENERGY↗
DOE OSTI2025

A Regularized Variance-Reduced Modified Extragradient Method for Stochastic Hierarchical Games

We consider an N -player hierarchical game in which the i th player’s objective comprises of an expectation-valued term, parametrized by rival decisions, and a hierarchical term. Such a framework allows for capturing a broad range of stochastic hierarchical optimization problems, Stackelberg equilibrium problems, and leader-follower games. We develop an iteratively regularized and smoothed variance-reduced modified extragradient framework for iteratively approaching hierarchical equilibria in a stochastic setting. We equip our analysis with rate statements, complexity guarantees, and almost-sure convergence results. We then extend these statements to settings where the lower-level problem is solved inexactly and provide the corresponding rate and complexity statements. Our model framework encompasses many game theoretic equilibrium problems studied in the context of power markets. We present a realistic application to the study of virtual power plants, emphasizing the role of hierarchical decision making and regularization. Preliminary numerics suggest that empirical behavior compares well with theoretical guarantees.

Tikhonov regularization↗
DOE OSTI2025

Structure-preserving neural networks for the regularized entropy-based closure of a linear, kinetic, radiative transport equation

The main challenge of large-scale numerical simulation of radiation transport is the high memory and computation time requirements of discretization methods for kinetic equations. In this work, we derive and investigate a neural network-based approximation to the entropy-based closure method to accurately compute the solution of the multi-dimensional moment system with a low memory footprint and competitive computational time. We extend methods developed for the standard entropy-based closure to the regularized entropy-based closures. The main idea is to interpret structure-preserving neural network approximations of the regularized entropy-based closure as a two-stage approximation to the original entropy-based closure. We conduct a numerical analysis of this approximation and investigate optimal parameter choices. Our numerical experiments demonstrate that the method has a much lower memory footprint than traditional methods with competitive computation times and simulation accuracy. The code and all trained networks are provided on GitHub.

entropy closure↗
DOE OSTI2021

Regio‐Regular Polymer Acceptors Enabled by Determined Fluorination on End Groups for All‐Polymer Solar Cells with 15.2 % Efficiency

Abstract Polymerization sites of small molecule acceptors (SMAs) play vital roles in determining device performance of all‐polymer solar cells (all‐PSCs). Different from our recent work about fluoro‐ and bromo‐ co‐modified end group of IC‐FBr (a mixture of IC‐FBr1 and IC‐FBr2), in this paper, we synthesized and purified two regiospecific fluoro‐ and bromo‐ substituted end groups (IC‐FBr‐ o & IC‐FBr‐ m ), which were then employed to construct two regio‐regular polymer acceptors named PYF‐T‐ o and PYF‐T‐ m , respectively . In comparison with its isomeric counterparts named PYF‐T‐ m with different conjugated coupling sites, PYF‐T‐ o exhibits stronger and bathochromic absorption to achieve better photon harvesting. Meanwhile, PYF‐T‐ o adopts more ordered inter‐chain packing and suitable phase separation after blending with the donor polymer PM6, which resulted in suppressed charge recombination and efficient charge transport. Strikingly, we observed a dramatic performance difference between the two isomeric polymer acceptors PYF‐T‐ o and PYF‐T‐ m . While devices based on PM6:PYF‐T‐ o can yield power conversion efficiency (PCE) of 15.2 %, devices based on PM6:PYF‐T‐ m only show poor efficiencies of 1.4 %. This work demonstrates the success of configuration‐unique fluorinated end groups in designing high‐performance regular polymer acceptors, which provides guidelines towards developing all‐PSCs with better efficiencies.

Yu, Han↗
DOE OSTI2021

Regio‐Regular Polymer Acceptors Enabled by Determined Fluorination on End Groups for All‐Polymer Solar Cells with 15.2 % Efficiency

Abstract Polymerization sites of small molecule acceptors (SMAs) play vital roles in determining device performance of all‐polymer solar cells (all‐PSCs). Different from our recent work about fluoro‐ and bromo‐ co‐modified end group of IC‐FBr (a mixture of IC‐FBr1 and IC‐FBr2), in this paper, we synthesized and purified two regiospecific fluoro‐ and bromo‐ substituted end groups (IC‐FBr‐ o & IC‐FBr‐ m ), which were then employed to construct two regio‐regular polymer acceptors named PYF‐T‐ o and PYF‐T‐ m , respectively . In comparison with its isomeric counterparts named PYF‐T‐ m with different conjugated coupling sites, PYF‐T‐ o exhibits stronger and bathochromic absorption to achieve better photon harvesting. Meanwhile, PYF‐T‐ o adopts more ordered inter‐chain packing and suitable phase separation after blending with the donor polymer PM6, which resulted in suppressed charge recombination and efficient charge transport. Strikingly, we observed a dramatic performance difference between the two isomeric polymer acceptors PYF‐T‐ o and PYF‐T‐ m . While devices based on PM6:PYF‐T‐ o can yield power conversion efficiency (PCE) of 15.2 %, devices based on PM6:PYF‐T‐ m only show poor efficiencies of 1.4 %. This work demonstrates the success of configuration‐unique fluorinated end groups in designing high‐performance regular polymer acceptors, which provides guidelines towards developing all‐PSCs with better efficiencies.

Yu, Han↗
DOE OSTI2017

Viscous regularization of the full set of nonequilibrium-diffusion Grey Radiation-Hydrodynamic equations

A viscous regularization technique, based on the local entropy residual, was proposed by Delchini et al. (2015) to stabilize the nonequilibrium-diffusion Grey Radiation-Hydrodynamic equations using an artificial viscosity technique. This viscous regularization is modulated by the local entropy production and is consistent with the entropy minimum principle. However, Delchini et al. (2015) only based their work on the hyperbolic parts of the Grey Radiation-Hydrodynamic equations and thus omitted the relaxation and diffusion terms present in the material energy and radiation energy equations. Here in this paper, we extend the theoretical grounds for the method and derive an entropy minimum principle for the full set of nonequilibrium-diffusion Grey Radiation-Hydrodynamic equations. This further strengthens the applicability of the entropy viscosity method as a stabilization technique for radiation-hydrodynamic shock simulations. Radiative shock calculations using constant and temperature-dependent opacities are compared against semi-analytical reference solutions, and we present a procedure to perform spatial convergence studies of such simulations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2016

The LPM effect in sequential bremsstrahlung: dimensional regularization

The splitting processes of bremsstrahlung and pair production in a medium are coherent over large distances in the very high energy limit, which leads to a suppression known as the Landau-Pomeranchuk-Migdal (LPM) effect. Of recent interest is the case when the coherence lengths of two consecutive splitting processes overlap (which is important for understanding corrections to standard treatments of the LPM effect in QCD). In previous papers, we have developed methods for computing such corrections without making soft-gluon approximations. However, our methods require consistent treatment of canceling ultraviolet (UV) divergences associated with coincident emission times, even for processes with tree-level amplitudes. In this paper, we show how to use dimensional regularization to properly handle the UV contributions. We also present a simple diagnostic test that any consistent UV regularization method for this problem needs to pass.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2015

Regularization of the light-cone gauge gluon propagator singularities using sub-gauge conditions

Perturbative QCD calculations in the light-cone gauge have long suffered from the ambiguity associated with the regularization of the poles in the gluon propagator. In this work we study sub-gauge conditions within the light-cone gauge corresponding to several known ways of regulating the gluon propagator. By using the functional integral calculation of the gluon propagator, we rederive the known sub-gauge conditions for the θ-function gauges and identify the sub-gauge condition for the principal value (PV) regularization of the gluon propagator’s light-cone poles. The obtained sub-gauge condition for the PV case is further verified by a sample calculation of the classical Yang-Mills field of two collinear ultrarelativistic point color charges. Our method does not allow one to construct a sub-gauge condition corresponding to the well-known Mandelstam-Leibbrandt prescription for regulating the gluon propagator poles.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2018

Groups with Almost Regular and Almost Perfect Involutions

We establish the solubility of a group with Sylow 2-subgroup of the least order in the centralizer of an almost regular involution. We also study the structure of a group G with an almost perfect and almost regular involution a.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Enumeration of Regular Maps on Surfaces of a Given Genus

We enumerate the labelled and unlabelled d-regular maps on two-dimensional oriented surfaces of arbitrary genus g. The case of d-regular maps with a single face is considered separately in more detail.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗