Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Tucker model”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Personalized Tucker Decomposition: Modeling Commonality and Peculiarity on Tensor Data

In this paper, we propose a personalized Tucker decomposition (perTucker) to address the limitations of traditional tensor decomposition methods in capturing heterogeneity across different datasets. perTucker decomposes tensor data into shared global components and personalized local components. We introduce an order orthogonality assumption and develop a proximal gradient regularized block coordinate descent algorithm guaranteed to converge to a stationary point. The unique and common representations learned by perTucker reveal intrinsic statistical patterns in data and provide valuable information for a wide range of downstream analytics, including anomaly detection, source classification, and clustering. We demonstrate perTucker’s effectiveness through a simulation study and two case studies on solar flare detection and tonnage signal classification.

14 SOLAR ENERGY↗
DOE OSTI2022

The Spectroscopic Classification of Astronomical Transients (SCAT) Survey: Overview, Pipeline Description, Initial Results, and Future Plans

Here, we present the Spectroscopic Classification of Astronomical Transients (SCAT) survey, which is dedicated to spectrophotometric observations of transient objects such as supernovae and tidal disruption events. SCAT uses the SuperNova Integral-Field Spectrograph (SNIFS) on the University of Hawai’i 2.2 m (UH2.2m) telescope. SNIFS was designed specifically for accurate transient spectrophotometry, including absolute flux calibration and host-galaxy removal. We describe the data reduction and calibration pipeline including spectral extraction, telluric correction, atmospheric characterization, nightly photometricity, and spectrophotometric precision. We achieve ≲5% spectrophotometry across the full optical wavelength range (3500–9000 Å) under photometric conditions. The inclusion of photometry from the SNIFS multi-filter mosaic imager allows for decent spectrophotometric calibration (10%–20%) even under unfavorable weather/atmospheric conditions. SCAT obtained ≈640 spectra of transients over the first 3 yr of operations, including supernovae of all types, active galactic nuclei, cataclysmic variables, and rare transients such as superluminous supernovae and tidal disruption events. These observations will provide the community with benchmark spectrophotometry to constrain the next generation of hydrodynamic and radiative transfer models.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2019

TTHRESH: Tensor Compression for Multidimensional Visual Data

Memory and network bandwidth are decisive bottlenecks when handling high-resolution multidimensional data sets in visualization applications, and they increasingly demand suitable data compression strategies. In this paper, we introduce a novel lossy compression algorithm for multidimensional data over regular grids. It leverages the higher-order singular value decomposition (HOSVD), a generalization of the SVD to three dimensions and higher, together with bit-plane, run-length and arithmetic coding to compress the HOSVD transform coefficients. Our scheme degrades the data particularly smoothly and achieves lower mean squared error than other state-of-the-art algorithms at low-to-medium bit rates, as it is required in data archiving and management for visualization purposes. Further advantages of the proposed algorithm include very fine bit rate selection granularity and the ability to manipulate data at very small cost in the compression domain, for example to reconstruct filtered and/or subsampled versions of all (or selected parts) of the data set.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Least H 2 norm updating of quadratic interpolation models for derivative-free trust-region algorithms

One particular class of derivative-free optimization algorithms is trust-region algorithms based on quadratic models given by the under-determined interpolation. Different techniques in updating the quadratic model from iteration to iteration will give different interpolation models. We propose a new way to update the quadratic model by minimizing the $H^{2}$ norm of the difference between neighboring quadratic models. The motivation for applying the $H^{2}$ norm is given. The theoretical properties of our new updating technique are also presented. We propose the projection in the sense of $H^{2}$ norm and the interpolation error analysis of our model function. We obtain the coefficients of the quadratic model function using the Karush–Kuhn–Tucker (KKT) conditions. Numerical results show the advantages of our model on the test set considered, and the derivative-free algorithms based on our least $H^{2}$ norm updating quadratic model functions can solve test problems with fewer function evaluations than the algorithm based on the least Frobenius norm updating model and the other compared methods.

derivative-free optimization↗
DOE OSTI2019

Photovoltaic and Behind-the-Meter Battery Storage: Advanced Smart Inverter Controls and Field Demonstration

