{"title":"用随机投影近似混合分布之间的l1距离","authors":"Satyaki Mahalanabis, Daniel Stefankovic","doi":"10.1137/1.9781611972993.11","DOIUrl":null,"url":null,"abstract":"We consider the problem of computing L1-distances between every pair of probability densities from a given family, a problem motivated by density estimation [15]. We point out that the technique of Cauchy random projections [10] in this context turns into stochastic integrals with respect to Cauchy motion. \n \nFor piecewise-linear densities these integrals can be sampled from if one can sample from the stochastic integral of the function x → (1, x). We give an explicit density function for this stochastic integral and present an efficient (exact) sampling algorithm. As a consequence we obtain an efficient algorithm to approximate the L1-distances with a small relative error. \n \nFor piecewise-polynomial densities we show how to approximately sample from the distributions resulting from the stochastic integrals. This also results in an efficient algorithm to approximate the L1-distances, although our inability to get exact samples worsens the dependence on the parameters.","PeriodicalId":340112,"journal":{"name":"Workshop on Analytic Algorithmics and Combinatorics","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Approximating L1-distances Between Mixture Distributions Using Random Projections\",\"authors\":\"Satyaki Mahalanabis, Daniel Stefankovic\",\"doi\":\"10.1137/1.9781611972993.11\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the problem of computing L1-distances between every pair of probability densities from a given family, a problem motivated by density estimation [15]. We point out that the technique of Cauchy random projections [10] in this context turns into stochastic integrals with respect to Cauchy motion. \\n \\nFor piecewise-linear densities these integrals can be sampled from if one can sample from the stochastic integral of the function x → (1, x). We give an explicit density function for this stochastic integral and present an efficient (exact) sampling algorithm. As a consequence we obtain an efficient algorithm to approximate the L1-distances with a small relative error. \\n \\nFor piecewise-polynomial densities we show how to approximately sample from the distributions resulting from the stochastic integrals. This also results in an efficient algorithm to approximate the L1-distances, although our inability to get exact samples worsens the dependence on the parameters.\",\"PeriodicalId\":340112,\"journal\":{\"name\":\"Workshop on Analytic Algorithmics and Combinatorics\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-04-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Workshop on Analytic Algorithmics and Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/1.9781611972993.11\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Analytic Algorithmics and Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/1.9781611972993.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Approximating L1-distances Between Mixture Distributions Using Random Projections
We consider the problem of computing L1-distances between every pair of probability densities from a given family, a problem motivated by density estimation [15]. We point out that the technique of Cauchy random projections [10] in this context turns into stochastic integrals with respect to Cauchy motion.
For piecewise-linear densities these integrals can be sampled from if one can sample from the stochastic integral of the function x → (1, x). We give an explicit density function for this stochastic integral and present an efficient (exact) sampling algorithm. As a consequence we obtain an efficient algorithm to approximate the L1-distances with a small relative error.
For piecewise-polynomial densities we show how to approximately sample from the distributions resulting from the stochastic integrals. This also results in an efficient algorithm to approximate the L1-distances, although our inability to get exact samples worsens the dependence on the parameters.