Learning Polytrees

01/23/2013
by   Sanjoy Dasgupta, et al.
0

We consider the task of learning the maximum-likelihood polytree from data. Our first result is a performance guarantee establishing that the optimal branching (or Chow-Liu tree), which can be computed very easily, constitutes a good approximation to the best polytree. We then show that it is not possible to do very much better, since the learning problem is NP-hard even to approximately solve within some constant factor.

READ FULL TEXT

page 1

page 2

page 3

page 6

page 7

page 8

research
06/09/2011

Finding a Path is Harder than Finding a Tree

I consider the problem of learning an optimal path graphical model from ...
research
01/10/2013

Maximum Likelihood Bounded Tree-Width Markov Networks

Chow and Liu (1968) studied the problem of learning a maximumlikelihood ...
research
12/03/2021

Strong Hardness of Approximation for Tree Transversals

Let H be a fixed graph. The H-Transversal problem, given a graph G, asks...
research
06/26/2017

Optimal choice: new machine learning problem and its solution

The task of learning to pick a single preferred example out a finite set...
research
11/04/2021

Inapproximability of Positive Semidefinite Permanents and Quantum State Tomography

Quantum State Tomography is the task of estimating a quantum state, give...
research
10/16/2012

A Maximum Likelihood Approach For Selecting Sets of Alternatives

We consider the problem of selecting a subset of alternatives given nois...
research
07/23/2018

Maximum-Likelihood Network Reconstruction for SIS Processes is NP-Hard

The knowledge of the network topology is imperative to precisely describ...

Please sign up or login with your details

Forgot password? Click here to reset