Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mutual information”

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 OSTI2024

Space-time generalization of mutual information

The mutual information characterizes correlations between spatially separated regions of a system. Yet, in experiments we often measure dynamical correlations, which involve probing operators that are also separated in time. Here, we introduce a space-time generalization of mutual information which, by construction, satisfies several natural properties of the mutual information and at the same time characterizes correlations across subsystems that are separated in time. In particular, this quantity, that we call the space-time mutual information, bounds all dynamical correlations. We construct this quantity based on the idea of the quantum hypothesis testing. As a by-product, our definition provides a transparent interpretation in terms of an experimentally accessible setup. We draw connections with other notions in quantum information theory, such as quantum channel discrimination. Finally, we study the behavior of the space-time mutual information in several settings and contrast its long-time behavior in many-body localizing and thermalizing systems.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Mutual information bounded by Fisher information

We derive a general upper bound to mutual information in terms of the Fisher information. The bound may be further used to derive a lower bound for the Bayesian quadratic cost. These two provide alternatives to other inequalities in the literature (e.g., the van Trees inequality) that are useful also for cases where the latter ones give trivial bounds. We then generalize them to the quantum case, where they bound the Holevo information in terms of the quantum Fisher information. We illustrate the usefulness of our bounds with a case study in quantum phase estimation. Here, they allow us to adapt to mutual information (useful for global strategies where the prior plays an important role), the known and highly nontrivial bounds for the Fisher information in the presence of noise. The results are also useful in the context of quantum communication, both for continuous and discrete alphabets. Published by the American Physical Society 2025

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Mutual information superadditivity and unitarity bounds

We derive the property of strong superadditivity of mutual information arising from the Markov property of the vacuum state in a conformal field theory and strong subadditivity of entanglement entropy. We show this inequality encodes unitarity bounds for different types of fields. These unitarity bounds are precisely the ones that saturate for free fields. This has a natural explanation in terms of the possibility of localizing algebras on null surfaces. A particular continuity property of mutual information characterizes free fields from the entropic point of view. We derive a general formula for the leading long distance term of the mutual information for regions of arbitrary shape which involves the modular flow of these regions. We obtain the general form of this leading term for two spheres with arbitrary orientations in spacetime, and for primary fields of any tensor representation. For free fields we further obtain the explicit form of the leading term for arbitrary regions with boundaries on null cones.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1997

Nonlinear pattern analysis of ventricular premature beats by mutual information

The frequency of ventricular premature beats (VPBs) has been related to the risk of mortality. However, little is known about the temporal pattern of occurrence of VPBs and its relationship to autonomic activity. Hence, we applied a general correlation measure, mutual information, to quantify how VPBs are generated over time. We also used mutual information to determine the correlation between VPB production and heart rate in order to evaluate effects of autonomic activity on VPB production. We examined twenty subjects with more than 3000 VPBs/day and simulated random time series of VPB occurrence. We found that mutual information values could be used to characterize quantitatively the temporal patterns of VPB generation. Our data suggest that VPB production is not random and VPBs generated with a higher value of mutual information may be more greatly affected by autonomic activity.

NASA Discipline Regulatory Physiology↗
DOE OSTI2023

Mutual information prediction for strongly correlated systems

We have trained a new machine-learning (ML) model which predicts mutual information (MI) for strongly correlated systems. This is a complex quantity, which is much more difficult to predict than one-site entropies, but carries important information about the correlation structure inside electronic systems. In this work, we replaced the expensive density matrix renormalization group (DMRG) calculations by newly trained ML model for prediction of the mutual information. We show the performance of the model on two important tasks: (a) to determine the correlation structure and (b) to determine ordering of orbitals for accurate DMRG calculations. In conclusion, the results are compared with the MI obtained from accurate DMRG calculations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS2004

The Generalization of Mutual Information as the Information between a Set of Variables: The Information Correlation Function Hierarchy and the Information Structure of Multi-Agent Systems

