Search NASA⌕ Search

SEARCH · Search NASA

Results for “Distributionally robust optimization”

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 271 records · Page 15

Joint Non-Parametric Correction Estimator for Excess Relative Risk Regression in Survival Analysis with Exposure Measurement Error

Summary Observational epidemiological studies often confront the problem of estimating exposure–disease relationships when the exposure is not measured exactly. We investigate exposure measurement error in excess relative risk regression, which is a widely used model in radiation exposure effect research. In the study cohort, a surrogate variable is available for the true unobserved exposure variable. The surrogate variable satisfies a generalized version of the classical additive measurement error model, but it may or may not have repeated measurements. In addition, an instrumental variable is available for individuals in a subset of the whole cohort. We develop a non-parametric correction estimator by using data from the subcohort and further propose a joint non-parametric correction estimator using all observed data to adjust for exposure measurement error. An optimal linear combination estimator of the joint non-parametric correction and non-parametric correction is further developed. The estimators proposed are non-parametric, which are consistent without imposing a covariate or error distribution, and are robust to heteroscedastic errors. Finite sample performance is examined via a simulation study. We apply the developed methods to data from the Radiation Effects Research Foundation, in which chromosome aberration is used to adjust for the effects of radiation dose measurement error on the estimation of radiation dose responses.

Wang, Ching-Yun↗

Robust Decentralized Learning Using ADMM With Unreliable Agents

Many signal processing and machine learning problems can be formulated as consensus optimization problems which can be solved efficiently via a cooperative multi-agent system. However, the agents in the system can be unreliable due to a variety of reasons: noise, faults and attacks. Providing erroneous updates leads the optimization process in a wrong direction, and degrades the performance of distributed machine learning algorithms. This paper considers the problem of decentralized learning using ADMM in the presence of unreliable agents. First, we rigorously analyze the effect of erroneous updates (in ADMM learning iterations) on the convergence behavior of the multi-agent system. We show that the algorithm linearly converges to a neighborhood of the optimal solution under certain conditions and characterize the neighborhood size analytically. Next, we provide guidelines for network design to achieve a faster convergence to the neighborhood. Here, we also provide conditions on the erroneous updates for exact convergence to the optimal solution. Finally, to mitigate the influence of unreliable agents, we propose ROAD , a robust variant of ADMM, and show its resilience to unreliable agents with an exact convergence to the optimum.

97 MATHEMATICS AND COMPUTING↗

Resilient Autonomous Wind Farms

With the advent of an increasing number of control strategies that seek to optimize wind turbine performance on a farm level, taking into account individual wind turbine information to achieve wind-farm-level objectives has become an increasingly important goal. Methods for controlling wind turbines on an individual and farm level have experienced significant development, and an abundance of new implementations for gathering and using data from turbines have created potential for novel control mechanisms that can further optimize the performance and delivery characteristics of a wind farm. A key element of making these wind farms more efficient is to develop reliable algorithms that use local sensor information that is already being collected, such as from local meteorological stations, nearby radars, sodars, and lidars, and supervisory control and data acquisition (SCADA) data. Making use of information from all wind turbines in a wind farm can enable such approaches as determining the atmospheric conditions across the farm, improving fault-finding, and ensuring more efficient overall control of farmwide optimizations through mechanisms such as wake steering. However, these approaches typically involve a centralized communications and control center. In order to ensure the resilient operation of the farm, it is necessary to develop an approach that distributes the calculation and communication amongst multiple nodes throughout the farm. In this fashion, a redundant, robust, and secure network can be created, which can tolerate faults in calculation, communication, and even external attacks that seek to disrupt the operation of the wind farm. This paper introduces the use of the Raft-Byzantine-Fault-Tolerant algorithm in the implementation of autonomous control of a wind farm. This implementation will allow for fault tolerance for malfunctioning nodes, sensors, transmitters, and connectors. This approach is equally extensible to account for malicious actors. It will...

fault tolerance↗

Sequential ensemble transform for Bayesian inverse problems

In this work, we present the Sequential Ensemble Transform (SET) method, an approach for generating approximate samples from a Bayesian posterior distribution. The method explores the posterior distribution by solving a sequence of discrete optimal transport problems to produce a series of transport plans which map prior samples to posterior samples. We prove that the sequence of Dirac mixture distributions produced by the SET method converges weakly to the true posterior as the sample size approaches infinity. Furthermore, our numerical results indicate that, when compared to standard Sequential Monte Carlo (SMC) methods, the SET approach is more robust to the choice of Markov mutation kernels and requires less computational efforts to reach a similar accuracy when used to explore complex posterior distributions. Finally, we describe adaptive schemes that allow to completely automate the use of the SET method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SU-E-T-144: Bayesian Inference of Local Relapse Data Using a Poisson-Based Tumour Control Probability Model

