Search NASA⌕ Search

SEARCH · Search NASA

Results for “Bayesian theory”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Myths and legends in learning classification rules

This paper is a discussion of machine learning theory on empirically learning classification rules. The paper proposes six myths in the machine learning community that address issues of bias, learning as search, computational learning theory, Occam's razor, 'universal' learning algorithms, and interactive learnings. Some of the problems raised are also addressed from a Bayesian perspective. The paper concludes by suggesting questions that machine learning researchers should be addressing both theoretically and experimentally.

Buntine, Wray↗
NASA NTRS2020

Tests of General Relativity with Stellar-Mass Black Hole Binaries Observed by LISA

We consider the observation of stellar-mass black holes binaries with the Laser Interferometer Space Antenna(LISA). Preliminary results based on Fisher information matrix analyses have suggested that gravitational waves from those sources could be very sensitive to possible deviations from the theory of general relativity (GR) andfrom the strong equivalence principle during the low-frequency binary inspiral. We perform a full Markov Chain Monte Carlo Bayesian analysis to quantify the sensitivity of these signals to two phenomenological modifications of GR, namely a putative gravitational dipole emission and a non-zero mass for the graviton, properly accounting for the detector’s response. Moreover, we consider a scenario where those sources could be observed also with Earth-based detectors, which should measure the coalescence time with precision better than 1 ms. This constraint on the coalescence time further improves the bounds that we can set on those phenomenological deviations from GR. We show that tests of dipole radiation and the graviton’s mass should improve respectively by seven and half an order(s) of magnitude over current bounds. Finally, we discuss under which conditions one may claim the detection of a modification to General Relativity.

Alexandre Toubiana↗
NASA NTRS1990

A distributed agent architecture for real-time knowledge-based systems: Real-time expert systems project, phase 1

We propose a distributed agent architecture (DAA) that can support a variety of paradigms based on both traditional real-time computing and artificial intelligence. DAA consists of distributed agents that are classified into two categories: reactive and cognitive. Reactive agents can be implemented directly in Ada to meet hard real-time requirements and be deployed on on-board embedded processors. A traditional real-time computing methodology under consideration is the rate monotonic theory that can guarantee schedulability based on analytical methods. AI techniques under consideration for reactive agents are approximate or anytime reasoning that can be implemented using Bayesian belief networks as in Guardian. Cognitive agents are traditional expert systems that can be implemented in ART-Ada to meet soft real-time requirements. During the initial design of cognitive agents, it is critical to consider the migration path that would allow initial deployment on ground-based workstations with eventual deployment on on-board processors. ART-Ada technology enables this migration while Lisp-based technologies make it difficult if not impossible. In addition to reactive and cognitive agents, a meta-level agent would be needed to coordinate multiple agents and to provide meta-level control.

Lee, S. Daniel↗
NASA NTRS1985

A Bayesian approach to nonlinear inversion

Powerful methods are now available for solving linear parametric inverse problems. However, many inverse problems which arise in geohysics are nonlinear. Fortunately, it is possible to treat most of these with the air of linear perturbation theory and liner inversion. But a convenient method is needed for assessing the importance of nonlinearity in these quasi-linear problems. The present paper provides such a method. Matsu'ura and Jackson (1984) have presented a simple algorithm for evaluating the asymptotic covariance matrix fo estimation errors. In the present investigation, aspects of linear inversion are discussed, taking into account linear parametric inverse problems, nonuniqueness, prior information, confidence limits, conditional and marginal statistics, the relative importance of the prior and observational data, and standardized variables. Attention is also given to nonlinear inversion, and the application of the considered approaches to a number of examples.

Jackson, D. D.↗
NASA NTRS1991

Cosmic-structure constraints from a one-degree microwave-background anisotropy experiment

