{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreicwtqw35ewhlm3xefhif4n3hlyye3ylnzexaq6zo2m7h7nhib6xje",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3mm5d2p3o6eg2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreifqaymphlhaou7ymuxlsdcq46k6c4k27dbs2lrqq2rxp5ioaxmdoy"
    },
    "mimeType": "image/jpeg",
    "size": 8554
  },
  "path": "/2026/05/18/more-cool-results-about-the-complexity-of-distributions/",
  "publishedAt": "2026-05-18T14:06:01.000Z",
  "site": "https://emanueleviola.wordpress.com",
  "tags": [
    "Byramji, Kane, Morris, and Ostuni proved an almost tight separation",
    "this",
    "sampling lower bound for low-degree polynomials",
    "Khodabandeh",
    "Shinkar"
  ],
  "textContent": "In no particular order,\n\nByramji, Kane, Morris, and Ostuni proved an almost tight separation for adaptive vs non-adaptive sampling in the word model. Previous papers I blogged about earlier, see this and this prove weaker separations.\n\nAnother very cool work is the sampling lower bound for low-degree polynomials by Khodabandeh and Shinkar. They appear to be able to boost a non-trivial sampling lower bound to an exponential one using some type of sunflower result for polynomials.\n\nBy Manu",
  "title": "More cool results about the complexity of distributions"
}