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 20 of 35 for “"rejection sampling"”.

  1. Quantum Rejection Sampling

    … for this task which we refer to as quantum rejection sampling protocols. Inspired by the classical rejection sampling protocol of Harsha, Jain, McAllester, and Radhakrishnan [25] for a similar classical communication task, we introduce the Greedy Quantum Rejection Sampler. We characterize …

    waterloo Repository record for Quantum Rejection Sampling (opens in a new tab)

  2. Drawing Exact Samples: Rejection Sampling, Density Fusion and Constrained Disaggregation

    Sampling is an important topic in the area of computational statistics. Being able to draw samples from a designated distribution allows one to numerically compute various statistics without the need to solve for solutions analytically. A popular branch of the sampling method generates samples by …

    essex Download PDF for Drawing Exact Samples: Rejection Sampling, Density Fusion and Constrained Disaggregation (opens in a new tab)

  3. On amortized inference in large-scale simulators

    … variance. An instance of this is importance sampling inference in programs that explicitly include rejection sampling as part of the user-programmed generative procedure. We develop a new and efficient amortized importance sampling estimator. We prove finite variance of our estimator and …

    ubc Repository record for On amortized inference in large-scale simulators (opens in a new tab) Download PDF for On amortized inference in large-scale simulators (opens in a new tab)

  4. Quantum algorithms for searching, resampling, and hidden shift problems

    … walk based search algorithms, (2) quantum rejection sampling, and (3) the Boolean function hidden shift problem. The first two parts deal with generic techniques for constructing quantum algorithms, and the last part is on quantum algorithms for a specific algebraic problem. In the first …

    waterloo Repository record for Quantum algorithms for searching, resampling, and hidden shift problems (opens in a new tab)

  5. Modelling ordinal categorical data : A Gibbs sampler approach

    … effects generalized linear model. The adaptive rejection sampling (ARS) method introduced by Gilks and Wild (1992) is used in the Gibbs sampling scheme. Good resulted are obtained in simulations and we applied this model to analyze data concerning telephone connection quality supplied by British …

    soton Download PDF for Modelling ordinal categorical data : A Gibbs sampler approach (opens in a new tab)

  6. Sampling approaches in Bayesian computational statistics with R

    … to solve this problem. We discuss Acceptance-Rejection sampling, importance sampling and then the MCMC methods. Metropolis-Hasting algorithm, as a very versatile, efficient and powerful simulation technique to construct a Markov Chain, borrows the idea from the well-known acceptance-rejection …

    texas Repository record for Sampling approaches in Bayesian computational statistics with R (opens in a new tab)

  7. Sampling uniform hypergraphs with given degrees

    … degree sequence d. We focus on algorithms for sampling these hypergraphs, particularly when the degree sequence is approximately regular and sufficiently sparse. The goal is an algorithm which produces approximately uniform output with expected running time that is polynomial in the number of …

    unsw Repository record for Sampling uniform hypergraphs with given degrees (opens in a new tab)

  8. Exact Sampling and Optimisation in Statistical Machine Translation

    … of searching for the optimum translation { or sampling { the task of nding a subset of translations that is statistically representative of the goal distribution. Beam-search is an example of an approximate optimisation technique, where maximisation is performed over a heuristically pruned …

    wlv Repository record for Exact Sampling and Optimisation in Statistical Machine Translation (opens in a new tab) Download file for Exact Sampling and Optimisation in Statistical Machine Translation (opens in a new tab)

  9. Research on Approximate Bayesian Computation

    … for statistical inference problems that require sampling from distributions which are intractable. We propose to develop our sampling algorithm based on a class of Monte Carlo methods, Approximate Bayesian Computation (ABC), which are specifically designed to deal with this type of …

    south-carolina Repository record for Research on Approximate Bayesian Computation (opens in a new tab)

  10. Simuleringsdriven inferens av stokastiska dynamiska system

    … överblick av två olika ABC baserade algoritmer, Rejection sampling (ABC-R) och Sequential Monte Carlo (ABC-SMC), och jämför dessa med Metropolis-Hastings Euler-Maruyama-metoden (MH-EM). Metodiken innefattar numerisk diskretisering, simulering och inferens av Ornstein-Uhlenbeckmodellen vars …

    chalmers Repository record for Simuleringsdriven inferens av stokastiska dynamiska system (opens in a new tab)

  11. Towards realistic controllable driving simulators

    … we develop TITRATED, which combines amortized rejection sampling with differentiable infraction losses, and CriticSMC, a novel algorithm that enhances planning efficiency through learned value function heuristics. We then present Control-ITRA, enabling precise control over agent behavior …

    ubc Repository record for Towards realistic controllable driving simulators (opens in a new tab) Download PDF for Towards realistic controllable driving simulators (opens in a new tab)

  12. RaNT-GRAPH: Sampling One Hundred Billion Random Walks Using an Optimized Distributed Graph Data Structure

    Sampling random walks is an important element of many graph algorithms and has been applied to problems such as graph embedding, link prediction, and centrality ranking. With the increase in data resulting in large-scale graphs in a variety of domains, the need for performant walk sampling is …

    tamu Repository record for RaNT-GRAPH: Sampling One Hundred Billion Random Walks Using an Optimized Distributed Graph Data Structure (opens in a new tab)

  13. Applications of parameter inference and modelling in cardiac single-cell action potential models

    … using Gaussian process emulators and rejection sampling. The method accurately captures variations in APD and correlates them with changes in ionic conductances across a population of models. By utilizing rejection sampling in combination with GP emulation, large populations of models …

    glasgow Repository record for Applications of parameter inference and modelling in cardiac single-cell action potential models (opens in a new tab) Download PDF for Applications of parameter inference and modelling in cardiac single-cell action potential models (opens in a new tab)

  14. Time-optimal sampling-based motion planning for manipulators with acceleration limits

    … the better the robot is able to perform. Sampling-based algorithms have been successful in geometric domains, which ignore actuator limitations. They are simple, parameter-free, probabilistically complete and fast. Even though some algorithms like RRTs were specifically designed for …

    gatech Repository record for Time-optimal sampling-based motion planning for manipulators with acceleration limits (opens in a new tab)

  15. Uncertainty Analysis of Biological Nonlinear Models Based on Bayesian Estimation

    … In this study, Bayesian estimation with rejection sampling has been extended to estimate the parameters of nonlinear models. This estimation method can estimate marginal distributions and correlation among all parameters of nonlinear models. A sampling algorithm, Conditional Independent …

    uiuc Repository record for Uncertainty Analysis of Biological Nonlinear Models Based on Bayesian Estimation (opens in a new tab)

  16. Modernizing Latent Gaussian Process Inference for Non-Gaussian Responses

    … is required. Consequently, fully Bayesian, sampling-based approaches have been largely abandoned in favor of maximization-based alternatives, such as Laplace/variational inference (VI) combined with low rank approximations. Though feasible for large training data sets, such schemes sacrifice …

    vt Repository record for Modernizing Latent Gaussian Process Inference for Non-Gaussian Responses (opens in a new tab)

  17. Mean-Square Error Bounds and Perfect Sampling for Conditional Coding

    … in practice. Next some algorithms for perfect sampling in conditional coding are studied. An application of exact sampling to the independence sampler is shown to be equivalent to standard rejection sampling. In case of single-site updating, traditional perfect sampling is not directly …

    utahstate Repository record for Mean-Square Error Bounds and Perfect Sampling for Conditional Coding (opens in a new tab)

  18. Bayesian Analysis of Threshold Autoregressive Models

    … Monte Carlo (MCMC) simulation and an importance/rejection sampling are used to obtain posterior samples. In model determination, this study shows that Bayes factors are reliable testing procedures in model comparison, lag order selection, and threshold nonlinearity tests. However, it is difficult …

    utk-theses Repository record for Bayesian Analysis of Threshold Autoregressive Models (opens in a new tab)

  19. Bayesian causal inference for discrete data

    … using the central limit theorem and random sampling allows our method to be scaled to high-dimensional confounders. The second method uses prior restrictions of the parameter space of a saturated model to partially identify causal effect estimates in scenarios with nonignorable missing …

    ubc Repository record for Bayesian causal inference for discrete data (opens in a new tab) Download PDF for Bayesian causal inference for discrete data (opens in a new tab)

  20. Advances in Monte Carlo methods: exponentially tilted sequential proposal distributions and regenerative Markov chain samplers

    … smoothing spline, and the Lasso) by applying rejection sampling using exponentially tilted sequential proposal distributions. This technique is typically efficient for posteriors which have the form of truncated multivariate normal/student. In this manner, we are able to simulate exactly from …

    unsw Repository record for Advances in Monte Carlo methods: exponentially tilted sequential proposal distributions and regenerative Markov chain samplers (opens in a new tab)

Page 1 of 2