The topic of this paper is a hierarchy of information-like functions, here named the information correlation functions, where each function of the hierarchy may be thought of as the information between the variables it depends upon. The information correlation functions are particularly suited to the description of the emergence of complex behaviors due to many- body or many-agent processes. They are particularly well suited to the quantification of the decomposition of the information carried among a set of variables or agents, and its subsets. In more graphical language, they provide the information theoretic basis for understanding the synergistic and non-synergistic components of a system, and as such should serve as a forceful toolkit for the analysis of the complexity structure of complex many agent systems. The information correlation functions are the natural generalization to an arbitrary number of sets of variables of the sequence starting with the entropy function (one set of variables) and the mutual information function (two sets). We start by describing the traditional measures of information (entropy) and mutual information.

Wolf, David R.↗
DOE OSTI2022

Data and scripts associated with the manuscript "Using Mutual Information for Global Sensitivity Analysis on Watershed Modeling"

This package contains the data and scripts used in "Using Mutual Information for Global Sensitivity Analysis on Watershed Modeling" (Jiang et al., 2022). The ARW_SWAT.zip file contains the SWAT simulation and the sensitivity analysis result in the American River Watershed. The Portage_SWAT.zip file contains the SWAT simulation and the sensitivity analysis result in the Portage River Watershed. The src folder contains the source code of sensitivity analysis and plotting functions. The notebooks folder contains the Jupyter notebooks for performing sensitivity analysis and other post analyses.Global Sensitivity Analysis (GSA) often is applied to assess the sensitivity of model outputs to their inputs using ensemble simulations. However, increasing model complexity and the associated computational cost have limited the use of most GSA approaches for process-based watershed models. We propose to use Mutual Information (MI) as a computationally efficient GSA method for watershed modeling. Such MI computed from several hundred realizations usually can capture nonlinear relationships between inputs and outputs of interest. We perform MI-based watershed sensitivity analyses in studies of the Portage River Watershed in Ohio and the American River Watershed in Washington. In these studies, MI is used to evaluate the sensitivity of river discharges simulated by the Soil and Water Assessment Tool to no less than 20 parameters for each watershed. Our MI-based sensitivity analyses achieved convergence with about 300~500 realizations, a small fraction of the ensemble size (i.e., several thousand) required by the Sobol method. Nevertheless, MI yields similar sensitivity ranking compared to the Sobol method, especially for sensitive parameters. Our study thus sheds new light on the use of MI as an affordable GSA method for computationally intensive models such as the hyper-resolution, watershed hydrobiogeochemical models.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Mutual-information based optimal experimental design for hyperpolarized $$^{13}$$C-pyruvate MRI

Abstract A key parameter of interest recovered from hyperpolarized (HP) MRI measurements is the apparent pyruvate-to-lactate exchange rate, $$k_{{\textrm PL}}$$ k P L , for measuring tumor metabolism. This manuscript presents an information-theory-based optimal experimental design approach that minimizes the uncertainty in the rate parameter, $$k_{{\textrm PL}}$$ k P L , recovered from HP-MRI measurements. Mutual information is employed to measure the information content of the HP measurements with respect to the first-order exchange kinetics of the pyruvate conversion to lactate. Flip angles of the pulse sequence acquisition are optimized with respect to the mutual information. A time-varying flip angle scheme leads to a higher parameter optimization that can further improve the quantitative value of mutual information over a constant flip angle scheme. However, the constant flip angle scheme, 35 and 28 degrees for pyruvate and lactate measurements, leads to an accuracy and precision comparable to the variable flip angle schemes obtained from our method. Combining the comparable performance and practical implementation, optimized pyruvate and lactate flip angles of 35 and 28 degrees, respectively, are recommended.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Improved quality metrics for association and reproducibility in chromatin accessibility data using mutual information

