Refined sparse Bayesian learning configuration for stochastic response analysis

In this article we study the sparse signal recovery problem in a Bayesian framework using a novel Bootstrapped Sparse Bayesian Learning method. Sparse Bayesian Learning (SBL) framework is an effective tool for pruning out the irrelevant features and ending up with a sparse representation. In SBL the choice of prior over the variances of the Gaussian Scale mixture has been an interesting area of research for some time now. This motivates us to use a more generalized maximum entropy density as the prior which results in a new variant of SBL. It has been shown to perform better than traditional SBL empirically and it also accelerates the pruning procedure. Because of this advantage, this variant of SBL can be claimed as more robust choice as it is less sensitive to the threshold for pruning. Theoretical justifications have also been provided to show that the proposed model actually promotes sparse point estimates.

Process monitoring plays an important role in ensuring the safety and stable operation of equipment in a large-scale process. This paper proposes a novel data-driven process monitoring framework, termed the ensemble adaptive sparse Bayesian transfer learning machine (EAdspB-TLM), for nonlinear fault diagnosis. The proposed framework has the following advantages: Firstly, the probabilistic relevance vector machine (PrRVM) under Bayesian framework is re-derived so that it can be used to forecast the plant operating conditions. Secondly, we extend the PrRVM method and assimilate transfer learning into the sparse Bayesian learning framework to provide it with the transferring ability. Thirdly, the source domain (SD) data are re-enabled to alleviate the issue of insufficient training data. Finally, the proposed EAdspB-TLM framework was effectively applied to monitor a real wastewater treatment process (WWTP) and a Tennessee Eastman chemical process (TECP). The results further demonstrate that the proposed method is feasible.

Based on the high dimensional model representation (HDMR) and Monte Carlo simulation (MCS), this paper presents the improved method used to evaluate the failure probability of the system with multi-failure models. The HDMR is a general set of quantitative model assessment and analysis tools for capturing the high-dimensional relationships between sets of input and output model variables. Once the limit state function is defined by using the HDMR, the failure probability can be obtained by using the MCS without increasing computational efforts. The series and parallel system are considered in this paper, a numerical example is presented to demonstrate the efficiency and the accuracy of the proposed method. It is shown that the efficiency of the HDMR are both high in terms of series system and parallel system, the accuracy can be acceptable with respect to series system, and the accuracy can not be acceptable with respect to parallel system.

Scalable and memory-efficient sparse learning for classification with approximate Bayesian regularization priors

Collaborative Direction of Arrival estimation by using Alternating Direction Method of Multipliers in distributed sensor array networks employing Sparse Bayesian Learning framework

In this paper, we develop a new sparse Bayesian learning method for recovery of block-sparse signals with un- known cluster patterns. A pattern-coupled hierarchical Gaussian prior model is introduced to characterize the statistical depen- dencies among coefficients, where a set of hyperparameters are employed to control the sparsity of signal coefficients. Unlike the conventional sparse Bayesian learning framework in which each individual hyperparameter is associated independently with each coefficient, in this paper, the prior for each coefficient not only involves its own hyperparameter, but also the hyperparameters of its immediate neighbors. In doing this way, the sparsity patterns of neighboring coefficients are related to each other and the hierarchical model has the potential to encourage structured- sparse solutions. The hyperparameters, along with the sparse signal, are learned by maximizing their posterior probability via an expectation-maximization (EM) algorithm. Index Terms— Sparse Bayesian learning, pattern-coupled hi- erarchical model, block-sparse signal recovery.

Hyperspectral unmixing is a technique that can be used to find the materials and their corresponding proportions present in observed mixed pixels. It has been widely used for hyperspectral data exploitation. Traditionally, this problem is solved using the constrained least squares optimization, which would lead to a dense solution. In recent years, researchers have observed that the number of materials in a mixed pixel is generally much smaller than the whole number of materials present in a given scene. They proposed to solve the problem through sparse unmixing approaches, which generally lead to constrained optimization. These sparse unmixing approaches have received considerable attention over the past few years. From the perspective of Bayesian inference, these methods assume fixed priors. In this article, we propose to solve the spectral unmixing problem by using sparse Bayesian learning (SBL) framework. In contrast to the approaches that use fixed priors, SBL incorporates a hierarchical parameterized prior that encourages sparsity in representation in its Bayesian inference to obtain a sparse solution. Experimental results on simulated data sets and a real hyperspectral scene demonstrate that the proposed method can achieve good performance compared with some state-of-the-art sparse unmixing algorithms. Our results also show that the proposed method can achieve good performance with a set of default parameter settings.

Multi-scale stochastic dynamic response analysis of offshore risers with lognormal uncertainties

An extended two-scale random field model for stochastic response analysis and its application to RC Short-leg shear wall structure

