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 6 of 6 for “"Perfect Sampling"”.
-
Mean-Square Error Bounds and Perfect Sampling for Conditional Coding
… are useful 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 …
-
Behavioral simulation of digital to analog converters simulation of segmented current steering DAC with utilization of perfect sampling technique
… speed is proposed. The method is called a Perfect Sampling Technique (PST) and it allows for precise calculation of most important in telecommunication dynamic DAC performance metric---the Spurious Free Dynamic Range (SFDR). The technique was primarily built to overcome the deficiencies of …
-
Approximately Counting Perfect and General Matchings in Bipartite and General Graphs
<p>We develop algorithms to approximately count perfect matchings in bipartite graphs (or permanents of the corresponding adjacency matrices), perfect matchings in nonbipartite graphs (or hafnians), and general matchings in bipartite and nonbipartite graphs (or matching generating polynomials). …
-
Exploring many-body Physics with Recurrent Neural Networks
… allow for exact likelihood estimation and for a perfect sampling of multi-modal complex probability distributions. These desirable features suggest that RNNs may serve as ansatzes wave functions in the context of Variational Monte Carlo (VMC), where ansatzes based on a Markov chain Monte Carlo …
-
Statistical Inference for Models with Intractable Normalizing Constants
… methods is that they avoid the requirement for perfect samples, and thus it can be applied to many models for which perfect sampling is not available or very expensive. In addition, although the normalizing constant approximation is also involved in BSAMC, BSAMC can perform very robustly to …
-
Advances in Monte Carlo methods: exponentially tilted sequential proposal distributions and regenerative Markov chain samplers
… 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 the …