Exact Inference of Hidden Structure from Sample Data in Noisy-OR Networks

01/30/2013
by   Michael Kearns, et al.
0

In the literature on graphical models, there has been increased attention paid to the problems of learning hidden structure (see Heckerman [H96] for survey) and causal mechanisms from sample data [H96, P88, S93, P95, F98]. In most settings we should expect the former to be difficult, and the latter potentially impossible without experimental intervention. In this work, we examine some restricted settings in which perfectly reconstruct the hidden structure solely on the basis of observed sample data.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/30/2018

Uniform Inference in High-Dimensional Gaussian Graphical Models

Graphical models have become a very popular tool for representing depend...
research
09/20/2019

Non-Parametric Structure Learning on Hidden Tree-Shaped Distributions

We provide high probability sample complexity guarantees for non-paramet...
research
11/04/2021

Proximal Causal Inference with Hidden Mediators: Front-Door and Related Mediation Problems

Proximal causal inference was recently proposed as a framework to identi...
research
08/24/2020

Path Dependent Structural Equation Models

Causal analyses of longitudinal data generally assume structure that is ...
research
06/05/2023

Learning nonparametric latent causal graphs with unknown interventions

We establish conditions under which latent causal graphs are nonparametr...
research
01/30/2013

Learning the Structure of Dynamic Probabilistic Networks

Dynamic probabilistic networks are a compact representation of complex s...
research
02/14/2012

The Structure of Signals: Causal Interdependence Models for Games of Incomplete Information

Traditional economic models typically treat private information, or sign...

Please sign up or login with your details

Forgot password? Click here to reset