Electric utilities have little visibility of the electrical distribution system, and consequently, limited diagnostic capabilities. The distribution grid was designed for a unidirectional power flow, where energy is supplied by few large centralized power plants; however, this is set to change to meet California’s aggressive decarbonization goals. The large-scale deployment of distributed renewable generation, such as photovoltaics (PV), can have many negative effects on an unprepared grid. As illustrated in the California “duck curve,” PV generation modifies load profiles during the day, which causes steep ramping in the evening. This effect indicates the need to revise the electrical grid’s design and operation. This project sought to (a) create a centralized resource in California to test and validate distribution technology controls with industry standard PV, storage, and high-fidelity sensors, (b) support strategic and operational decisions for new grid architectures by providing simulation models, (c) promote new ways to control clusters of PV smart inverters, in accordance with California Rule 21, and (d) innovate, develop, and field test a predictive controller to maximize economic profit for the customer while supporting the grid. The controller was built using the state-of-the-art model predictive control methodology to optimally control behind-the-meter PV and battery storage. In consideration of the duck curve, the controller optimally controls the battery dispatch by charging during excess generation periods and discharging during the critical afternoon demand hours. The controller was evaluated in annual simulations and revealed the potential cost-effectiveness of behind-the-meter battery storage. The simulations showed that the annual electricity bill could be reduced by as much as 35 percent, with a payback period of the investment in battery storage in about 6 years – significantly shorter than the manufacturer’s 10-year warranty. All developed simulation models, the grid event library, and the MPC controller are open-source and available online.

Model Predictive control↗
DOE OSTI2022

Robust Solution Approach for Bilevel Demand Response Game at Distribution Level

In this paper, a bilevel electricity pricing and demand response game between a distribution system operator (DSO) and load aggregators (LAs) is considered, and a robust decision model is proposed for the DSO to deal with the uncertainties from the wholesale market prices and demand consumptions of LAs. With the max-min objective at the upper level, the robust bilevel model is converted into a single level model by the Karush-Kuhn-Tucker (KKT) conditions and prime-dual transformation. Several groups of experiments have been conducted based on different preferences on uncertainty gaps and peak load reductions to show its effectiveness. After-the-fact scenario analysis has indicated that the robust solution is more beneficial in reducing the risk of inaccurate predictions as compared to the risk neutral strategy.

Chen, Yang↗
DOE OSTI2020

BI-LEVEL OPTIMIZATION FOR ELECTRICITY TRANSACTION IN SMART COMMUNITY WITH MODULAR PUMP HYDRO STORAGE

Grid integration of the increasing distributed energy resources could be challenging in terms of new infrastructure investment, power grid stability, etc. To resolve more renewables locally and reduce the need for extensive electricity transmission, a community energy transaction market is assumed with market operator as the leader whose responsibility is to generate local energy prices and clear the energy transaction payment among the prosumers (followers). The leader and multi-followers have competitive objectives of revenue maximization and operational cost minimization. This non-cooperative leader-follower (Stackelberg) game is formulated using a bi-level optimization framework, where a novel modular pump hydro storage technology (GLIDES system) is set as an upper level market operator, and the lower level prosumers are nearby commercial buildings. The best responses of the lower level model could be derived by necessary optimality conditions, and thus the bi-level model could be transformed into single level optimization model via replacing the lower level model by its Karush-Kuhn-Tucker (KKT) necessary conditions. Several experiments have been designed to compare the local energy transaction behavior and profit distribution with the different demand response levels and different local price structures. The experimental results indicate that the lower level prosumers could benefit the most when local buying and selling prices are equal, while maximum revenue potential for the upper level agent could be reached with non-equal trading prices.

Chen, Yang↗
DOE OSTI2024

FORESTR: Finding, Organizing, Representing, Explaining, Summarizing, and Thinning Random forests

Random forests have become popular models used for data driven predictions. As a result, random forests are currently used or being considered for high-consequence mission applications in national security, such as the prediction of yield from optical signals and malware detection. While random forests may provide accurate predictions, the complexity of the algorithm causes a lack of interpretability. Random forests are an ensemble of regression or decision trees. Individual regression and decision trees are interpretable, but ensembles are inherently difficult to interpret due to the compilation of many models. We aim to increase the interpretability of random forests by finding patterns in the ensemble of trees that can be used to “thin” (or remove) trees. As a starting point, in this report, we develop a new distance metric for quantifying the similarity between trees based on their topologies (i.e., shapes). We base the metric on a novel distance metric for graphs that is a proper mathematical distance, is invariant to transformations, has registration between graphs, and computes topological evolutions between graphs. We use the tree distance metric to compute tree statistics such as a “mean tree” and to identify clusters of trees. We apply the developed methodology to a toy dataset and a mission relevant product inspection dataset to demonstrate how the metric can provide insight into random forests. Furthermore, we discuss the limitations of the approach and ideas for future research into how the metric could be used as a thinning tool to develop less complex models.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

QBTNs - Quantum Boolean Tensor Networks

