Search NASA⌕ Search

SEARCH · Search NASA

Results for “rank”

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 OSTI2020

Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations

Rank-revealing matrix decompositions provide an essential tool in spectral analysis of matrices, including the Singular Value Decomposition (SVD) and related low-rank approximation techniques. QR with Column Pivoting (QRCP) is usually suitable for these purposes, but it can be much slower than the unpivoted QR algorithm. For large matrices, the difference in performance is due to increased communication between the processor and slow memory, which QRCP needs in order to choose pivots during decomposition. Our main algorithm, Randomized QR with Column Pivoting (RQRCP), uses randomized projection to make pivot decisions from a much smaller sample matrix, which we can construct to reside in a faster level of memory than the original matrix. This technique may be understood as trading vastly reduced communication for a controlled increase in uncertainty during the decision process. Furthermore, for rank-revealing purposes, the selection mechanism in RQRCP produces results that are the same quality as the standard algorithm, but with performance near that of unpivoted QR (often an order of magnitude faster for large matrices). Additionally, we also propose two formulas that facilitate further performance improvements. The first efficiently updates sample matrices to avoid computing new randomized projections. The second avoids large trailing updates during the decomposition in truncated low-rank approximations. Our truncated version of RQRCP also provides a key initial step in our truncated SVD approximation, TUXV. These advances open up a new performance domain for large matrix factorizations that will support efficient problem-solving techniques for challenging applications in science, engineering, and data analysis.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Improving Traditional Registrational Trial End Points: Development and Application of a Desirability of Outcome Ranking End Point for Complicated Urinary Tract Infection Clinical Trials

Abstract Background Traditional end points used in registrational randomized, controlled trials (RCTs) often do not allow for complete interpretation of the full range of potential clinical outcomes. Desirability of outcome ranking (DOOR) is an approach to the design and analysis of clinical trials that incorporates benefits and risks of novel treatment strategies and provides a global assessment of patient experience. Methods Through a multidisciplinary committee of experts in infectious diseases, clinical trial design, drug regulation, and patient experience, we developed a DOOR end point for infectious disease syndromes and demonstrated how this could be applied to 3 registrational drug trials (ZEUS, APEKS-cUTI, and DORI-05) for complicated urinary tract infections (cUTIs). ZEUS compared fosfomycin to piperacillin/tazobactam, APEKS-cUTI compared cefiderocol to imipenem, and DORI-05 compared doripenem to levofloxacin. Using DOOR, we estimated the probability of a more desirable outcome with each investigational antibacterial drug. Results In each RCT, the DOOR distribution was similar and the probability that a patient in the investigational arm would have a more desirable outcome than a patient in the control arm had a 95% confidence interval containing 50%, indicating no significant difference between treatment arms. DOOR facilitated improved understanding of potential trade-offs between clinical efficacy and safety. Partial credit and subgroup analyses also highlight unique attributes of DOOR. Conclusions DOOR can effectively be used in registrational cUTI trials. The DOOR end point presented here can be adapted for other infectious disease syndromes and prospectively incorporated into future clinical trials.

Immunology↗
DOE OSTI2023

Moving Beyond Mortality: Development and Application of a Desirability of Outcome Ranking (DOOR) Endpoint for Hospital-Acquired Bacterial Pneumonia and Ventilator-Associated Bacterial Pneumonia