Correlation metrics are widely utilized in genomics analysis and often implemented with little regard to assumptions of normality, homoscedasticity, and independence of values. This is especially true when comparing values between replicated sequencing experiments that probe chromatin accessibility, such as assays for transposase-accessible chromatin via sequencing (ATAC-seq). Such data can possess several regions across the human genome with little to no sequencing depth and are thus non-normal with a large portion of zero values. Despite distributed use in the epigenomics field, few studies have evaluated and benchmarked how correlation and association statistics behave across ATAC-seq experiments with known differences or the effects of removing specific outliers from the data. Here, we developed a computational simulation of ATAC-seq data to elucidate the behavior of correlation statistics and to compare their accuracy under set conditions of reproducibility. Using these simulations, we monitored the behavior of several correlation statistics, including the Pearson’s R and Spearman’s ρ coefficients as well as Kendall’s τ and Top–Down correlation. We also test the behavior of association measures, including the coefficient of determination R 2 , Kendall’s W, and normalized mutual information. Our experiments reveal an insensitivity of most statistics, including Spear man’s ρ, Kendall’s τ, and Kendall’s W, to increasing differences between simulated ATAC-seq replicates. The removal of co-zeros (regions lacking mapped sequenced reads) between simulated experiments greatly improves the estimates of correlation and association. After removing co-zeros, the R 2 coefficient and normalized mutual information display the best performance, having a closer one-to-one relationship with the known portion of shared, enhanced loci between simulated replicates. When comparing values between experimental ATAC-seq data using a random forest model, mutual information best predicts ATAC-seq replicate relationships. Collectively, this study demonstrates how measures of correlation and association can behave in epigenomics experiments. We provide improved strategies for quantifying relationships in these increasingly prevalent and important chromatin accessibility assays.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS2016

Cross Correlation versus Normalized Mutual Information on Image Registration

This is the first study to quantitatively assess and compare cross correlation and normalized mutual information methods used to register images in subpixel scale. The study shows that the normalized mutual information method is less sensitive to unaligned edges due to the spectral response differences than is cross correlation. This characteristic makes the normalized image resolution a better candidate for band to band registration. Improved band-to-band registration in the data from satellite-borne instruments will result in improved retrievals of key science measurements such as cloud properties, vegetation, snow and fire.

band-to-band↗
DOE OSTI2023

A robust estimator of mutual information for deep learning interpretability

Abstract We develop the use of mutual information (MI), a well-established metric in information theory, to interpret the inner workings of deep learning (DL) models. To accurately estimate MI from a finite number of samples, we present GMM-MI (pronounced ‘Jimmie’), an algorithm based on Gaussian mixture models that can be applied to both discrete and continuous settings. GMM-MI is computationally efficient, robust to the choice of hyperparameters and provides the uncertainty on the MI estimate due to the finite sample size. We extensively validate GMM-MI on toy data for which the ground truth MI is known, comparing its performance against established MI estimators. We then demonstrate the use of our MI estimator in the context of representation learning, working with synthetic data and physical datasets describing highly non-linear processes. We train DL models to encode high-dimensional data within a meaningful compressed (latent) representation, and use GMM-MI to quantify both the level of disentanglement between the latent variables, and their association with relevant physical quantities, thus unlocking the interpretability of the latent representation. We make GMM-MI publicly available in this GitHub repository.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

Bipartite mutual information in classical many-body dynamics

Information theoretic measures have helped to sharpen our understanding of many-body quantum states. As perhaps the most well-known example, the entanglement entropy (or more generally, the bipartite mutual information) has become a powerful tool for characterizing the dynamical growth of quantum correlations. By contrast, although computable, the bipartite mutual information (MI) is almost never explored in classical many particle systems; this owes in part to the fact that computing the MI requires keeping track of the evolution of the full probability distribution, a feat which is rarely done (or thought to be needed) in classical many-body simulations. Here, we utilize the MI to analyze the spreading of information in 1D elementary cellular automata (CA). Broadly speaking, we find that the behavior of the MI in these dynamical systems exhibits a few different types of scaling that roughly correspond to known CA universality classes. Of particular note is that we observe a set of automata for which the MI converges parametrically slowly to its thermodynamic value. We develop a microscopic understanding of this behavior by analyzing a two-species model of annihilating particles moving in opposite directions. Furthermore, our work suggests the possibility that information theoretic tools such as the MI might enable a more fine-grained characterization of classical many-body states and dynamics.

Cellular automata↗
DOE OSTI2024

Universal Spreading of Conditional Mutual Information in Noisy Random Circuits