Uncertainty propagation (UP) of the frequency response is essential for the robust design of viscoelastic damping structures. One challenge in solving this problem is enormous computation cost from the UP analysis. This paper aims to develop a novel computational effective method based on the combination of the adaptive sparse grid collocation (ASGC) method and the high dimensional model representation (HDMR) technique to evaluate the variability of the frequency response of viscoelastic damping structures. First, a well-validated layer-wise finite element method is employed to model the viscoelastic damping structures. The direct frequency response (DFR) method is utilized to calculate the response. Then, a modified adaptive strategy using expectation increments as the sampling indicator is proposed for cost-effective sparse grid construction. Lastly, high dimensional model representation (HDMR) technique is introduced to address the difficulty in moderate and high random dimensional situations. Two numerical examples are provided to assess the performances of the proposed method. Variations in constitutive parameters of viscoelastic material and thicknesses of the viscoelastic layer are considered. Numerical results show that, compared to the original high-dimensional ASGC method and Monte Carlo Simulation (MCS), the proposed method accurately predicts the variability of frequency responses and significantly improves the computational efficiency.

This paper presents a new and alternative computational tool for predicting failure probability of structural/mechanical systems subject to random loads, material properties, and geometry based on high‐dimensional model representation (HDMR) generated from low‐order function components. HDMR is a general set of quantitative model assessment and analysis tools for capturing the high‐dimensional relationships between sets of input and output model variables. It is a very efficient formulation of the system response, if higher‐order variable correlations are weak, allowing the physical model to be captured by the lower‐order terms and facilitating lower‐dimensional approximation of the original high‐dimensional implicit limit state/performance function. When first‐order HDMR approximation of the original high‐dimensional implicit limit state/performance function is not adequate to provide the desired accuracy to the predicted failure probability, this paper presents an enhanced HDMR (eHDMR) method to represent the higher‐order terms of HDMR expansion by expressions similar to the lower‐order ones with monomial multipliers. The accuracy of the HDMR expansion can be significantly improved using preconditioning with a minimal number of additional input–output samples without directly invoking the determination of second‐ and higher‐order terms. The mathematical foundation of eHDMR is presented along with its applicability to approximate the original high‐dimensional implicit limit state/performance function for subsequent reliability analysis, given that conventional methods for reliability analysis are computationally demanding when applied in conjunction with complex finite element models. This study aims to assess how accurately and efficiently the eHDMR approximation technique can capture complex model output uncertainty. The limit state/performance function surrogate is constructed using moving least‐squares interpolation formula by component functions of eHDMR expansion. Once the approximate form of implicit response function is defined, the failure probability can be obtained by statistical simulation. Results of five numerical examples involving elementary mathematical functions and structural/solid‐mechanics problems indicate that the failure probability obtained using the eHDMR approximation method for implicit limit state/performance function, provides significant accuracy when compared with the conventional Monte Carlo method, while requiring fewer original model simulations. Copyright © 2008 John Wiley & Sons, Ltd.

Range-velocity (RV) map (also called the range-Doppler map) is used in radar to detect targets and estimate the range and velocity of the targets. The conventional range-Doppler processing has its limits in attaining a high-resolution RV map with few samples. Moreover, the conventional range-Doppler processing may cause severe range migration problems and bias in the range estimation. In this paper, we propose to attain a high-resolution and accurate RV map with the sparse Bayesian learning (SBL) framework. Unlike the existing works that use the discrete Fourier transform to build the dictionary for sparse representation, we build a dictionary from a model of the wide-band frequency-modulated continuous-wave (FMCW) radar to avoid the model mismatch problem. This dictionary allows for the effective decomposition of the signal and the full utilization of the structure of the signal. In addition, based on the fast marginal likelihood maximization, we also propose a fast method to reduce the computational burden. Simulations show that the proposed method and the proposed fast method are superior in terms of resolution, accuracy, and maximum unambiguous velocity compared with the existing methods.

A practical and efficient reliability-based design optimization method for rock tunnel support

In this paper we present a probabilistic formalization of the instance-based learning approach. In our Bayesian framework, moving from the construction of an explicit hypothesis to a data-driven instancebased learning approach, is equivalent to averaging over all the (possibly infinitely many) individual models. The general Bayesian instance-based learning framework described in this paper can be applied with any set of assumptions defining a parametric model family, and to any discrete prediction task where the number of simultaneously predicted attributes is small, which includes for example all classification tasks prevalent in the machine learning literature. To illustrate the use of the suggested general framework in practice, we show how the approach can be implemented in the special case with the strong independence assumptions underlying the so called Naive Bayes classifier. The resulting Bayesian instance-based classifier is validated empirically with public domain data sets and the results are compared to the performance of the traditional Naive Bayes classifier. The results suggest that the Bayesian instancebased learning approach yields better results than the traditional Naive Bayes classifier, especially in cases where the amount of the training data is small.

An efficient off-grid direction-of-arrival estimation method based on inverse-free sparse Bayesian learning