TPA: A New Method for Approximate Counting
<p>Many high dimensional integrals can be reduced to the problem of finding the relative measure of two sets. Often one set will be exponentially larger than the other. A standard method of dealing with this problem is to interpolate between the sets with a series of nested sets where neighb...
Main Author: | |
---|---|
Other Authors: | |
Published: |
2012
|
Subjects: | |
Online Access: | http://hdl.handle.net/10161/5429 |
id |
ndltd-DUKE-oai-dukespace.lib.duke.edu-10161-5429 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-DUKE-oai-dukespace.lib.duke.edu-10161-54292013-01-07T20:07:56ZTPA: A New Method for Approximate CountingSchott, SarahMathematics<p>Many high dimensional integrals can be reduced to the problem of finding the relative measure of two sets. Often one set will be exponentially larger than the other. A standard method of dealing with this problem is to interpolate between the sets with a series of nested sets where neighboring nested sets have relative measures bounded above by a constant. Choosing these sets can be very difficult in practice. Here a new approach that creates a randomly drawn sequence of such sets is presented. This procedure gives faster approximation algorithms and a well-balanced set of nested sets that are essential to building effective tempering and annealing algorithms.</p>DissertationHuber, Mark2012Dissertationhttp://hdl.handle.net/10161/5429 |
collection |
NDLTD |
sources |
NDLTD |
topic |
Mathematics |
spellingShingle |
Mathematics Schott, Sarah TPA: A New Method for Approximate Counting |
description |
<p>Many high dimensional integrals can be reduced to the problem of finding the relative measure of two sets. Often one set will be exponentially larger than the other. A standard method of dealing with this problem is to interpolate between the sets with a series of nested sets where neighboring nested sets have relative measures bounded above by a constant. Choosing these sets can be very difficult in practice. Here a new approach that creates a randomly drawn sequence of such sets is presented. This procedure gives faster approximation algorithms and a well-balanced set of nested sets that are essential to building effective tempering and annealing algorithms.</p> === Dissertation |
author2 |
Huber, Mark |
author_facet |
Huber, Mark Schott, Sarah |
author |
Schott, Sarah |
author_sort |
Schott, Sarah |
title |
TPA: A New Method for Approximate Counting |
title_short |
TPA: A New Method for Approximate Counting |
title_full |
TPA: A New Method for Approximate Counting |
title_fullStr |
TPA: A New Method for Approximate Counting |
title_full_unstemmed |
TPA: A New Method for Approximate Counting |
title_sort |
tpa: a new method for approximate counting |
publishDate |
2012 |
url |
http://hdl.handle.net/10161/5429 |
work_keys_str_mv |
AT schottsarah tpaanewmethodforapproximatecounting |
_version_ |
1716473595501215744 |