Purpose: The purpose of this project is to develop a robust method of parameter estimation for a Poisson-based TCP model using Bayesian inference. Methods: Bayesian inference was performed using the PyMC3 probabilistic programming framework written in Python. A Poisson-based TCP regression model that accounts for clonogen proliferation was fit to observed rates of local relapse as a function of equivalent dose in 2 Gy fractions for a population of 623 stage-I non-small-cell lung cancer patients. The Slice Markov Chain Monte Carlo sampling algorithm was used to sample the posterior distributions, and was initiated using the maximum of the posterior distributions found by optimization. The calculation of TCP with each sample step required integration over the free parameter α, which was performed using an adaptive 24-point Gauss-Legendre quadrature. Convergence was verified via inspection of the trace plot and posterior distribution for each of the fit parameters, as well as with comparisons of the most probable parameter values with their respective maximum likelihood estimates. Results: Posterior distributions for α, the standard deviation of α (σ), the average tumour cell-doubling time (Td), and the repopulation delay time (Tk), were generated assuming α/β = 10 Gy, and a fixed clonogen density of 10{sup 7} cm−{sup 3}. Posterior predictive plots generated from samples from these posterior distributions are in excellent agreement with the observed rates of local relapse used in the Bayesian inference. The most probable values of the model parameters also agree well with maximum likelihood estimates. Conclusion: A robust method of performing Bayesian inference of TCP data using a complex TCP model has been established.

60 APPLIED LIFE SCIENCES↗

4D beam matrix reconstruction in particle accelerators

Transverse beam parameters in particle accelerators are commonly described using the Twiss parameters, which are experimentally accessible yet inherently limited because they neglect correlations between different transverse coordinates. Such correlations frequently arise from uncompensated cathode magnetic fields or misaligned focusing quadrupoles, affecting beam quality and accelerator performance. To address this limitation, we propose and validate a novel diagnostic method for the complete four-dimensional (4D) transverse beam matrix. Our method involves passing the beam through a beamline comprising both conventional and skew quadrupole magnets, followed by downstream measurements of the resulting two-dimensional (2D) beam profiles. These measurements represent distinct 2D projections of the underlying 4D transverse phase–space distribution. By systematically varying quadrupole strengths, multiple independent projections of the beam phase space are obtained. We reconstruct the original 4D beam matrix from these measured projections using an optimization-based least-square fit, providing fast and robust reconstruction regardless of the specific beamline configuration. Through extensive numerical simulations and realistic particle-tracking studies, we demonstrate the diagnostic’s accuracy, robustness, and capability to achieve reconstruction uncertainties smaller than measurement errors, particularly when employing sufficient numbers of quadrupole scans. This method presents a powerful and flexible approach for comprehensive beam characterization and accelerator tuning.

43 PARTICLE ACCELERATORS↗

A Robust Load Shedding Strategy for Microgrid Islanding Transition

A microgrid is a group of interconnected loads and distributed energy resources. It can operate in either gridconnected mode to exchange energy with the main grid or run autonomously as an island in emergency mode. However, the transition of microgrid from grid-connected mode to islanded mode is usually associated with excessive load (or generation), which should be shed (or spilled). Under this condition, this paper proposes an robust load shedding strategy for microgrid islanding transition, which takes into account the uncertainties of renewable generation in the microgrid and guarantees the balance between load and generation after islanding. A robust optimization model is formulated to minimize the total operation cost, including fuel cost and penalty for load shedding. The proposed robust load shedding strategy works as a backup plan and updates at a prescribed interval. It assures a feasible operating point after islanding given the uncertainty of renewable generation. The proposed algorithm is demonstrated on a simulated microgrid consisting of a wind turbine, a PV panel, a battery, two distributed generators (DGs), a critical load and a interruptible load. Numerical simulation results validate the proposed algorithm.

Liu, Guodong↗

Consensus-Based Control and Optimization of Power System Inertia