We develop algorithms and software that uses the D-Wave 2000Q quantum annealer to solve several types of Boolean tensor factorization problems. Boolean tensor factorization refers to the problem of representing a high-dimensional tensor filled with Boolean values as a product of smaller Boolean core tensors and Boolean matrices. We consider different tensor factorization models, including Boolean Tensor Train, Boolean Tucker, and Boolean Hierarchical Tucker. As an exact decomposition of a given type may not exist in the general case, the objective is to minimize the difference between the input high-dimensional tensor and the product of the lower-dimensional tensors of the proposed factorization, using a specified tensor norm. In our approach, we reduce the Boolean tensor factorization problem to a sequence of quadratic unconstrained binary optimization problems suitable for the D-Wave 2000Q quantum annealer. Although current quantum technology is still fairly restricted in the problems it can tackle, we show that complex tensor factorization problems as the ones addressed by us can be solved efficiently and accurately.

Alexandrov, Boian↗
DOE OSTI2019

A Feedback-Based Regularized Primal-Dual Gradient Method for Time-Varying Nonconvex Optimization: Preprint

This paper considers time-varying nonconvex optimization problems, utilized to model optimal operational trajectories of systems governed by possibly nonlinear physical or logical models. Algorithms for tracking a Karush-Kuhn-Tucker point are synthesized, based on a regularized primal-dual gradient method. In particular, the paper proposes a feedback-based primal-dual gradient algorithm, where analytical models for system state or constraints are replaced with actual measurements. When cost and constraints functions are twice continuously differentiable, conditions for the proposed algorithms to have bounded tracking error are derived, and a discussion of their practical implications is provided. Illustrative numerical simulations are presented for an application in power systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Machine learning models for rat multigeneration reproductive toxicity prediction

Reproductive toxicity is one of the prominent endpoints in the risk assessment of environmental and industrial chemicals. Due to the complexity of the reproductive system, traditional reproductive toxicity testing in animals, especially guideline multigeneration reproductive toxicity studies, take a long time and are expensive. Therefore, machine learning, as a promising alternative approach, should be considered when evaluating the reproductive toxicity of chemicals. We curated rat multigeneration reproductive toxicity testing data of 275 chemicals from ToxRefDB (Toxicity Reference Database) and developed predictive models using seven machine learning algorithms (decision tree, decision forest, random forest, k-nearest neighbors, support vector machine, linear discriminant analysis, and logistic regression). A consensus model was built based on the seven individual models. An external validation set was curated from the COSMOS database and the literature. The performances of individual and consensus models were evaluated using 500 iterations of 5-fold cross-validations and the external validation data set. The balanced accuracy of the models ranged from 58% to 65% in the 5-fold cross-validations and 45%–61% in the external validations. Prediction confidence analysis was conducted to provide additional information for more appropriate applications of the developed models. The impact of our findings is in increasing confidence in machine learning models. We demonstrate the importance of using consensus models for harnessing the benefits of multiple machine learning models (i.e., using redundant systems to check validity of outcomes). While we continue to build upon the models to better characterize weak toxicants, there is current utility in saving resources by being able to screen out strong reproductive toxicants before investing in vivo testing. The modeling approach (machine learning models) is offered for assessing the rat multigeneration reproductive toxicity of chemicals. Our results suggest that machine learning may be a promising alternative approach to evaluate the potential reproductive toxicity of chemicals.

consensus model↗
DOE OSTI2024

Revealing Decision Conservativeness Through Inverse Distributionally Robust Optimization

This paper introduces Inverse Distributionally Robust Optimization (I-DRO) as a method to infer the conservativeness level of a decision-maker, represented by the size of a Wasserstein metric-based ambiguity set, from the optimal decisions made using Forward Distributionally Robust Optimization (F-DRO). By leveraging the Karush-Kuhn-Tucker (KKT) conditions of the convex F-DRO model, we formulate I-DRO as a bi-linear program, which can be solved using off-the-shelf optimization solvers. Additionally, this formulation exhibits several advantageous properties. We demonstrate that I-DRO not only guarantees the existence and uniqueness of an optimal solution but also establishes the necessary and sufficient conditions for this optimal solution to accurately match the actual conservativeness level in F-DRO. Furthermore, we identify three extreme scenarios that may impact I-DRO effectiveness. Our case study applies F-DRO for power system scheduling under uncertainty and employs I-DRO to recover the conservativeness level of system operators. Numerical experiments based on an IEEE 5-bus system and a realistic NYISO 11-zone system demonstrate I-DRO performance in both normal and extreme scenarios. An extended version of this paper with additional analyses is available at li2024revealing.

distributionally robust optimization↗
DOE OSTI2021

Automated Discovery of DOminaNt physics Informed Surrogates (ADDONIS) Framework for Improving Water Cycling Predictability

Focal Areas: The primary alignment of the proposed framework is with focal area 2, because it guides the construction of a hierarchy of predictive models generated from Statistical and AI/ ML techniques. There are connections to focal areas 1 and 3 because surrogates allow for coupled data assimilation techniques where the full model is too expensive (1) and the discovered balance laws can be used as an insightful analysis tool to validate the structure of models (3).

54 ENVIRONMENTAL SCIENCES↗