<?xml version="1.0" encoding="UTF-8"?>
<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-10T09:44:54Z</responseDate>
  <request identifier="27788" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:27788</identifier>
        <datestamp>2026-09-09T12:19:39Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Parallel Sampling from the Ising p-Spin Model</dc:title>
          <dc:creator>Anari, Nima</dc:creator>
          <dc:creator>Das, Aniket</dc:creator>
          <dc:creator>Haqi, Alireza</dc:creator>
          <dc:subject>spin glasses</dc:subject>
          <dc:subject>parallel sampling</dc:subject>
          <dc:subject>Glauber dynamics</dc:subject>
          <dc:subject>stochastic localization</dc:subject>
          <dc:description>We study the parallel complexity of sampling from the high-temperature Ising mixed p-spin Gibbs measure, a canonical instance of a mean-field spin glass on the hypercube {±1}ⁿ. We propose two different algorithms for this problem, corresponding to two different regimes of accuracy. &#13;
Our first algorithm is a parallel implementation of a Markov chain known as block dynamics, combined with an approximate rejection sampling step that uses an Ising model in a novel way as a proposal distribution to approximate the quadratic interaction terms of the p-spin Hamiltonian. For any ε &gt; 0, this algorithm runs in n^{1/3} polylog(n/ε) parallel time with poly(n/ε) work, and outputs a sample whose law is ε-close to the p-spin measure in total variation distance.&#13;
Our second algorithm uses Picard iterations to parallelize the Algorithmic Stochastic Localization (ASL) process of El Alaoui, Montanari, and Sellke (2025), and for any ε &gt; ε_n, takes polylog(n/ε) parallel time and poly(n/ε) work to produce a sample that is ε-close to the p-spin measure in the normalized 2-Wasserstein metric. Here, ε_n &gt; 0 is a threshold that goes to 0 as n → ∞. Our result constitutes a doubly exponential improvement in the ε dependence of the runtime and an exponential improvement in the ε dependence of the total work when compared to naïve ASL, whose runtime scales as exp(poly(1/ε)).</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Nima Anari and Aniket Das and Alireza Haqi</dc:contributor>
          <dc:date>2026</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 392, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2026)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.APPROX/RANDOM.2026.71</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-277889</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2026.71</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
