Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 12 of 12 for “"Gibbs algorithm"”.

  1. Efficient Hamiltonian Monte Carlo for large data sets by data subsampling

    … it also increases the computational cost of the algorithms appreciably, especially for large data sets. This thesis presents some novel methods that focus on speeding up inference by combining HMC and data subsampling. The first contribution is a Metropolis within Gibbs algorithm that …

    unsw Repository record for Efficient Hamiltonian Monte Carlo for large data sets by data subsampling (opens in a new tab)

  2. Stochastic search gene suggestion: Hierarchical Bayesian model selection meets gene mapping

    … statistics. We developed a Metropolis-within-Gibbs algorithm to sample our gene suggestion posterior, and evaluated the algorithm's performance on simulated data and completed the research with application to real data, searching for genes associated with Rheumatoid Arthritis. On simulated …

    rice Repository record for Stochastic search gene suggestion: Hierarchical Bayesian model selection meets gene mapping (opens in a new tab)

  3. Essays on Policy Evaluation

    … resolve by developing a novel Metropolis-within-Gibbs algorithm that updates the regression coefficients of two predictors simultaneously. To illustrate its practical values, we apply it to two empirical examples for estimating the effect of economic policies. In the second chapter, we provide …

    tamu Repository record for Essays on Policy Evaluation (opens in a new tab) Embargoed until 2028-05-01

  4. Convergence of Adaptive Markov Chain Monte Carlo Algorithms

    … some specific form is one, the adaptive MCMC algorithm is ergodic. For adaptive MCMC algorithm with Markovian adaptation, the algorithm satisfying simultaneous polynomial ergodicity is ergodic without those restrictions. We also discuss some recent results related to this topic. \indent Second …

    toronto-retro Repository record for Convergence of Adaptive Markov Chain Monte Carlo Algorithms (opens in a new tab)

  5. Generalized Gaussian process models with Bayesian variable selection

    … sampling scheme with a newer Metropolis-within-Gibbs algorithm. The new construction achieves a substantial improvement in computational efficiency while simultaneously reducing false positives. Next, leverage this efficient scheme to investigate selection methods for addressing more complex …

    rice Repository record for Generalized Gaussian process models with Bayesian variable selection (opens in a new tab)

  6. General and Efficient Bayesian Computation through Hamiltonian Monte Carlo Extensions

    … Monte Carlo (HMC) is a state-of-the-art sampling algorithm for Bayesian computation. Popular probabilistic programming languages Stan and PyMC rely on HMC’s generality and efficiency to provide automatic Bayesian inference platforms for practitioners. Despite its wide-spread use and numerous …

    duke Repository record for General and Efficient Bayesian Computation through Hamiltonian Monte Carlo Extensions (opens in a new tab)

  7. Statistical Modeling and Predictions Based on Field Data and Dynamic Covariates

    … is challenging. A modified alternative algorithm and the corresponding prediction method are proposed. In Chapter 4, we introduce a multi-level trend-renewal process (MTRP) model to describe component-level events in multi-level repairable systems. In particular, we consider two-level …

    vt Repository record for Statistical Modeling and Predictions Based on Field Data and Dynamic Covariates (opens in a new tab)

  8. Statistical methods in detecting differential expressed genes, analyzing insertion tolerance for genes and group selection for survival data

    … and derive an Expectation-Maximization (EM) algorithm to obtain parameter estimates. We also propose a multiple testing procedure that categorizes genes into each of the three states, hypo-tolerant, tolerant, and hyper-tolerant, while controlling false discovery rate. Simulation studies show …

    iastate Repository record for Statistical methods in detecting differential expressed genes, analyzing insertion tolerance for genes and group selection for survival data (opens in a new tab)

  9. An Approximate MCMC Method for Convex Hulls

    … Carlo (MCMC) is an extremely popular class of algorithms for computing summaries of posterior distributions. One problem for MCMC in the so-called Big Data regime is the growing computational cost of most MCMC algorithms. Most popular and basic MCMC algorithms, like Metropolis-Hastings …

    ottawa-retro Repository record for An Approximate MCMC Method for Convex Hulls (opens in a new tab)

  10. Statistical methods for gene expression studies using next-generation sequencing experiments

    … posterior simulation using Metropolis Hastings algorithm to generate posterior samples for differential expression analysis while controlling FDR. Simulation study results suggest that our proposed method outperforms other popular methods used for detecting DE genes.</p> <p>In Chapter 4, we …

    iastate Repository record for Statistical methods for gene expression studies using next-generation sequencing experiments (opens in a new tab)

  11. Information-theoretic limitations of distributed information processing

    … the generalization capability of a learning algorithm and its stability property measured by the mutual information between its input and output, and then derive achievability results on the generalization error of adaptively composed learning algorithms. In all cases, we obtain general …

    uiuc Repository record for Information-theoretic limitations of distributed information processing (opens in a new tab)