Abstract Background Hospital-acquired and ventilator-associated bacterial pneumonia (HABP/VABP) are frequently caused by multidrug-resistant organisms. Patient-centered endpoints in clinical trials are needed to develop new antibiotics for HABP/VABP. Desirability of outcome ranking (DOOR) is a paradigm for the design, analysis, and interpretation of clinical trials based on a patient-centered, benefit-risk evaluation. Methods A multidisciplinary committee created an infectious diseases DOOR endpoint customized for HABP/VABP, incorporating infectious complications, serious adverse events, and mortality. We applied this to 2 previously completed, large randomized controlled trials for HABP/VABP. ZEPHyR compared vancomycin to linezolid and VITAL compared linezolid to tedizolid. For each trial, we evaluated the DOOR distribution and probability, including DOOR component and partial credit analyses. We also applied DOOR in subgroup analyses. Results In both trials, the HABP/VABP DOOR demonstrated similar overall clinical outcomes between treatment groups. In ZEPHyR, the probability that a participant treated with linezolid would have a more desirable outcome than a participant treated with vancomycin was 50.2% (95% confidence interval [CI], 45.1%­−55.3%). In VITAL, the probability that a participant treated with tedizolid would have a more desirable outcome than a participant treated with linezolid was 48.7% (95% CI, 44.8%–52.6%). The DOOR component analysis revealed that participants treated with tedizolid had a less desirable outcome than those treated with linezolid when considering clinical response alone. However, participants with decreased renal function had improved overall outcomes with tedizolid. Conclusions The HABP/VABP DOOR provided more granular information about clinical outcomes than is typically presented in clinical trials. HABP/VABP trials would benefit from prospectively using DOOR.

Immunology↗
DOE OSTI2022

Decomposition of high-rank factorized unitary coupled-cluster operators using ancilla and multiqubit controlled low-rank counterparts

The factorized form of the unitary coupled-cluster (UCC) approximation is one of the most promising methodologies to prepare trial states for strongly correlated systems within the variational quantum eigensolver framework. The factorized form of the UCC Ansatz can be systematically applied to a reference state to generate the desired entanglement. The difficulty associated with such an approach is the requirement of simultaneously entangling a growing number of qubits, which quickly exceeds the hardware limitations of today's quantum machines. In particular, while circuits for singles and double excitations can be performed on current hardware, higher-rank excitations require too many gate operations. In this work, we propose a set of schemes that trade off using extra qubits for a reduced gate depth to decompose high-rank UCC excitation operators into significantly lower depth circuits. These results will remain useful even when fault-tolerant machines are available to reduce the overall state-preparation circuit depth.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Learning to Rank in the Age of Muppets: Effectiveness–Efficiency Tradeoffs in Multi-Stage Ranking

It is well known that rerankers built on pretrained transformer models such as BERT have dramatically improved retrieval effectiveness in many tasks. However, these gains have come at substantial costs in terms of efficiency, as noted by many researchers. In this work, we show that it is possible to retain the benefits of transformer-based rerankers in a multi-stage reranking pipeline by first using feature-based learning-to-rank techniques to reduce the number of candidate documents under consideration without adversely affecting their quality in terms of recall. Applied to the MS MARCO passage and document ranking tasks, we are able to achieve the same level of effectiveness, but with up to 18 increase in efficiency. Furthermore, our techniques are orthogonal to other methods focused on accelerating transformer inference, and thus can be combined for even greater efficiency gains. A higher-level message from our work is that, even though pretrained transformers dominate the modern IR landscape, there are still important roles for “traditional” LTR techniques, and that we should not forget history.

catalysis↗
DOE OSTI2025

Developing a Prototype Methodology to Rank CO2-EOR Wells and Assess Their Reuse Potential for Geologic Carbon Storage

This paper presents a prototype methodology to assess the possible transition of Class II carbon dioxide-enhanced oil recovery (CO2-EOR) wells to Class VI wells. The focus is on wellbore construction materials—casing, cement, tubing, and the packer—and includes comprehensive workflows to evaluate these materials, with primary emphasis on compliance with Environmental Protection Agency (EPA) Class VI well construction and conversion guidelines. These workflows systematically assess material properties and performance criteria to ensure regulatory compliance and optimize long-term wellbore integrity and functionality. Utilizing Python scripts and JavaScript Object Notation (JSON) representations, the study automates checks on digitized Texas Railroad Commission (TRRC) data to rank wells based on workflow criteria. By emphasizing critical factors such as casing integrity, cementing techniques, tubing compatibility, and packer selection, the methodology helps well owners and operators prioritize wells for potential reuse as CO2 injection wells. Given limitations in digitized data, manual user verification is required in some sections. Future improvements include integrating non-digitized data through web scraping and machine learning techniques. This research serves as a practical guide for stakeholders, supporting environmental compliance and sustainable well operations.

geologic carbon sequestration↗
DOE OSTI2021

