Research map / Probabilistic and scientific modeling / Bayesian optimization
Learning Bayesian Networks with Low Rank Conditional Probability Tables
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Recover structure using random conditional-probability queries and compressed sensing under rank-2 CPTs | Faithful binary Bayesian networks · Binary Bayesian networks | structure recovery | Helped |
| Add observational data to identify Markov blankets before querying | Proposed structure-learning method · Binary Bayesian networks | black-box sample complexity: \mathcal{O}(\max ( \frac{n k^3 \log^4 n}{\epsilon^2} (\log k + \log \log n), \frac{n k^3}{\epsilon^2} \log \frac{1}{\del | Helped |
Closest papers by meaning
- Extendable and Iterative Structure Learning Strategy for Bayesian Networks (ICLR 2025 · similarity 0.89)
- Learning Bayesian Networks in the Presence of Structural Side Information (AAAI 2022 · similarity 0.88)
- Conditional PSDDs: Modeling and Learning With Modular Knowledge (AAAI 2018 · similarity 0.87)
- Learning Fast-Inference Bayesian Networks (NeurIPS 2021 · similarity 0.87)
- DiBS: Differentiable Bayesian Structure Learning (NeurIPS 2021 · similarity 0.87)
- Learning Bayesian Networks with Incomplete Data by Augmentation (AAAI 2017 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.