On approximation of functions, topological mappings and nonlinear feedback control systems
Topological mappings for use in design of optimal nonlinear feedback control systems
Athans, M.↗
SEARCH · Search NASA
Results for “NONLINEAR MAPPING APPROXIMATOR”
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.
Synthesis of minimum-time feedback laws for dynamic systems using neural networks
The paper presents the synthesis of neural network based feedback laws for dynamic systems using the computed optimal and time histories of the state and control variables. The efficacy of the proposed approach has been successfully demonstrated on a minimum time orbit injection problem. If the method is found to be effective to real life problems with many state and control variables, it can used for a variety of guidance and control problems.
TRT-THEORETICAL↗
DeepONet-grid-UQ: A trustworthy deep operator framework for predicting the power grid’s post-fault trajectories
This paper proposes a novel data-driven method for the reliable prediction of the power grid’s post-fault trajectories, i.e., the power grid’s dynamic response after a disturbance or fault. Here, the proposed method is based on the recently proposed concept of Deep Operator Networks (DeepONets). Unlike traditional neural networks that learn to approximate functions, DeepONets are designed to approximate nonlinear operators, i.e., mappings between infinite-dimensional spaces. Under this operator framework, we design a novel and efficient DeepONet that (i) takes as inputs the trajectories collected before and during the fault and (ii) outputs the predicted post-fault trajectories. In addition, we endow our method with the much-needed ability to balance efficiency with reliable/trustworthy predictions via uncertainty quantification. To this end, we propose and compare two novel methods that enable quantifying the predictive uncertainty. First, we propose a Bayesian DeepONet (B-DeepONet) that uses stochastic gradient Hamiltonian Monte-Carlo to sample from the posterior distribution of the DeepONet trainable parameters. Then, we design a Probabilistic DeepONet (Prob-DeepONet) that uses a probabilistic training strategy to enable quantifying uncertainty at virtually no extra computational cost. Finally, we validate the proposed methods’ predictive power and uncertainty quantification capability using the New York-New England power grid model.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Design of multi-layer neural networks for accurate identification of nonlinear mappings
Guidelines for the design of multilayer neural networks for the identification of nonlinear mappings are considered. Since nonlinear mappings can be approximated by a one-hidden-layer neural network, an approach to determine the sufficient number of hidden layer nodes to achieve a global minima of the identification error function is considered.
Teixeira, Edilberto↗
Optimum receiver structures for phase-multiplexed modulations
A MAP (maximum a posteriori) estimation loop is derived for a QPSK signal and, by suitable approximation to the nonlinearity which arises as a consequence of the MAP theory, is reconfigured with practical realizations that are valid for high and low SNRs. In particular, it is shown that by approximating the hyperbolic tangent nonlinearity in the MAP estimation loop by the first two terms in its power series, an interesting practical realization of this loop results which applies at low SNRs. The error signal in this loop is formed by multiplying the error signal and lock detector output signal of a conventional biphase Costas loop. A generalized linear in-phase channel configuration is proposed which allows carrier reconstruction from an unbalanced QPSK signal at all ratios of data rates and powers in the two channels, even in the limit as these ratios simultaneously approach unity, i.e., balanced quadriphase.
Simon, M. K.↗
Nonlinear dimension reduction for surrogate modeling using gradient information
We introduce a method for the nonlinear dimension reduction of a high-dimensional function $u:{\mathbb{R}}^d\rightarrow{\mathbb{R}}$, $d\gg 1$. Our objective is to identify a nonlinear feature map $g:{\mathbb{R}}^d\rightarrow{\mathbb{R}}^m$, with a prescribed intermediate dimension $m\ll d$, so that $u$ can be well approximated by $f\circ g$ for some profile function $f:{\mathbb{R}}^m\rightarrow{\mathbb{R}}$. We propose to build the feature map by aligning the Jacobian $\nabla g$ with the gradient $\nabla u$, and we theoretically analyze the properties of the resulting $g$. Once $g$ is built, we construct $f$ by solving a gradient-enhanced least squares problem. Our practical algorithm uses a sample $\{{\textbf{x}}^{(i)},u({\textbf{x}}^{(i)}),\nabla u({\textbf{x}}^{(i)})\}_{i=1}^N$ and builds both $g$ and $f$ on adaptive downward-closed polynomial spaces, using cross validation to avoid overfitting. We numerically evaluate the performance of our algorithm across different benchmarks, and explore the impact of the intermediate dimension $m$. We show that building a nonlinear feature map $g$ can permit more accurate approximation of $u$ than a linear $g$, for the same input data set.
97 MATHEMATICS AND COMPUTING↗
Data-Driven Modeling and Correction of Vehicle Dynamics
We develop a data-driven framework for learning and correcting nonautonomous vehicle dynamics. Physics-based vehicle models are often simplified for tractability and therefore exhibit inherent model-form uncertainty, motivating the need for data-driven correction. Moreover, nonautonomous dynamics are governed by time-dependent control inputs, which pose challenges in learning predictive models directly from temporal snapshot data. To address these, we reformulate the vehicle dynamics via a local parameterization of the time-dependent inputs, yielding a modified system composed ofa sequence of local parametric dynamical systems. Here, we approximate these parametric systems using two complementary approaches. First, we employ the dimension reduction and interpolation in parameter space (DRIPS) methodology to construct efficient linear surrogate models, equipped with lifted observable spaces and manifold-based operator interpolation. This enables data-efficient learning of vehicle models whose dynamics admit accurate linear representations in the lifted spaces. Second, for more strongly nonlinear systems, we employ flow map learning (FML), a deep neural network (DNN) approach that approximates the parametric evolution map without requiring special treatment of nonlinearities. We further extend FML with a transfer-learning-based model correction procedure, enabling the correction of misspecified prior models using only a sparse set of high-fidelity or experimental measurements, without assuming a prescribed form for the correction term. Through a suite of numerical experiments on unicycle, simplified bicycle, and slip-based bicycle models, we demonstrate that DRIPS offers robust and highly data-efficient learning of nonautonomous vehicle dynamics, while FML provides expressive nonlinear modeling and effective correction of model-form errors under severe data scarcity.
data-driven modeling↗
Application of Contraction Mappings to the Control of Nonlinear Systems
The theoretical and applied aspects of successive approximation techniques are considered for the determination of controls for nonlinear dynamical systems. Particular emphasis is placed upon the methods of contraction mappings and modified contraction mappings. It is shown that application of the Pontryagin principle to the optimal nonlinear regulator problem results in necessary conditions for optimality in the form of a two point boundary value problem (TPBVP). The TPBVP is represented by an operator equation and functional analytic results on the iterative solution of operator equations are applied. The general convergence theorems are translated and applied to those operators arising from the optimal regulation of nonlinear systems. It is shown that simply structured matrices and similarity transformations may be used to facilitate the calculation of the matrix Green functions and the evaluation of the convergence criteria. A controllability theory based on the integral representation of TPBVP's, the implicit function theorem, and contraction mappings is developed for nonlinear dynamical systems. Contraction mappings are theoretically and practically applied to a nonlinear control problem with bounded input control and the Lipschitz norm is used to prove convergence for the nondifferentiable operator. A dynamic model representing community drug usage is developed and the contraction mappings method is used to study the optimal regulation of the nonlinear system.
Killingsworth, W. R., Jr.↗
Trust-Enhancing Probabilistic Transfer Learning for Sparse and Noisy Data Environments
There is an increasing aspiration to utilize machine learning (ML) for various tasks of relevance to national security. ML models have thus far been mostly applied to tasks and domains that, while impactful, have sufficient volume of data. For predictive tasks of national security relevance, ML models of great capacity (ability to approximate nonlinear trends in input-output maps) are often needed to capture the complex underlying physics. However, scientific problems of relevance to national security are often accompanied by various sources of sparse and/or incomplete data, including experiments and simulations, across different regimes of operation, of varying degrees of fidelity, and include noise with different characteristics and/or intensity. State-of-the-art ML models, despite exhibiting superior performance on the task and domain they were trained on, may suffer detrimental loss in performance in such sparse data environments. This report summarizes the results of the Laboratory Directed Research and Development project entitled Trust-Enhancing Probabilistic Transfer Learning for Sparse and Noisy Data Environments. The objective of the project was to develop a new transfer learning (TL) framework that aims to adaptively blend the data across different sources in tackling one task of interest, resulting in enhanced trustworthiness of ML models for mission- and safety-critical systems. The proposed framework determines when it is worth applying TL and how much knowledge is to be transferred, despite uncontrollable uncertainties. The framework accomplishes this by leveraging concepts and techniques from the fields of Bayesian inverse modeling and uncertainty quantification, relying on strong mathematical foundations of probability and measure theories to devise new uncertainty-aware TL workflows.
97 MATHEMATICS AND COMPUTING↗
Kernel Manifolds: Nonlinear‐Augmentation Dimensionality Reduction Using Reproducing Kernel Hilbert Spaces
This paper generalizes recent advances on quadratic manifold (QM) dimensionality reduction by developing kernel methods-based nonlinear-augmentation dimensionality reduction. QMs, and more generally feature map-based nonlinear corrections, augment linear dimensionality reduction with a nonlinear correction term in the reconstruction map to overcome approximation accuracy limitations of purely linear approaches. While feature map-based approaches typically learn a least squares optimal polynomial correction term, we generalize this approach by learning an optimal nonlinear correction from a user-defined reproducing kernel Hilbert space. Our approach allows one to impose arbitrary nonlinear structure on the correction term, including polynomial structure, and includes feature map and radial basis function-based corrections as special cases. Furthermore, our method has relatively low training cost and has monotonically decreasing error as the latent space dimension increases. In conclusion, we compare our approach to proper orthogonal decomposition and several recent QM approaches on data from several example problems.
kernel methods↗
A Multi-Resolution Nonlinear Mapping Technique for Design and Analysis Application
This report describes a nonlinear mapping technique where the unknown static or dynamic system is approximated by a sum of dimensionally increasing functions (one-dimensional curves, two-dimensional surfaces, etc.). These lower dimensional functions are synthesized from a set of multi-resolution basis functions, where the resolutions specify the level of details at which the nonlinear system is approximated. The basis functions also cause the parameter estimation step to become linear. This feature is taken advantage of to derive a systematic procedure to determine and eliminate basis functions that are less significant for the particular system under identification. The number of unknown parameters that must be estimated is thus reduced and compact models obtained. The lower dimensional functions (identified curves and surfaces) permit a kind of "visualization" into the complexity of the nonlinearity itself.
Phan, Minh Q.↗
A Multi-Resolution Nonlinear Mapping Technique for Design and Analysis Applications
This report describes a nonlinear mapping technique where the unknown static or dynamic system is approximated by a sum of dimensionally increasing functions (one-dimensional curves, two-dimensional surfaces, etc.). These lower dimensional functions are synthesized from a set of multi-resolution basis functions, where the resolutions specify the level of details at which the nonlinear system is approximated. The basis functions also cause the parameter estimation step to become linear. This feature is taken advantage of to derive a systematic procedure to determine and eliminate basis functions that are less significant for the particular system under identification. The number of unknown parameters that must be estimated is thus reduced and compact models obtained. The lower dimensional functions (identified curves and surfaces) permit a kind of "visualization" into the complexity of the nonlinearity itself.
Phan, Minh Q.↗
Nonlinear functional approximation with networks using adaptive neurons
A novel mathematical framework for the rapid learning of nonlinear mappings and topological transformations is presented. It is based on allowing the neuron's parameters to adapt as a function of learning. This fully recurrent adaptive neuron model (ANM) has been successfully applied to complex nonlinear function approximation problems such as the highly degenerate inverse kinematics problem in robotics.
Tawel, Raoul↗
Hierarchical ensemble Kalman methods with sparsity-promoting generalized gamma hyperpriors
This paper introduces a computational framework to incorporate flexible regularization techniques in ensemble Kalman methods, generalizing the iterative alternating scheme to nonlinear inverse problems. The proposed methodology approximates the maximum a posteriori (MAP) estimate of a hierarchical Bayesian model characterized by a conditionally Gaussian prior and generalized gamma hyperpriors. Suitable choices of hyperparameters yield sparsity-promoting regularization. We propose an iterative algorithm for MAP estimation, which alternates between updating the unknown with an ensemble Kalman method and updating the hyperparameters in the regularization to promote sparsity. Here, the effectiveness of our methodology is demonstrated in several computed examples, including compressed sensing and subsurface flow inverse problems.
Ensemble Kalman methods↗
Mathematical methods for optimal polynomial recovery of high-dimensional systems from noisy data
The goal of our Early Career Research Project (ECRP) is to establish a modern mathematical foundation that will enable next-generation computational methods for polynomial approximation of high-dimensional systems, having a certain set of constraints, from a limited amount of noisy data. Such a foundation is critical to realizing the future potential of the DOE user facilities, and will ultimately empower scientists to address a fundamental question, namely, “how many realizations of a nonlinear manifold are required to recover the entire high-dimensional solution map, with optimal approximation guarantees and minimal computational cost?” The central theme of this effort aims to conquer this challenge by pioneering the development of extraordinarily innovative theoretical analysis and transformational non-intrusive computational methodologies. Such approaches will enable the reconstruction of the entire high-dimensional solution map, with accuracy comparable to the best approximation, while utilizing an optimal number of samples. During this reporting period we have made significant progress on four thrusts.
97 MATHEMATICS AND COMPUTING↗
Influence of doping and thickness on domain avalanches in lead zirconate titanate thin films
In undoped lead zirconate titanate films of 1–2 μm thick, domain walls move in clusters with a correlation length of approximately 0.5–2 μm. Band excitation piezoresponse force microscopy mapping of the piezoelectric nonlinearity revealed that niobium (Nb) doping increases the average concentration or mobility of domain walls without changing the cluster area of correlated domain wall motion. In comparison, manganese (Mn) doping reduces the contribution of mobile domain walls to the dielectric and piezoelectric responses without changing the cluster area for correlated motion. In both Nb and Mn doped films, the cluster area increases and the cluster density drops as the film thickness increases from 250 to 1250 nm. This is evident in spatial maps generated from the analysis of irreversible to reversible ratios of the Rayleigh coefficients.
36 MATERIALS SCIENCE↗
Non-Gaussian microwave background fluctuations from nonlinear gravitational effects
Whether the statistics of primordial fluctuations for structure formation are Gaussian or otherwise may be determined if the Cosmic Background Explorer (COBE) Satellite makes a detection of the cosmic microwave-background temperature anisotropy delta T(sub CMB)/T(sub CMB). Non-Gaussian fluctuations may be generated in the chaotic inflationary model if two scalar fields interact nonlinearly with gravity. Theoretical contour maps are calculated for the resulting Sachs-Wolfe temperature fluctuations at large angular scales (greater than 3 degrees). In the long-wavelength approximation, one can confidently determine the nonlinear evolution of quantum noise with gravity during the inflationary epoch because: (1) different spatial points are no longer in causal contact; and (2) quantum gravity corrections are typically small-- it is sufficient to model the system using classical random fields. If the potential for two scalar fields V(phi sub 1, phi sub 2) possesses a sharp feature, then non-Gaussian fluctuations may arise. An explicit model is given where cold spots in delta T(sub CMB)/T(sub CMB) maps are suppressed as compared to the Gaussian case. The fluctuations are essentially scale-invariant.
Salopek, D. S.↗
Learning Optimal Power Flow Solutions using Linearized Models in Power Distribution Systems
Solving nonlinear optimal power flow (OPF) problem is computationally expensive, and poses scalability challenges for power distribution networks. An alternative to solving the original nonlinear OPF is the linear approximated OPF models. Although, these linear approximated OPF models are fast, the resulting solutions may result in significant optimality gap. Lately, the application of machine learning (ML) methods in successfully solving the nonlinear OPF has been reported. These methods learn and estimate the nonlinear control policies using a purely data-driven approach. In this paper, we propose an approach to complements the ML based approach to solving OPF using solutions from known linearized OPF model. Specifically, we use supervised learning to map the solutions of linear OPF to nonlinear control variables. Unlike, the traditional ML based methods for OPF that approximate the full distribution feeder model using function approximation, our approach uses a two-node approximation of radial networks. The proposed approach is validated using IEEE 123 bus test system for OPF solutions obtained using the nonlinear OPF models.
optimal power flow, power distribution systems, su↗