The integration of distributed energy resources (DERs), such as solar, wind, and energy storage systems, into power grids through inverter-based resources reduces power system inertia, leading to faster frequency dynamics and potential grid instability. To address this challenge, this paper proposes a distributed, consensus-based approach for the real-time control and optimization of inertia sources (synchronous generators and/or DERs) during system disturbances, enhancing both system stability and economic performance. The distributed control and optimization approach assumes each inertia source exchanges information solely with its neighbor ones, making it easily scalable to large power grid networks. The impacts of the communication connectivity among the inertia sources as well as their generation capacity limits on the distributed approach are investigated. We also demonstrate the approach’s robustness in scenarios involving communication time delays and packet losses, validating its effectiveness through numerical simulations on a 4-bus test system and a two-area 8-bus test system.

Power system inertia↗

International Conference on Advances in Communication and Control Systems, 1st, Washington, DC, June 18-20, 1987, Proceedings

Theoretical models of communication and control systems are discussed in reviews and reports. Topics addressed include smoothing and identification for random fields, the information and coding capacities of mismatched Gaussian channels, recursive least-squares estimation and Kalman filtering by systolic arrays, Kemp echo digital filters, a periodic test-scheduling scheme for communication and queuing processes, and receivers for direct-sequence systems. Consideration is given to a distributed-parameter model for detecting cracks in rotors, active control of aeroelastic systems governed by functional differential equations, robust multivariable control of large space structures, finite-rank relatively bounded perturbations of semigroup generators, and sensitivity analysis of convex optimal-control problems.

Declaris, Nicholas↗

A New Monte Carlo Filtering Method for the Diagnosis of Mission-Critical Failures

Testing large-scale systems is expensive in terms of both time and money. Running simulations early in the process is a proven method of finding the design faults likely to lead to critical system failures, but determining the exact cause of those errors is still time-consuming and requires access to a limited number of domain experts. It is desirable to find an automated method that explores the large number of combinations and is able to isolate likely fault points. Treatment learning is a subset of minimal contrast-set learning that, rather than classifying data into distinct categories, focuses on finding the unique factors that lead to a particular classification. That is, they find the smallest change to the data that causes the largest change in the class distribution. These treatments, when imposed, are able to identify the settings most likely to cause a mission-critical failure. This research benchmarks two treatment learning methods against standard optimization techniques across three complex systems, including two projects from the Robust Software Engineering (RSE) group within the National Aeronautics and Space Administration (NASA) Ames Research Center. It is shown that these treatment learners are both faster than traditional methods and show demonstrably better results.

Gay, Gregory↗

Quantum Technologies for UAS (QTech)

Recent advances in small Unmanned Aerial System (sUAS) technologies lower the barriers for use by both private and commercial entities. However, these advances are also likely to lead to greater vehicle densities, a more heterogenous mix of vehicles and equipment and greater levels of vehicle autonomy, which can increase the chance for communications disruptions. For the safe and secure operation of these vehicles, it is essential to have a robust communications network. This work is focused on harnessing the power of quantum technologies to enable this robust communications network by: (1) utilizing quantum optimization algorithms to design robust network with routing redundancy that can respond adaptively to dynamically changing real-time environment and disruptions, (2) utilize quantum optimization algorithms resource allocation for detection, localization, and tracking of mobile communication disruption agents and (3) utilize quantum key distribution (QKD) to execute secure key sharing in anti-jamming protocols for secure radio frequency (RF) communication. Efforts to map these quantum optimization algorithms to commercially available quantum annealers and soon to be available general-purpose gate-model quantum hardware architectures will be reviewed, and plans for testing the solutions to these algorithms through indoor sUAS flight tests will be discussed. Lastly, efforts to miniaturize and practically deploy Quantum Key Distribution (QKD) hardware, which could ultimately be used to securely exchange encryption keys, in sUAS networks will be reviewed.

Quantum Computing↗

Coupled Retrieval of Aerosol Properties and Surface Reflection Using the Airborne Multi-Angle SpectroPolarimetric Imager (AirMSPI)

The Airborne Multi-angle SpectroPolarimetric Imager (AirMSPI) has been flying aboard the NASA ER-2 high altitude aircraft since October 2010. In step-and-stare operation mode, AirMSPI acquires radiance and polarization data at 355, 380, 445, 470*, 555, 660*, 865*, and 935 nm (* denotes polarimetric bands). The imaged area covers about 10 km by 10 km and is observed from 9 view angles between ±67° off of nadir. We have developed an efficient and flexible code that uses the information content of AirMSPI data for a coupled retrieval of aerosol properties and surface reflection. The retrieval was built based on the multi-pixel optimization concept, with the use of a hybrid radiative transfer model that combines the Markov Chain and adding/doubling methods. The convergence and robustness of our algorithm is ensured by applying constraints on (a) the spectral variation of the Bidirectional Polarization Distribution Function (BPDF) and angular shape of the Bidirectional Reflectance Distribution Function (BRDF); (b) the spectral variation of aerosol optical properties; and (c) the spatial variation of aerosol parameters across neighboring image pixels. Our retrieval approach has been tested using over 20 AirMSPI datasets having low to moderately high aerosol loadings (~0.02<AOD550-nm<~0.45) and acquired during several field campaigns. Results are compared with AERONET aerosol reference data. We also explore the benefits of AirMSPI’s ultraviolet and polarimetric bands as well as the use of multiple view angles.

