Search NASA⌕ Search

SEARCH · Search NASA

Results for “hypothesis tests”

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 37 records · Page 2

$N$=5, 6, 7, 8: Nested hypothesis tests and truncation dependence of $|V_{cb}|$ |Vcb|

The determination of | V c b | from exclusive semileptonic B → D * ℓ ν decays is sensitive to the choice of form factor parametrization. Larger | V c b | values are obtained by fitting the Boyd-Grinstein-Lebed (BGL) versus the Caprini-Lellouch-Neubert (CLN) parametrization to recent Belle measurements. For the BGL parametrization, published fits use different numbers of parameters. We propose a method based on nested hypothesis tests to determine the optimal number of BGL parameters to fit the data, and find that six parameters are optimal to fit the Belle tagged and unfolded measurement. We further explore the differences between fits that use different numbers of parameters. The fits which yield | V c b | values in better agreement with determinations from inclusive semileptonic decays tend to exhibit tensions with heavy quark symmetry expectations. These have to be resolved before the determinations of | V c b | from exclusive and inclusive decays can be considered understood.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Sparse Bayesian mass mapping with uncertainties: hypothesis testing of structure

ABSTRACT A crucial aspect of mass mapping, via weak lensing, is quantification of the uncertainty introduced during the reconstruction process. Properly accounting for these errors has been largely ignored to date. We present a new method to reconstruct maximum a posteriori (MAP) convergence maps by formulating an unconstrained Bayesian inference problem with Laplace-type l1-norm sparsity-promoting priors, which we solve via convex optimization. Approaching mass mapping in this manner allows us to exploit recent developments in probability concentration theory to infer theoretically conservative uncertainties for our MAP reconstructions, without relying on assumptions of Gaussianity. For the first time, these methods allow us to perform hypothesis testing of structure, from which it is possible to distinguish between physical objects and artefacts of the reconstruction. Here, we present this new formalism, and demonstrate the method on simulations, before applying the developed formalism to two observational data sets of the Abell 520 cluster. Initial reconstructions of the Abell 520 catalogues reported the detection of an anomalous ‘dark core’ – an overdense region with no optical counterpart – which was taken to be evidence for self-interacting dark matter. In our Bayesian framework, it is found that neither Abell 520 data set can conclusively determine the physicality of such dark cores at $99{{\ \rm per\ cent}}$ confidence. However, in both cases the recovered MAP estimators are consistent with both sets of data.

Price, M. A.↗

Second-order asymptotics for quantum hypothesis testing in settings beyond i.i.d.—quantum lattice systems and more

Quantum Stein’s lemma is a cornerstone of quantum statistics and concerns the problem of correctly identifying a quantum state, given the knowledge that it is one of two specific states (ρ or σ). It was originally derived in the asymptotic i.i.d. setting, in which arbitrarily many (say, n) identical copies of the state (ρ{sup ⊗n} or σ{sup ⊗n}) are considered to be available. In this setting, the lemma states that, for any given upper bound on the probability α{sub n} of erroneously inferring the state to be σ, the probability β{sub n} of erroneously inferring the state to be ρ decays exponentially in n, with the rate of decay converging to the relative entropy of the two states. The second order asymptotics for quantum hypothesis testing, which establishes the speed of convergence of this rate of decay to its limiting value, was derived in the i.i.d. setting independently by Tomamichel and Hayashi, and Li. We extend this result to settings beyond i.i.d. Examples of these include Gibbs states of quantum spin systems (with finite-range, translation-invariant interactions) at high temperatures, and quasi-free states of fermionic lattice gases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Salvage HDR Brachytherapy: Multiple Hypothesis Testing Versus Machine Learning Analysis

Salvage high-dose-rate brachytherapy (sHDRB) is a treatment option for recurrences after prior radiation therapy. However, only approximately 50% of patients benefit, with the majority of second recurrences after salvage brachytherapy occurring distantly. Therefore, identification of characteristics that can help select patients who may benefit most from sHDRB is critical. Machine learning may be used to identify characteristics that predict outcome following sHDRB. We aimed to use machine learning to identify patient characteristics associated with biochemical failure (BF) following prostate sHDRB.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Uncertainty Quantification of Hypothesis Testing for the Integrated Knowledge Engine

The Integrated Knowledge Engine (IKE) is a tool of Bayesian analysis, based on Bayesian Belief Networks or Bayesian networks for short. A Bayesian network is a graphical model (directed acyclic graph) that allows representing the probabilistic structure of many variables assuming a localized type of dependency called the Markov property. The Markov property in this instance makes any node or random variable to be independent of any non-descendant node given information about its parent. A direct consequence of this property is that it is relatively easy to incorporate new evidence and derive the appropriate consequences, which in general is not an easy or feasible task. Typically we use Bayesian networks as predictive models for a small subset of the variables, either the leave nodes or the root nodes. In IKE, since most applications deal with diagnostics, we are interested in predicting the likelihood of the root nodes given new observations on any of the children nodes. The root nodes represent the various possible outcomes of the analysis, and an important problem is to determine when we have gathered enough evidence to lean toward one of these particular outcomes. This document presents criteria to decide when the evidence gathered is sufficient to draw a particular conclusion or decide in favor of a particular outcome by quantifying the uncertainty in the conclusions that are drawn from the data. The material in this document is organized as follows: Section 2 presents briefly a forensics Bayesian network, and we explore evaluating the information provided by new evidence by looking first at the posterior distribution of the nodes of interest, and then at the corresponding posterior odds ratios. Section 3 presents a third alternative: Bayes Factors. In section 4 we finalize by showing the relation between the posterior odds ratios and Bayes factors and showing examples these cases, and in section 5 we conclude by providing clear guidelines of how to use these for the type of Bayesian networks used in IKE.

