Fast Reconstruction of Mixtures of Bernoulli Product Distributions
Sanyam Agarwal, Pranjal Dutta, Markus Bläser
Abstract
Mixtures of Bernoulli product distributions are a simple and widely used latent-variable model, with applications in e.g. recommendation systems, crowdsourcing, and medical data analysis. We consider the problem of reconstructing the mixture parameters from oracle access to its probability generating polynomial (PGP), for instance represented by a probabilistic generating circuit (PGC). We show that the parameters are uniquely identifiable for almost all mixtures, and give a randomized algorithm that exactly recovers the mixture weights and component marginals for mixtures of Bernoulli product distributions over variables using only oracle queries. The algorithm repeatedly applies restrictions to variables, extracts low-degree coefficients, and then recovers the parameters using a moment-based tensor decomposition. To the best of our knowledge, this is the first exact reconstruction algorithm in this PGP oracle model with query complexity linear in and polynomial in .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 7f778914-4b1c-4f5e-9a55-fe99cbae00e5Builds on12
- A Compositional Atlas of Tractable Circuit Operations for Probabilistic InferenceAntonio Vergari, YooJung Choi, Anji Liu, Stefano Teso et al.NeurIPS 2021 · 112 citations
- Adaptable Logical Control for Large Language ModelsHonghua Zhang, Po-Nien Kung, Masahiro Yoshida, Guy Van den Broeck et al.NeurIPS 2024 · 42 citations
- SPPL: probabilistic programming with fast exact symbolic inferenceFeras A. Saad, Martin C. Rinard, Vikash K. MansinghkaPLDI 2021 · 38 citations
- Image Inpainting via Tractable Steering of Diffusion ModelsAnji Liu, Mathias Niepert, Guy Van den BroeckICLR 2024 · 33 citations
- Scaling Tractable Probabilistic Circuits: A Systems PerspectiveAnji Liu, Kareem Ahmed, Guy Van den BroeckICML 2024 · 26 citations
Related papers
- Learning sums of powers of low-degree polynomials in the non-degenerate caseAnkit Garg, Neeraj Kayal, Chandan SahaFOCS 2020 · 9 citations
- Polynomial-Time Power-Sum Decomposition of PolynomialsMitali Bafna, Jun-Ting Hsieh, Pravesh K. Kothari, Jeff XuFOCS 2022 · 4 citations
- Implicit High-Order Moment Tensor Estimation and Learning Latent Variable ModelsIlias Diakonikolas, Daniel M. KaneFOCS 2025 · 1 citation
- Learning latent causal graphs via mixture oraclesBohdan Kivva, Goutham Rajendran, Pradeep Ravikumar, Bryon AragamNeurIPS 2021 · 66 citations
- Robustly learning mixtures of k arbitrary GaussiansAinesh Bakshi, Ilias Diakonikolas, He Jia, Daniel M. Kane et al.STOC 2022 · 21 citations