Xu, Feng↗

AP-Cloud: Adaptive Particle-in-Cloud method for optimal solutions to Vlasov–Poisson equation

We propose a new adaptive Particle-in-Cloud (AP-Cloud) method for obtaining optimal numerical solutions to the Vlasov–Poisson equation. Unlike the traditional particle-in-cell (PIC) method, which is commonly used for solving this problem, the AP-Cloud adaptively selects computational nodes or particles to deliver higher accuracy and efficiency when the particle distribution is highly non-uniform. Unlike other adaptive techniques for PIC, our method balances the errors in PDE discretization and Monte Carlo integration, and discretizes the differential operators using a generalized finite difference (GFD) method based on a weighted least square formulation. As a result, AP-Cloud is independent of the geometric shapes of computational domains and is free of artificial parameters. Efficient and robust implementation is achieved through an octree data structure with 2:1 balance. We analyze the accuracy and convergence order of AP-Cloud theoretically, and verify the method using an electrostatic problem of a particle beam with halo. Simulation results show that the AP-Cloud method is substantially more accurate and faster than the traditional PIC, and it is free of artificial forces that are typical for some adaptive PIC techniques.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Support Vector Machine-Based Endmember Extraction

Introduced in this paper is the utilization of Support Vector Machines (SVMs) to automatically perform endmember extraction from hyperspectral data. The strengths of SVM are exploited to provide a fast and accurate calculated representation of high-dimensional data sets that may consist of multiple distributions. Once this representation is computed, the number of distributions can be determined without prior knowledge. For each distribution, an optimal transform can be determined that preserves informational content while reducing the data dimensionality, and hence, the computational cost. Finally, endmember extraction for the whole data set is accomplished. Results indicate that this Support Vector Machine-Based Endmember Extraction (SVM-BEE) algorithm has the capability of autonomously determining endmembers from multiple clusters with computational speed and accuracy, while maintaining a robust tolerance to noise.

97 MATHEMATICS AND COMPUTING↗

Distributionally robust polynomial chance-constraints under mixture ambiguity sets

Given $\mathrm{X}\subset\mathbb{R}^n, ε \in (0,1)$, a parametrized family of probability distributions $(μ_a)_{a\in \mathrm{A}}$ on $\mathrm{Ω}\subset \mathbb{R}^p$, we consider the feasible set $\mathrm{X}^*_ε \subset\mathrm{X}$ associated with the distributionally robust chance-constraint $\mathrm{X}^*_ε = \mathrm{x \in X : Prob}_μ[f(\mathrm{x}, ω) >0] > 1 - ε, \forall μ \in \mathscr{M}_{\mathrm{a}}$}, where $\mathscr{M}_{\mathrm{a}}$ is the set of all possibles mixtures of distributions $μ_{\mathrm{a}}, \mathrm{a \in A}$. For instance and typically, the family $\mathscr{M}_{\mathrm{a}}$ is the set of all mixtures of Gaussian distributions on $\mathbb{R}$ with mean and standard deviation $\mathrm{a}=(a,σ)$ in some compact set $\mathrm{A}\subset \mathbb{R}^2$. We provide a sequence of inner approximations $\mathrm{X}^d_ε = {\mathrm{x \in X} : w_d(\mathrm{x}) < ε}, d \in \mathbb{N}$, where $w_d$ is a polynomial of degree d whose vector of coefficients is an optimal solution of a semidefinite program. The size of the latter increases with the degree d. We also obtain the strong and highly desirable asymptotic guarantee that $λ(\mathrm{X}^*_ε$\$\mathrm{X}^d_ε$) → 0 as d increases, where λ is the Lebesgue measure on X. Same results are also obtained for the more intricated case of distributionally robust “joint” chance-constraints. Finally, there is a price to pay for this strong asymptotic guarantee which is the scalability of such a numerical scheme, and so far this important drawback makes it limited to problems of modest dimension.

97 MATHEMATICS AND COMPUTING↗

SU-F-BRD-06: Robust Dose Calculation in Intensity Modulated Proton Therapy

