Near-optimal learning of tree-structured distributions by Chow-Liu-Reference-Cited by-同舟云学术

Near-optimal learning of tree-structured distributions by Chow-Liu

Published:2021-06-15 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Bhattacharyya Arnab¹,Gayen Sutanu¹^ORCID,Price Eric²,Vinodchandran N. V.³

Affiliation:

1. National University of Singapore, Singapore

2. University of Texas at Austin, USA

3. University of Nebraska-Lincoln, USA

Funder

NSF (National Science Foundation)

Amazon

National Research Foundation Singapore

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3406325.3451066

Reference58 articles.

1. Learning factor graphs in polynomial time and sample complexity;Abbeel Pieter;Journal of Machine Learning Research,2006

2. Jayadev Acharya Constantinos Daskalakis and Gautam Kamath. 2015. Optimal Testing for Properties of Distributions. In Advances in Neural Information Processing Systems. Jayadev Acharya Constantinos Daskalakis and Gautam Kamath. 2015. Optimal Testing for Properties of Distributions. In Advances in Neural Information Processing Systems.

3. Anima Anandkumar Daniel J Hsu Furong Huang and Sham M Kakade. 2012. Learning mixtures of tree graphical models. In Advances in Neural Information Processing Systems. Pages 1052–1060. Anima Anandkumar Daniel J Hsu Furong Huang and Sham M Kakade. 2012. Learning mixtures of tree graphical models. In Advances in Neural Information Processing Systems. Pages 1052–1060.

4. Convergence properties of functional estimates for discrete distributions

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Quantum chi-squared tomography and mutual information testing;Quantum;2024-06-20

2. Near-Optimal Degree Testing for Bayes Nets;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25

3. Concentration Bounds for Discrete Distribution Estimation in KL Divergence;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25

4. Near-Optimal Learning of Tree-Structured Distributions by Chow and Liu;SIAM Journal on Computing;2023-06-15

5. Learning Polynomial Transformations via Generalized Tensor Decompositions;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02