97 MATHEMATICS AND COMPUTING↗

Statistical Hypothesis Testing using CNN Features for Synthesis of Adversarial Counterexamples to Human and Object Detection Vision Systems

Validating the correctness of human detection vision systems is crucial for safety applications such as pedestrian collision avoidance in autonomous vehicles. The enormous space of possible inputs to such an intelligent system makes it difficult to design test cases for such systems. In this report, we present our tool MAYA that uses an error model derived from a convolutional neural network (CNN) to explore the space of images similar to a given input image, and then tests the correctness of a given human or object detection system on such perturbed images. We demonstrate the capability of our tool on the pre-trained Histogram-of-Oriented-Gradients (HOG) human detection algorithm implemented in the popular OpenCV toolset and the Caffe object detection system pre-trained on the ImageNet benchmark. Our tool may serve as a testing resource for the designers of intelligent human and object detection systems.

97 MATHEMATICS AND COMPUTING↗

A New Approach to Distributed Hypothesis Testing and Non-Bayesian Learning: Improved Learning Rate and Byzantine-Resilience

Here, we study a setting where a group of agents, each receiving partially informative private signals, seek to collaboratively learn the true underlying state of the world (from a finite set of hypotheses) that generates their joint observation profiles. To solve this problem, we propose a distributed learning rule that differs fundamentally from existing approaches, in that it does not employ any form of “belief-averaging”. Instead, agents update their beliefs based on a min-rule. Under standard assumptions on the observation model and the network structure, we establish that each agent learns the truth asymptotically almost surely. As our main contribution, we prove that with probability 1, each false hypothesis is ruled out by every agent exponentially fast, at a network-independent rate that is strictly larger than existing rates. We then develop a computationally-efficient variant of our learning rule that is provably resilient to agents who do not behave as expected (as represented by a Byzantine adversary model) and deliberately try to spread misinformation.

42 ENGINEERING↗

Quantum hypothesis testing with group symmetry

The asymptotic discrimination problem of two quantum states is studied in the setting where measurements are required to be invariant under some symmetry group of the system. We consider various asymptotic error exponents in connection with the problems of the Chernoff bound, the Hoeffding bound, and Stein's lemma, and derive bounds on these quantities in terms of their corresponding statistical distance measures. A special emphasis is put on the comparison of the performances of group-invariant and unrestricted measurements.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hypothesis Tests on Rayleigh Wave Radiation Pattern Shapes: A Theoretical Assessment for Source Screening (Independent Review: LANL Source Physics LCP) [Slides]

Background for TRL 0-1 Research: we require a simple regional source discriminant that has a predictive capability and a quantifiable screening performance (probability of correct attribution); Challenge: many local and near-regional source discriminants do not test source mechanism; rather, they test depth. Such empirically validated discriminants are not all theoretically justified; and, Proposal: we test Rayleigh wave radiation patterns for any significant deviation from circular shape as a discriminant.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Hypothesis testing via AI: Generating physically interpretable models of scientific data with machine learning (Full Technical Report)

Deep learning has demonstrated an exceptional ability to solve complex tasks (an engineering success); however, it has done so at the expense of the ability to generate new knowledge (a scientific failure). We propose an alternative framework—entitled Deep Symbolic Regression (DSR)—in which artificial neural networks (NNs) rapidly generate hypotheses about physical relationships among inputs. This framework bypasses the need to interpret an NN altogether, while still leveraging the representational power of deep learning. The resulting models are tractable mathematical expressions, which are inherently and readily human interpretable and can provide insights into underlying physical phenomena. Further, we fold this methodology into the scientific process by allowing the scientist to directly integrate a priori knowledge and beliefs to accelerate learning. We demonstrate this methodology on symbolic regression—the problem of rediscovering underlying expressions describing a dataset—and achieve state-of-the-art performance across a wide variety of symbolic regression problems. Further, we generalize our DSR framework to apply to the more general class of symbolic optimization problems, in which one seeks to optimize a sequence of symbols or “tokens” under a black-box reward function. Examples of other symbolic optimization problems include neural architecture search and computational antibody design. Our generalized tool, Deep Symbolic Optimization (DSO), has been demonstrated on the task of learning symbolic control policies for reinforcement learning environments, and has been adopted as an enabling capability for computational antibody design.

97 MATHEMATICS AND COMPUTING↗