Combinatorial inference for graphical models (Q1731056)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combinatorial inference for graphical models |
scientific article |
Statements
Combinatorial inference for graphical models (English)
0 references
6 March 2019
0 references
The paper tackles the combinatorial inference problems of a Gaussian graphical model. It does so by introducing novel concepts of structural packing and buffer entropies to characterize the impact of the complexity of the combinatorial graph structure on the related minimax bounds and puts forward a family of original structural testing algorithms for the lower bounds. The study brings new theoretical perspectives to the field of graphical model research.
0 references
graphical models
0 references
combinatorial inference problems
0 references
minimax testing
0 references
0 references
0 references
0 references
0 references
0 references