For this work, we study the evolution of conditional mutual information (CMI) in generic open quantum systems, focusing on one-dimensional random circuits with interspersed local noise. Unlike in noiseless circuits, where CMI spreads linearly while being bounded by the light cone, we find that noisy random circuits with an error rate 𝑝 exhibit superlinear propagation of CMI, which diverges far beyond the light cone at a critical circuit depth 𝑡 𝑐 ∝ 𝑝 −1 . We demonstrate that the underlying mechanism for such rapid spreading is the combined effect of local noise and a scrambling unitary, which selectively removes short-range correlations while preserving long-range correlations. To analytically capture the dynamics of CMI in noisy random circuits, we introduce a coarse-graining method, and we validate our theoretical results through numerical simulations. Furthermore, we identify a universal scaling law governing the spreading of CMI.

decoherence↗
NASA NTRS1994

Estimation and classification by sigmoids based on mutual information

An estimate of the probability density function of a random vector is obtained by maximizing the mutual information between the input and the output of a feedforward network of sigmoidal units with respect to the input weights. Classification problems can be solved by selecting the class associated with the maximal estimated density. Newton's s method, applied to an estimated density, yields a recursive maximum likelihood estimator, consisting of a single internal layer of sigmoids, for a random variable or a random sequence. Applications to the diamond classification and to the prediction of a sun-spot process are demonstrated.

Baram, Yoram↗
NASA NTRS1993

Solar flux forecasting using mutual information with an optimal delay

Solar flux F(sub 10.7) directly affects the atmospheric density, thereby changing the lifetime and prediction of satellite orbits. For this reason, accurate forecasting of F(sub 10.7) is crucial for orbit determination of spacecraft. Our attempts to model and forecast F(sub 10.7) uncovered highly entangled dynamics. We concluded that the general lack of predictability in solar activity arises from its nonlinear nature. Nonlinear dynamics allow us to predict F(sub 10.7) more accurately than is possible using stochastic methods for time scales shorter than a characteristic horizon, and with about the same accuracy as using stochastic techniques when the forecasted data exceed this horizon. The forecast horizon is a function of two dynamical invariants: the attractor dimension and the Lyapunov exponent. In recent years, estimation of the attractor dimension reconstructed from a time series has become an important tool in data analysis. In calculating the invariants of the system, the first necessary step is the reconstruction of the attractor for the system from the time-delayed values of the time series. The choice of the time delay is critical for this reconstruction. For an infinite amount of noise-free data, the time delay can, in principle, be chosen almost arbitrarily. However, the quality of the phase portraits produced using the time-delay technique is determined by the value chosen for the delay time. Fraser and Swinney have shown that a good choice for this time delay is the one suggested by Shaw, which uses the first local minimum of the mutual information rather than the autocorrelation function to determine the time delay. This paper presents a refinement of this criterion and applies the refined technique to solar flux data to produce a forecast of the solar activity.

Ashrafi, S.↗
DOE OSTI2021

Bayesian Optimal Sensor Augmentation Via Estimated Mutual Information

We consider the problem of designing a sensor network to most efficiently locate the source of a seismic event. The left panel of Figure 1 shows 982 possible sensor locations in a region of interest. The objective is to infer the unknown location of an earthquake, indicated by the gold dot for illustration purposes. Assume that three sensors have already been placed for data collection. Travel times of the P-wave from the source to the three sensors are observed and used to infer the unknown source location via a Bayesian statistical model described subsequently. The right panel of Figure 1 shows samples from the resulting posterior distribution for source location along with a posterior estimate of this location.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

Community detection in hypergraphs via mutual information maximization

Abstract The hypergraph community detection problem seeks to identify groups of related vertices in hypergraph data. We propose an information-theoretic hypergraph community detection algorithm which compresses the observed data in terms of community labels and community-edge intersections. This algorithm can also be viewed as maximum-likelihood inference in a degree-corrected microcanonical stochastic blockmodel. We perform the compression/inference step via simulated annealing. Unlike several recent algorithms based on canonical models, our microcanonical algorithm does not require inference of statistical parameters such as vertex degrees or pairwise group connection rates. Through synthetic experiments, we find that our algorithm succeeds down to recently-conjectured thresholds for sparse random hypergraphs. We also find competitive performance in cluster recovery tasks on several hypergraph data sets.

97 MATHEMATICS AND COMPUTING↗