Development of phenomena identification and ranking table for Westinghouse lead fast reactor’s safety

The Westinghouse Lead-cooled Fast Reactor (LFR) is a medium-size, passively safe, economic, Gen-IV nuclear reactor. An important effort within the Westinghouse LFR program is the development of the safety analysis methodology, which comprises computer code development, model development, and experimental testing. A key initial task associated with the development of the safety analysis methodology is the identification of processes and phenomena that affect the plant's capability to meet selected safety performance indicators. This is accomplished through the development of a Phenomena Identification and Ranking Table (PIRT) for selected accident scenarios which, for this specific PIRT effort, included selected postulated design basis accidents and hypothetical beyond design basis accidents in LFRs. This paper describes the role of PIRT in the development of the Westinghouse LFR safety analysis methodology and the process used in the PIRT development. Specifically, the Westinghouse LFR PIRT assessed importance of pertinent phenomena and identified gaps in their knowledge-base by evaluating current modeling capabilities and data available for validation. The ultimate goal was to provide guidance on computer code development and validation efforts and to prioritize testing to support LFR design and licensing. The key phenomena and processes that are deemed highly important for the safety performance indicators, but for which the state of knowledge is low, are presented. The testing program and analyses development are planned to address significant phenomena in the PIRT.

Lead fast reactor↗
DOE OSTI2023

A Predictor-Corrector Strategy for Adaptivity in Dynamical Low-Rank Approximations

Here, in this paper, we present a predictor-corrector strategy for constructing rank-adaptive, dynamical low-rank approximations (DLRAs) of matrix-valued ODE systems. The strategy is a compromise between (i) low-rank step-truncation approaches that alternately evolve and compress solutions and (ii) strict DLRA approaches that augment the low-rank manifold using subspaces generated locally in time by the DLRA integrator. The strategy is based on an analysis of the error between a forward temporal update into the ambient full-rank space, which is typically computed in a step-truncation approach before recompressing, and the standard DLRA update, which is forced to live in a low-rank manifold. We use this error, without requiring its full-rank representation, to correct the DLRA solution. A key ingredient for maintaining a low-rank representation of the error is a randomized SVD, which introduces some degree of stochastic variability into the implementation. The strategy is formulated and implemented in the context of discontinuous Galerkin spatial discretizations of PDEs and applied to several versions of DLRA methods found in the literature as well as a new variant. Numerical experiments comparing the predictor-corrector strategy to other methods demonstrate robustness to overcome shortcomings of step truncation or strict DLRA approaches: The former may require more memory than is strictly needed, while the latter may miss transients solution features that cannot be recovered. The effect of randomization, tolerances, and other implementation parameters is also explored.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Towards Compact Neural Networks via End-to-End Training: A Bayesian Tensor Approach with Automatic Rank Determination

Post-training model compression can reduce the inference costs of deep neural networks, but uncompressed training still consumes enormous hardware resources and energy. To enable low-energy training on edge devices, it is highly desirable to directly train a compact neural network from scratch with a low memory cost. Low-rank tensor decomposition is an effective approach to reduce the memory and computing costs of large neural networks. However, directly training low-rank tensorized neural networks is a very challenging task because it is hard to determine a proper tensor rank a priori, and the tensor rank controls both model complexity and accuracy. Here, this paper presents a novel end-to-end framework for low-rank tensorized training. We first develop a Bayesian model that supports various low-rank tensor formats (e.g., CANDECOMP/PARAFAC, Tucker, tensor-train, and tensor-train matrix) and reduces neural network parameters with automatic rank determination during training. Then we develop a customized Bayesian solver to train large-scale tensorized neural networks. Our training methods shows orders-of-magnitude parameter reduction and little accuracy loss (or even better accuracy) in the experiments. On a very large deep learning recommendation system with over 4.2 ×10 9 model parameters, our method can reduce the parameter number to 1.6 ×10 5 automatically in the training process (i.e., by 2.6 ×10 4 times) while achieving almost the same accuracy. Code is available at https://github.com/colehawkins/bayesian-tensor-rank-determination.

compact neural networks↗
DOE OSTI2022

Low rank approximation in simulations of quantum algorithms