Purpose: Commissioning data for intensity modulated proton therapy (IMPT) must be post-processed by fits to ad-hoc functions to derive the dose calculation kernel parameters in a treatment planning system (TPS). Whether from experimental measurement or Monte Carlo simulation, the limited and noisy nature of such data makes this task very challenging. We present a method to improve the modeling of the lateral dose distribution of clinical energy proton beams in water to commission an in-house IMPT dose calculation engine. Methods: A linear sum of three Gaussian distribution functions was fitted to the lateral dose data in logarithmic scale. Starting values of fitting solutions were determined from the Generalized Highland Approximation. We exhaustively optimized the combinations of data weights with upper bounds of the fitting solutions to minimize confidence intervals of the fitting solutions while maintaining the coefficient of determination (R{sup 2}). Results: Across all energies, average confidence bounds improved 72.88% [Max: 88.28%, Min: 55.05%] for small angle coulomb scattering, 114.25% [409.13%, 66.72%,] for nuclear scattering, and 68.66% [141.09%, 33.27%] for large angle coulomb scattering, while the coefficients of determination of the fits (R{sup 2}) remained comparable. On average R {sup 2} only changed 0.18% and were very close to 1 (approx. 0.999). Wilcoxon signed rank tests comparing unweighted/unbounded fits with weighted/bounded fits averaged 0.0146 (Max: 0.177, Min: 7.05×10−{sup 7}) for small angle Coulomb, 0.0903 (0.945, 7.05×10−{sup 7}) for nuclear, and 0.254 (0.871, 1.86×10−{sup 6}) for large angle Coulomb scattering. This allows rejection of the null hypothesis for small angle Coulomb scattering at the 0.015 level and nuclear interaction at the 0.1 level. Conclusion: Optimal weights assigned to IMPT lateral dose data minimized fitting to stochastic noise in the tail region. Optimizing the upper bounds of fitting parameters improved the robustness of fitting solutions. Both led to a more physically meaningful dose calculation kernel for the TPS. NIH/NCI K25CA168984, Eagles Cancer Research Career Development, The Lawrence W. and Marilyn W. Matteson Fund for Cancer Research, Mayo ASU Seed Grant, and The Kemper Marley Foundation.

60 APPLIED LIFE SCIENCES↗

Fault geometry inversion and slip distribution of the 2010 M w 7.2 El Mayor-Cucapah earthquake from geodetic data

The 4 April 2010 M w 7.2 El Mayor-Cucapah (EMC) earthquake in Baja, California, and Sonora, Mexico, had primarily right-lateral strike-slip motion and a minor normal-slip component. The surface rupture extended about 120 km in a NW-SE direction, west of the Cerro Prieto fault. We use geodetic measurements including near- to far-field GPS, interferometric synthetic aperture radar (InSAR), and subpixel offset measurements of radar and optical images to characterize the fault slip during the EMC event. We use dislocation inversion methods and determine an optimal nine-segment fault geometry, as well as a subfault slip distribution from the geodetic measurements. With systematic perturbation of the fault dip angles, randomly removing one geodetic data constraint, or different data combinations, we are able to explore the robustness of the inferred slip distribution along fault strike and depth. The model fitting residuals imply contributions of early postseismic deformation to the InSAR measurements as well as lateral heterogeneity in the crustal elastic structure between the Peninsular Ranges and the Salton Trough. We also find that with incorporation of near-field geodetic data and finer fault patch size, the shallow slip deficit is reduced in the EMC event by reductions in the level of smoothing. Finally, these results show that the outcomes of coseismic inversions can vary greatly depending on model parameterization and methodology.

58 GEOSCIENCES↗

Adaptive Linear State Estimation for Unbalanced Distribution System

The inclusion of PMU functionality in distribution relays enables the implementation of a linear state estimator (LSE) in Distribution Systems (DS). However, the unbalanced topology and phase coupling in distribution lines necessitate modifications to the LSE formulation. Additionally, the higher fault frequency in distribution systems requires a state estimation approach that is resilient to contingencies. This work proposes an adaptive linear state estimation algorithm tailored for unbalanced distribution systems with single-phase and two-phase laterals. Furthermore, a modified Optimal PMU Placement (OPP) strategy is introduced to ensure full observability in distribution systems with single-phase and two-phase buses. To maintain adaptability to topology changes, the state estimator incorporates circuit breaker status data provided by PMUs, ensuring robust performance during topology changes triggered by faults. The performance of the algorithm is verified on the IEEE 13-bus, 34-bus, and 123-bus systems.

PMUs↗