新的采样下限通过分隔符

Cybersecurity and Cyberforensics Conference Pub Date : 1900-01-01 DOI:10.4230/LIPIcs.CCC.2023.26

Emanuele Viola

{"title":"新的采样下限通过分隔符","authors":"Emanuele Viola","doi":"10.4230/LIPIcs.CCC.2023.26","DOIUrl":null,"url":null,"abstract":"Suppose that a target distribution can be approximately sampled by a low-depth decision tree, or more generally by an efficient cell-probe algorithm. It is shown to be possible to restrict the input to the sampler so that its output distribution is still not too far from the target distribution","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"New Sampling Lower Bounds via the Separator\",\"authors\":\"Emanuele Viola\",\"doi\":\"10.4230/LIPIcs.CCC.2023.26\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Suppose that a target distribution can be approximately sampled by a low-depth decision tree, or more generally by an efficient cell-probe algorithm. It is shown to be possible to restrict the input to the sampler so that its output distribution is still not too far from the target distribution\",\"PeriodicalId\":246506,\"journal\":{\"name\":\"Cybersecurity and Cyberforensics Conference\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Cybersecurity and Cyberforensics Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4230/LIPIcs.CCC.2023.26\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cybersecurity and Cyberforensics Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/LIPIcs.CCC.2023.26","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

假设目标分布可以通过低深度决策树或更一般地通过有效的细胞探针算法进行近似采样。可以限制采样器的输入，使其输出分布仍然不会离目标分布太远

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

New Sampling Lower Bounds via the Separator

Suppose that a target distribution can be approximately sampled by a low-depth decision tree, or more generally by an efficient cell-probe algorithm. It is shown to be possible to restrict the input to the sampler so that its output distribution is still not too far from the target distribution

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Cybersecurity and Cyberforensics Conference

自引率

0.00%

发文量