Simulating quantum algorithms on classical computers is challenging when the system size, i.e., the number of qubits used in the quantum algorithm, is moderately large. However, some quantum algorithms and the corresponding quantum circuits can be simulated efficiently on a classical computer if the input quantum state is a low rank tensor and all intermediate states of the quantum algorithm can be represented or approximated by low rank tensors. Here, in this paper, we examine the possibility of simulating a few quantum algorithms by using low-rank canonical polyadic (CP) decomposition to represent the input and all intermediate states of these algorithms. Two rank reduction algorithms are used to enable efficient simulation. We show that some of the algorithms preserve the low rank structure of the input state and can thus be efficiently simulated on a classical computer. However, the rank of the intermediate states in other quantum algorithms can increase rapidly, making efficient simulation more difficult. To some extent, such difficulty reflects the advantage or superiority of a quantum computer over a classical computer. As a result, understanding the low rank structure of a quantum algorithm allows us to identify algorithms that can benefit significantly from quantum computers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A review of low-rank methods for time-dependent kinetic simulations

Time-dependent kinetic models are ubiquitous in computational science and engineering. The underlying integro-differential equations in these models are high-dimensional, comprised of a six–dimensional phase space, making simulations of such phenomena extremely expensive. In this article we demonstrate that in many situations, the solution to kinetics problems lives on a low dimensional manifold that can be described by a low-rank matrix or tensor approximation. We then review the recent development of so-called low-rank methods that evolve the solution on this manifold. The two classes of methods we review are the dynamical low-rank (DLR) method, which derives differential equations for the low-rank factors, and a Step-and-Truncate (SAT) approach, which projects the solution onto the low-rank representation after each time step. Thorough discussions of time integrators, tensor decompositions, and method properties such as structure preservation and computational efficiency are included. We further show examples of low-rank methods as applied to particle transport and plasma dynamics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Harnessing Condorcet Methods to Improve Decision-making Based on Ranked Data

Decision-makers must often choose between multiple alternatives based on their relative merits across a variety of criteria. These multiple-criteria decision-making (MCDM) problems must be approached in an objective, measurable, and transparent fashion to obtain well-supported outcomes. The challenge of using sets of ranked data to identify the optimal choice is not unlike the challenge of using ranked ballots to identify the winner of an election in a preference voting system. As such, the methods of rank aggregation used in elections can be applied to help resolve MCDM problems. Previous research into the design of elections and ballots has yielded many algorithms with well-understood properties. A subset of these, called Condorcet methods, reliably identify the “Condorcet winner,” if it exists, giving the result that would defeat any other in a pairwise comparison. That, in addition to several other desirable qualities, makes Condorcet methods like the Schulze method, Ranked Pairs, and Copeland’s method, effective and scalable means for tackling MCDM problems. These rank aggregation methods have been implemented in JavaScript functions for incorporation into a web-based MCDM decision tool. These algorithms can be applied in a wide variety of contexts (for example, determining the “best” environmental remediation method or selecting a subcontractor) to facilitate effective decision-making. The performance of the JavaScript Condorcet prototype tool was compared across the implemented algorithms and with both a non-Condorcet rank aggregation method as well as an implementation of the Simple Multi-Attribute Rating Technique (SMART) algorithm.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2022

General-Purpose Bayesian Tensor Learning With Automatic Rank Determination and Uncertainty Quantification

A major challenge in many machine learning tasks is that the model expressive power depends on model size. Low-rank tensor methods are an efficient tool for handling the curse of dimensionality in many large-scale machine learning models. The major challenges in training a tensor learning model include how to process the high-volume data, how to determine the tensor rank automatically, and how to estimate the uncertainty of the results. While existing tensor learning focuses on a specific task, this paper proposes a generic Bayesian framework that can be employed to solve a broad class of tensor learning problems such as tensor completion, tensor regression, and tensorized neural networks. We develop a low-rank tensor prior for automatic rank determination in nonlinear problems. Our method is implemented with both stochastic gradient Hamiltonian Monte Carlo (SGHMC) and Stein Variational Gradient Descent (SVGD). We compare the automatic rank determination and uncertainty quantification of these two solvers. We demonstrate that our proposed method can determine the tensor rank automatically and can quantify the uncertainty of the obtained results. We validate our framework on tensor completion tasks and tensorized neural network training tasks.

