arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2012.14540cs.LGcs.DSeess.SPstat.ML
收藏

混合产品分布的源识别

Source Identification for Mixtures of Product Distributions

California Institute of Technology(加州理工学院);The Rachel and Selim Benin School of Computer Science and Engineering, The Hebrew University of Jerusalem(耶路撒冷希伯来大学拉结·塞利姆·贝宁计算机科学与工程学院)

Spencer L. Gordon, Bijan Mazaheri, Yuval Rabani, Leonard J. Schulman

摘要:

我们给出了一个算法的混合$k$产品分布的$n$位的源识别。这是机器学习中的一个基本问题,具有许多应用。我们的算法识别源参数的可识别的混合物,给定的,作为输入,多线性矩的近似值(来自,例如,从一个足够大的样本),使用$2^{O(k^2)} n^{O(k)}$算术运算。我们的结果是第一个明确的界限上的计算复杂性的源识别这样的混合物。运行时间改进了Feldman,O 'Donnell和Servedio(FOCS 2005)以及Chen和Moitra(STOC 2019)之前的结果,这些结果仅保证学习混合物(没有源的参数识别)。我们的分析给出了可识别来源的定性表征的定量版本,这是由于Tahmasebi,Motahari和Maddah-Ali(ISIT 2018)。

英文摘要:

We give an algorithm for source identification of a mixture of $k$ product distributions on $n$ bits. This is a fundamental problem in machine learning with many applications. Our algorithm identifies the source parameters of an identifiable mixture, given, as input, approximate values of multilinear moments (derived, for instance, from a sufficiently large sample), using $2^{O(k^2)} n^{O(k)}$ arithmetic operations. Our result is the first explicit bound on the computational complexity of source identification of such mixtures. The running time improves previous results by Feldman, O'Donnell, and Servedio (FOCS 2005) and Chen and Moitra (STOC 2019) that guaranteed only learning the mixture (without parametric identification of the source). Our analysis gives a quantitative version of a qualitative characterization of identifiable sources that is due to Tahmasebi, Motahari, and Maddah-Ali (ISIT 2018).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