Engineering Papers⌕ Search

DOE OSTI · 2007331

Hierarchical Model for Bayesian Hypothesis Testing

Abstract

A common problem in data analysis is testing a point hypothesis. For example, one might test whether or not the mean of a distribution is zero. We describe the standard Bayesian approach, which requires the choice of a width parameter to define a prior distribution for an alternative hypothesis. Standard practice is to choose this width parameter to be the least favorable choice for the original, point hypothesis. This approach, however, is ad-hoc and not informed by the data. We examine this practice in more detail than in previous work by constructing a hierarchical model, where the width parameter is an unknown value subject to inference. This yields a marginal posterior distribution for the width parameter. We then show that using the median of this marginal posterior distribution as the width parameter in the Bayesian comparison between the hypotheses gives results which are very similar to those obtained from the existing approaches. This gives a more rigorous and data-informed justification for the standard practice of choosing a width parameter which is least favorable to the point hypothesis.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrews, Stephen Arthur, Sigeti, David Edward. 2018-07-20. Hierarchical Model for Bayesian Hypothesis Testing. https://doi.org/10.2172/2007331

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related reports

TANTE: Time-adaptive operator learning via neural Taylor expansion

Operator learning for time-dependent partial differential equations (PDEs) has seen rapid progress in recent years, enabling efficient approximation of complex spatiotemporal dynamics. However, most existing methods rely on fixed time step sizes during rollout, which limits their ability to adapt to varying temporal complexity and often leads to error accumulation. In this work, we propose the Time-Adaptive Transformer with Neural Taylor Expansion (TANTE), a novel operator-learning framework that produces continuous-time predictions with adaptive step sizes. TANTE predicts future states by performing a Taylor expansion at the current state, where neural networks learn both the higher-order temporal derivatives and the local radius of convergence. This allows the model to dynamically adjust its rollout based on the local behavior of the solution, thereby reducing cumulative error and improving computational efficiency. We demonstrate the effectiveness of TANTE across a wide range of PDE benchmarks, achieving superior accuracy and adaptability compared to fixed-step baselines, delivering accuracy gains of 60-80 % and speed-ups of 30-40 % at inference time.

97 MATHEMATICS AND COMPUTING↗

Structured illumination for surface-resolved grazing-incidence X-ray scattering

Grazing-incidence (GI) scattering techniques are widely used to characterize thin films, offering high surface sensitivity and insight into morphology and structure. However, these approaches typically provide statistical averaged information due to elongated footprint or limited spatial resolution due to beam size. Here we introduce a method that combines structured illumination with GI X-ray scattering and leverages our computational imaging approach to resolve local structural details. We demonstrate that our method captures local features of an organic semiconductor thin film without the need for sample rotation as in tomography. The method expands GI techniques from statistical averaging to high-resolution imaging, thereby providing the capability for detailed analysis of local material properties, such as domain shape, orientation and polymorphism, which are critical for advancing material design towards more efficient and tailored materials.

97 MATHEMATICS AND COMPUTING↗