Bayesian inference↗
DOE OSTI2025

Exploring Black-box Adversarial Attacks on Low-rank Constrained Neural Networks

Low-rank compression has been shown as an effective tool to reduce parameter counts of convolutional and vision transformer architectures; however, low-rank training often reduces model robustness to adversarial perturbations. In this work, we explore the effects of low-rank training on black-box attacks, where attacked images are generated without knowledge of the low-rank parameters. We find that low-rank training is not sufficient as a black-box defense and can sometimes produce worse than expected as compared to baseline models. Influencing the spectrum of the low-rank models during training, which is known to increase model robustness against white-box attacks, improves black-box performance as well.

Schnake, Stefan [ORNL] (ORCID:0000000215183538)↗
DOE OSTI2025

Robust Implicit Adaptive Low Rank Time-Stepping Methods for Matrix Differential Equations

In this work, we develop implicit rank-adaptive schemes for time-dependent matrix differential equations. The dynamic low rank approximation (DLRA) is a well-known technique to capture the dynamic low rank structure based on Dirac–Frenkel time-dependent variational principle. In recent years, it has attracted a lot of attention due to its wide applicability. Our schemes are inspired by the three-step procedure used in the rank adaptive version of the unconventional robust integrator (the so called BUG integrator) (Ceruti et al. in BIT Numer Math 62(4):1149–1174, 2022) for DLRA. First, a prediction (basis update) step is made computing the approximate column and row spaces at the next time level. Second, a Galerkin evolution step is invoked using an implicit solves for the small core matrix. Finally, a truncation is made according to a prescribed error threshold. Since the DLRA is evolving the differential equation projected on to the tangent space of the low rank manifold, the error estimate of the BUG integrator contains the tangent projection (modeling) error which cannot be easily controlled by mesh refinement. This can cause convergence issue for equations with cross terms. To address this issue, we propose a simple modification, consisting of merging the row and column spaces from the explicit step truncation method together with the BUG spaces in the prediction step. In addition, we propose an adaptive strategy where the BUG spaces are only computed if the residual for the solution obtained from the prediction space by explicit step truncation method, is too large. Here, we prove stability and estimate the local truncation error of the schemes under assumptions. We benchmark the schemes in several tests, such as anisotropic diffusion, solid body rotation and the combination of the two, to show robust convergence properties.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Effect of secondary gas-phase reactions (SGR) in pyrolysis of carbon feedstocks for anisotropic carbon materials production – 2: Effects of SGR on tars produced from varying ranks of coal

Herein, this work explores the extent to which secondary gas-phase reactions (SGR) in pyrolysis can be used to modify coal tar chemistries from coals of different ranks in favor of improved anisotropy formation in their respective pitches. Pyrolysis was performed on four different coals of varying bituminous rank (Utah Sufco, Wyoming PRB Black Thunder, Illinois #6, and West Virginia Flying Eagle), with SGR temperatures ranging from 800 to 900° C and nominal SGR gas-phase residence times from 1 to 2.5 s. The oxygen content, aliphatic content, and molecular weight distributions of the coal tar samples were measured to indicate the changes with increasing levels of SGR, and microscopy was also used to measure changes in anisotropy formation in the resulting pitch samples. Generally, for all coals tested, increased levels of pyrolysis SGR led to decreased oxygen and aliphatic content, increased molecular weight sizes, and improved anisotropy formation. However, it was clear that the extent of these property changes depended on the chemistry and rank of the starting coal feedstock. Despite the relatively high rank of the Illinois #6 coal, its respective pitch samples performed poorly in improving anisotropy formation, due to its high sulfur content. The PRB, Sufco, and Flying Eagle coals performed better in their anisotropy formation than Illinois #6, depending on their respective coal ranks. Statistical analysis (analysis of variance, ANOVA) performed on the sample characterization data also suggests that SGR temperature is consistently the most dominant and significant effect on the resulting coal products.

01 COAL, LIGNITE, AND PEAT↗