<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-19T08:07:06Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/144987" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/144987</identifier><datestamp>2022-08-30T03:34:31Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131023</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Solomon, Justin</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Chiu, Erica</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2022-08-29T16:25:31Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2022-08-29T16:25:31Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2022-05</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2022-05-27T16:19:24.539Z</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1721.1/144987</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">In this thesis, we present an MCMC-based method to extract near-uniform samples from a level set of a provided function 𝑓 : Rᵈ → Rᵏ . We propose a sequence of unnormalized distributions over Rᵈ with asymptotic convergence to the Hausdorff measure of the level set, therefore resulting in uniform samples. Beyond our formulation’s asymptotic convergence, we demonstrate its practicality by using MCMC to sample a distribution in the sequence for some analytical functions. Finally, we test our sampling method on representative applications related to machine learning, including extracting geometry from neural implicit representations and multi-objective optimization.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree">M.Eng.</dim:field>
   <dim:field mdschema="dc" element="publisher">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights">In Copyright - Educational Use Permitted</dim:field>
   <dim:field mdschema="dc" element="rights">Copyright MIT</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri">http://rightsstatements.org/page/InC-EDU/1.0/</dim:field>
   <dim:field mdschema="dc" element="title">Uniform Sampling over Level Sets</dim:field>
   <dim:field mdschema="dc" element="type">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="mit" element="thesis" qualifier="degree">Master</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Master of Engineering in Electrical Engineering and Computer Science</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="81aff323-1fc0-48be-b81e-7f2f8d9f4e6f">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
   	&lt;Title>Uniform Sampling over Level Sets&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2022-05&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Chiu, Erica&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;DisplayName>Massachusetts Institute of Technology&lt;/DisplayName>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>http://rightsstatements.org/page/InC-EDU/1.0/&lt;/License>
   	&lt;Abstract>In this thesis, we present an MCMC-based method to extract near-uniform samples from a level set of a provided function 𝑓 : Rᵈ → Rᵏ . We propose a sequence of unnormalized distributions over Rᵈ with asymptotic convergence to the Hausdorff measure of the level set, therefore resulting in uniform samples. Beyond our formulation’s asymptotic convergence, we demonstrate its practicality by using MCMC to sample a distribution in the sequence for some analytical functions. Finally, we test our sampling method on representative applications related to machine learning, including extracting geometry from neural implicit representations and multi-objective optimization.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>