{"title":"多参数伯努利工厂","authors":"Renato Paes Leme, Jon Schneider","doi":"10.1214/22-aap1913","DOIUrl":null,"url":null,"abstract":"We consider the problem of computing with many coins of unknown bias. We are given access to samples of n coins with unknown biases p1,…,pn and are asked to sample from a coin with bias f(p1,…,pn) for a given function f:[0,1]n→[0,1]. We give a complete characterization of the functions f for which this is possible. As a consequence, we show how to extend various combinatorial sampling procedures (most notably, the classic Sampford sampling for k-subsets) to the boundary of the hypercube.","PeriodicalId":50979,"journal":{"name":"Annals of Applied Probability","volume":"50 1","pages":"0"},"PeriodicalIF":1.4000,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Multiparameter Bernoulli factories\",\"authors\":\"Renato Paes Leme, Jon Schneider\",\"doi\":\"10.1214/22-aap1913\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the problem of computing with many coins of unknown bias. We are given access to samples of n coins with unknown biases p1,…,pn and are asked to sample from a coin with bias f(p1,…,pn) for a given function f:[0,1]n→[0,1]. We give a complete characterization of the functions f for which this is possible. As a consequence, we show how to extend various combinatorial sampling procedures (most notably, the classic Sampford sampling for k-subsets) to the boundary of the hypercube.\",\"PeriodicalId\":50979,\"journal\":{\"name\":\"Annals of Applied Probability\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2023-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annals of Applied Probability\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1214/22-aap1913\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"STATISTICS & PROBABILITY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Applied Probability","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1214/22-aap1913","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"STATISTICS & PROBABILITY","Score":null,"Total":0}
We consider the problem of computing with many coins of unknown bias. We are given access to samples of n coins with unknown biases p1,…,pn and are asked to sample from a coin with bias f(p1,…,pn) for a given function f:[0,1]n→[0,1]. We give a complete characterization of the functions f for which this is possible. As a consequence, we show how to extend various combinatorial sampling procedures (most notably, the classic Sampford sampling for k-subsets) to the boundary of the hypercube.
期刊介绍:
The Annals of Applied Probability aims to publish research of the highest quality reflecting the varied facets of contemporary Applied Probability. Primary emphasis is placed on importance and originality.