On Learning Discrete Graphical Models using Group-Sparse Regularization

Abstract

We study the problem of learning the graph structure associated with a general discrete graphical models (each variable can take any of m > 1 values, the clique factors have maximum size c ≥ 2) from samples, under high-dimensional scaling where the number of variables p could be larger than the number of samples n. We provide a quantitative consistency… (More)

3 Figures and Tables

Topics

Statistics

0102020112012201320142015201620172018
Citations per Year

79 Citations

Semantic Scholar estimates that this publication has 79 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics