atlas

Research map / Probabilistic and scientific modeling / Variational and generative sampling

Independence Testing for Bounded Degree Bayesian Networks

NeurIPS 2022 · Probabilistic and scientific modeling › Variational and generative sampling · approach: Likelihood-free and graphical model estimation · 0 citations (OpenAlex)

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 changedWhereMeasuredEffect
Use Hellinger-distance independence testing on subsets of d+1 variables, with localization over the bounded-degree networkDegree-d Bayesian networks · Independence testingsample complexity: 2^{\Omega(n)} -> O(d^2 2^{d / 2} n \log(n) / \varepsilon^2)Helped
Use Hellinger-distance rather than total-variation-distance independence testingIndependence testing for arbitrary distributions over {0,1}^n · {0,1}^nsample complexity: O(2^{n / 2}/ \varepsilon^4) -> O(2^{n / 2}/ \varepsilon^2)Helped
Allow the Bayesian-network structure to be unknownDegree-d Bayesian-network independence testing · Independence testingsample complexity lower bound: \Omega (2^{d / 2} \sqrt{n} / \varepsilon^2) -> \Omega (2^{d / 2} n / \varepsilon^2)Hurt

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy