Faithfulness and learning hypergraphs from discrete distributions

DOI10.1016/J.CSDA.2015.01.017MaRDI QIDQ1663308zbMATH OpenOpenAlexFDO

Authors Anna Klimova, Caroline Uhler, Tamás Rudas

Publication date 21 August 2018

Published in Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1404.6617

zbMATH Keywords

contingency tableshypergraphsdirected acyclic graphshierarchical log-linear models(strong-)faithfulness

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Probabilistic graphical models (62H22)

Abstract: The concepts of faithfulness and strong-faithfulness are important for statistical learning of graphical models. Graphs are not sufficient for describing the association structure of a discrete distribution. Hypergraphs representing hierarchical log-linear models are considered instead, and the concept of parametric (strong-) faithfulness with respect to a hypergraph is introduced. Strong-faithfulness ensures the existence of uniformly consistent parameter estimators and enables building uniformly consistent procedures for a hypergraph search. The strength of association in a discrete distribution can be quantified with various measures, leading to different concepts of strong-faithfulness. Lower and upper bounds for the proportions of distributions that do not satisfy strong-faithfulness are computed for different parameterizations and measures of association.

Recommendations

• A note on faithfulness and total positivity
• Faithfulness of probability distributions and graphs
• Faithfulness in chain graphs: the discrete case
• Geometry of the faithfulness assumption in causal inference
• Learning unfaithful \(K\)-separable Gaussian graphical models

Cites work

• scientific article; zbMATH DE number 1817585 (Why is no real title available?)
• scientific article; zbMATH DE number 3509596 (Why is no real title available?)
• scientific article; zbMATH DE number 3519741 (Why is no real title available?)
• scientific article; zbMATH DE number 3602484 (Why is no real title available?)
• scientific article; zbMATH DE number 2150792 (Why is no real title available?)
• A note on adding and deleting edges in hierarchical log-linear models
• An algorithm for reading dependencies from the minimal undirected independence map of a graphoid that satisfies weak transitivity
• Analogies between Multiplicative Models in Contingency Tables and Covariance Selection
• Causation, prediction, and search. With additional material by David Heckerman, Christopher Meek, Gregory F. Cooper and Thomas Richardson.
• Estimating high-dimensional directed acyclic graphs with the PC-algorithm
• Geometry of the faithfulness assumption in causal inference
• Introduction to Graphical Modelling
• Marginal models for categorical data
• Measures of Association for Cross Classifications
• Parameterization and estimation of path models for categorical data
• Uniform consistency in causal inference

Cited in

(5)

• Faithfulness in chain graphs: the discrete case
• Geometry of the faithfulness assumption in causal inference
• Implications of faithfulness in graphical models
• A note on faithfulness and total positivity
• Faithfulness of probability distributions and graphs

Describes a project that uses

Uses Software

• pcalg
• ElemStatLearn
• TETRAD
• MIM

This page was built for publication: Faithfulness and learning hypergraphs from discrete distributions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1663308)