A recent anisotropy experiment with a 30-arcmin beam is close to optimal for testing models in which cosmic structure arose from inflation-generated Gaussian density perturbations. Using a Bayesian analysis to constrain the amplitude of the perturbation spectrum, it is shown that adiabatic hot-dark-matter models are convincingly ruled out and cold-dark-matter models have anisotropies near the derived limits. Theories with broken scale invariance such as isocurvature baryon models are strongly constrained, as are models with extra power crafted to give significant large-scale structures and flows.

Bond, J. R.↗
NASA NTRS1995

Computer-Simulation Surrogates for Optimization: Application to Trapezoidal Ducts and Axisymmetric Bodies

Engineering design and optimization efforts using computational systems rapidly become resource intensive. The goal of the surrogate-based approach is to perform a complete optimization with limited resources. In this paper we present a Bayesian-validated approach that informs the designer as to how well the surrogate performs; in particular, our surrogate framework provides precise (albeit probabilistic) bounds on the errors incurred in the surrogate-for-simulation substitution. The theory and algorithms of our computer{simulation surrogate framework are first described. The utility of the framework is then demonstrated through two illustrative examples: maximization of the flowrate of fully developed ow in trapezoidal ducts; and design of an axisymmetric body that achieves a target Stokes drag.

Otto, John C.↗
NASA NTRS2021

Upper Limits on the Isotropic Gravitational-Wave Background from Advanced LIGO and Advanced Virgo's Third Observing Run

We report results of a search for an isotropic gravitational-wave background (GWB) using data from Advanced LIGO's and Advanced Virgo's third observing run (O3) combined with upper limits from the earlier O1 and O2 runs. Unlike in previous observing runs in the advanced detector era, we include Virgo in the search for the GWB. The results of the search are consistent with uncorrelated noise, and therefore we place upper limits on the strength of the GWB. We find that the dimensionless energy density Ω(sub GW) ≤ 5.8 × 10(exp -9) at the 95% credible level for a at (frequency-independent) GWB, using a prior which is uniform in the log of the strength of the GWB, with 99% of the sensitivity coming from the band 20-76.6 Hz; Ω(sub GW)(f) ≤ 3.4 × 10(exp -9) at 25 Hz for a power-law GWB with a spectral index of 2/3 (consistent with expectations for compact binary coalescences), in the band 20-90.6 Hz; and Ω(sub GW)(f) ≤ 3.9 × 10(exp -10) at 25 Hz for a spectral index of 3, in the band 20-291.6 Hz. These upper limits improve over our previous results by a factor of 6.0 for a at GWB, 8.8 for a spectral index of 2/3, and 13.1 for a spectral index of 3. We also search for a GWB arising from scalar and vector modes, which are predicted by alternative theories of gravity; we do not find evidence of these, and place upper limits on the strength of GWBs with these polarizations. We demonstrate that there is no evidence of correlated noise of magnetic origin by performing a Bayesian analysis that allows for the presence of both a GWB and an effective magnetic background arising from geophysical Schumann resonances. We compare our upper limits to a fiducial model for the GWB from the merger of compact binaries, updating the model to use the most recent data-driven population inference from the systems detected during O3a. Finally, we combine our results with observations of individual mergers and show that, at design sensitivity, this joint approach may yield stronger constraints on the merger rate of binary black holes at z ≳ 2 than can be achieved with individually resolved mergers alone.

Ryan Abbott↗
NASA NTRS2018

A Survey of Methods for Computing Best Estimates of Endoatmospheric and Exoatmospheric Trajectories

Beginning with the mathematical prediction of planetary orbits in the early seventeenth century up through the most recent developments in sensor fusion methods, many techniques have emerged that can be employed on the problem of endo and exoatmospheric trajectory estimation. Although early methods were ad hoc, the twentieth century saw the emergence of many systematic approaches to estimation theory that produced a wealth of useful techniques. The broad genesis of estimation theory has resulted in an equally broad array of mathematical principles, methods and vocabulary. Among the fundamental ideas and methods that are briefly touched on are batch and sequential processing, smoothing, estimation, and prediction, sensor fusion, sensor fusion architectures, data association, Bayesian and non Bayesian filtering, the family of Kalman filters, models of the dynamics of the phases of a rocket's flight, and asynchronous, delayed, and asequent data. Along the way, a few trajectory estimation issues are addressed and much of the vocabulary is defined.

Bernard, William P.↗
NASA NTRS1988

Mathematical algorithms for approximate reasoning

Most state of the art expert system environments contain a single and often ad hoc strategy for approximate reasoning. Some environments provide facilities to program the approximate reasoning algorithms. However, the next generation of expert systems should have an environment which contain a choice of several mathematical algorithms for approximate reasoning. To meet the need for validatable and verifiable coding, the expert system environment must no longer depend upon ad hoc reasoning techniques but instead must include mathematically rigorous techniques for approximate reasoning. Popular approximate reasoning techniques are reviewed, including: certainty factors, belief measures, Bayesian probabilities, fuzzy logic, and Shafer-Dempster techniques for reasoning. A group of mathematically rigorous algorithms for approximate reasoning are focused on that could form the basis of a next generation expert system environment. These algorithms are based upon the axioms of set theory and probability theory. To separate these algorithms for approximate reasoning various conditions of mutual exclusivity and independence are imposed upon the assertions. Approximate reasoning algorithms presented include: reasoning with statistically independent assertions, reasoning with mutually exclusive assertions, reasoning with assertions that exhibit minimum overlay within the state space, reasoning with assertions that exhibit maximum overlay within the state space (i.e. fuzzy logic), pessimistic reasoning (i.e. worst case analysis), optimistic reasoning (i.e. best case analysis), and reasoning with assertions with absolutely no knowledge of the possible dependency among the assertions. A robust environment for expert system construction should include the two modes of inference: modus ponens and modus tollens. Modus ponens inference is based upon reasoning towards the conclusion in a statement of logical implication, whereas modus tollens inference is based upon reasoning away from the conclusion. These algorithms allow one to reason accurately with uncertain data. The above environment can replicate state-f-the-art expert system environments which provides a continuity between the current expert systems which cannot be validated or verified and future expert systems which should be both validated and verified

Murphy, John H.↗
NASA NTRS1979

Applications of estimation theory to inverse problems in meteorology

The paper applies iterated and non-iterated extended Kalman filters to solve two practical meteorological inversion problems. Passive microwave satellite soundings are used to infer vertical temperature profiles and cloud parameters. In both cases it is shown that improvements can be obtained over presently used techniques. Finally, the results suggest that modern multivariate nonlinear recursive estimation techniques based in a Bayesian methodology can be a valuable tool in the area of remote sounding of atmospheric parameters.

Gustafson, D. E.↗
NASA NTRS2010

Initialization and Restart in Stochastic Local Search: Computing a Most Probable Explanation in Bayesian Networks

For hard computational problems, stochastic local search has proven to be a competitive approach to finding optimal or approximately optimal problem solutions. Two key research questions for stochastic local search algorithms are: Which algorithms are effective for initialization? When should the search process be restarted? In the present work we investigate these research questions in the context of approximate computation of most probable explanations (MPEs) in Bayesian networks (BNs). We introduce a novel approach, based on the Viterbi algorithm, to explanation initialization in BNs. While the Viterbi algorithm works on sequences and trees, our approach works on BNs with arbitrary topologies. We also give a novel formalization of stochastic local search, with focus on initialization and restart, using probability theory and mixture models. Experimentally, we apply our methods to the problem of MPE computation, using a stochastic local search algorithm known as Stochastic Greedy Search. By carefully optimizing both initialization and restart, we reduce the MPE search time for application BNs by several orders of magnitude compared to using uniform at random initialization without restart. On several BNs from applications, the performance of Stochastic Greedy Search is competitive with clique tree clustering, a state-of-the-art exact algorithm used for MPE computation in BNs.

Mengshoel, Ole J.↗
NASA NTRS2004

Putting Priors in Mixture Density Mercer Kernels

This paper presents a new methodology for automatic knowledge driven data mining based on the theory of Mercer Kernels, which are highly nonlinear symmetric positive definite mappings from the original image space to a very high, possibly infinite dimensional feature space. We describe a new method called Mixture Density Mercer Kernels to learn kernel function directly from data, rather than using predefined kernels. These data adaptive kernels can en- code prior knowledge in the kernel using a Bayesian formulation, thus allowing for physical information to be encoded in the model. We compare the results with existing algorithms on data from the Sloan Digital Sky Survey (SDSS). The code for these experiments has been generated with the AUTOBAYES tool, which automatically generates efficient and documented C/C++ code from abstract statistical model specifications. The core of the system is a schema library which contains template for learning and knowledge discovery algorithms like different versions of EM, or numeric optimization methods like conjugate gradient methods. The template instantiation is supported by symbolic- algebraic computations, which allows AUTOBAYES to find closed-form solutions and, where possible, to integrate them into the code. The results show that the Mixture Density Mercer-Kernel described here outperforms tree-based classification in distinguishing high-redshift galaxies from low- redshift galaxies by approximately 16% on test data, bagged trees by approximately 7%, and bagged trees built on a much larger sample of data by approximately 2%.

Srivastava, Ashok N.↗
NASA NTRS2005

An Ensemble Approach to Building Mercer Kernels with Prior Information

This paper presents a new methodology for automatic knowledge driven data mining based on the theory of Mercer Kernels, which are highly nonlinear symmetric positive definite mappings from the original image space to a very high, possibly dimensional feature space. we describe a new method called Mixture Density Mercer Kernels to learn kernel function directly from data, rather than using pre-defined kernels. These data adaptive kernels can encode prior knowledge in the kernel using a Bayesian formulation, thus allowing for physical information to be encoded in the model. Specifically, we demonstrate the use of the algorithm in situations with extremely small samples of data. We compare the results with existing algorithms on data from the Sloan Digital Sky Survey (SDSS) and demonstrate the method's superior performance against standard methods. The code for these experiments has been generated with the AUTOBAYES tool, which automatically generates efficient and documented C/C++ code from abstract statistical model specifications. The core of the system is a schema library which contains templates for learning and knowledge discovery algorithms like different versions of EM, or numeric optimization methods like conjugate gradient methods. The template instantiation is supported by symbolic-algebraic computations, which allows AUTOBAYES to find closed-form solutions and, where possible, to integrate them into the code.

Srivastava, Ashok N.↗
NASA NTRS2009

A Method for Retrieving Ground Flash Fraction from Satellite Lightning Imager Data

A general theory for retrieving the fraction of ground flashes in N lightning observed by a satellite-based lightning imager is provided. An "exponential model" is applied as a physically reasonable constraint to describe the measured optical parameter distributions, and population statistics (i.e., mean, variance) are invoked to add additional constraints to the retrieval process. The retrieval itself is expressed in terms of a Bayesian inference, and the Maximum A Posteriori (MAP) solution is obtained. The approach is tested by performing simulated retrievals, and retrieval error statistics are provided. The ability to retrieve ground flash fraction has important benefits to the atmospheric chemistry community. For example, using the method to partition the existing satellite global lightning climatology into separate ground and cloud flash climatologies will improve estimates of lightning nitrogen oxides (NOx) production; this in turn will improve both regional air quality and global chemistry/climate model predictions.

Koshak, William J.↗
NASA NTRS2017

Update on Bayesian Blocks: Segmented Models for Sequential Data

The Bayesian Block algorithm, in wide use in astronomy and other areas, has been improved in several ways. The model for block shape has been generalized to include other than constant signal rate - e.g., linear, exponential, or other parametric models. In addition the computational efficiency has been improved, so that instead of O(N**2) the basic algorithm is O(N) in most cases. Other improvements in the theory and application of segmented representations will be described.

Scargle, Jeff↗
NASA NTRS2016

Faint-Source-Star Planetary Microlensing: The Discovery of the Cold Gas-Giant Planet OGLE-2014-BLG-0676Lb

We report the discovery of a planet OGLE-2014-BLG-0676Lb via gravitational microlensing. Observations for the lensing event were made by the following groups: Microlensing Observations in Astrophysics; Optical Gravitational Lensing Experiment; Wise Observatory; RoboNETLas Cumbres Observatory Global Telescope; Microlensing Network for the Detection of Small Terrestrial Exoplanets; and -FUN. All analyses of the light-curve data favoura lens system comprising a planetary mass orbiting a host star. The most-favoured binary lens model has a mass ratio between the two lens masses of (4.78 +/- 0.13) 10(exp -3). Subject to some important assumptions, a Bayesian probability density analysis suggests the lens system comprises a 3.09(+1.02/-1.12) MJ planet orbiting a 0.62(+0.20/-0.22) solar mass host star at a deprojected orbital separation of 4.40(+2.16/-1.46) au. The distance to the lens system is 2.22(+0.96/-0.83) kpc. Planet OGLE-2014-BLG-0676Lb provides additional data to the growing number of cool planets discover redusing gravitational microlensing against which planetary formation theories may be tested. Most of the light in the baseline of this event is expected to come from the lens and thus high-resolution imaging observations could confirm our planetary model interpretation.

OGLE-2014-BLG-0676Lb↗
NASA NTRS1995

Inductive Approaches to Improving Diagnosis and Design for Diagnosability

The first research area under this grant addresses the problem of classifying time series according to their morphological features in the time domain. A supervised learning system called CALCHAS, which induces a classification procedure for signatures from preclassified examples, was developed. For each of several signature classes, the system infers a model that captures the class's morphological features using Bayesian model induction and the minimum message length approach to assign priors. After induction, a time series (signature) is classified in one of the classes when there is enough evidence to support that decision. Time series with sufficiently novel features, belonging to classes not present in the training set, are recognized as such. A second area of research assumes two sources of information about a system: a model or domain theory that encodes aspects of the system under study and data from actual system operations over time. A model, when it exists, represents strong prior expectations about how a system will perform. Our work with a diagnostic model of the RCS (Reaction Control System) of the Space Shuttle motivated the development of SIG, a system which combines information from a model (or domain theory) and data. As it tracks RCS behavior, the model computes quantitative and qualitative values. Induction is then performed over the data represented by both the 'raw' features and the model-computed high-level features. Finally, work on clustering for operating mode discovery motivated some important extensions to the clustering strategy we had used. One modification appends an iterative optimization technique onto the clustering system; this optimization strategy appears to be novel in the clustering literature. A second modification improves the noise tolerance of the clustering system. In particular, we adapt resampling-based pruning strategies used by supervised learning systems to the task of simplifying hierarchical clusterings, thus making post-clustering analysis easier.

Fisher, Douglas H.↗
NASA NTRS2007

The Business Case for Automated Software Engineering

Adoption of advanced automated SE (ASE) tools would be more favored if a business case could be made that these tools are more valuable than alternate methods. In theory, software prediction models can be used to make that case. In practice, this is complicated by the 'local tuning' problem. Normally. predictors for software effort and defects and threat use local data to tune their predictions. Such local tuning data is often unavailable. This paper shows that assessing the relative merits of different SE methods need not require precise local tunings. STAR 1 is a simulated annealer plus a Bayesian post-processor that explores the space of possible local tunings within software prediction models. STAR 1 ranks project decisions by their effects on effort and defects and threats. In experiments with NASA systems. STARI found one project where ASE were essential for minimizing effort/ defect/ threats; and another project were ASE tools were merely optional.

model evaluation↗