Pith.

Statistics Theory · arXiv:1011.6640 v1 · submitted 30 Nov 2010

Extended Bayesian Information Criteria for Gaussian Graphical Models

Rina Foygel, Mathias Drton

The paper says

“In this paper we establish the consistency of an extended Bayesian information criterion for Gaussian graphical models in a scenario where both the number of variables p and the sample size n grow.”

from the abstract · picked out as the main claim by a classifier

Pith says

Pith has not reviewed this paper.

Get a Pith Review, $5

Reviews

Reviews by people

No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.

Request a human review

How Pith checks papers · The full audit of this paper

The paper

Abstract

Gaussian graphical models with sparsity in the inverse covariance matrix are of significant interest in many modern applications. For the problem of recovering the graphical structure, information criteria provide useful optimization objectives for algorithms searching through sets of graphs or for selection of tuning parameters of other methods such as the graphical lasso, which is a likelihood penalization technique. In this paper we establish the consistency of an extended Bayesian information criterion for Gaussian graphical models in a scenario where both the number of variables p and the sample size n grow. Compared to earlier work on the regression case, our treatment allows for growth in the number of non-zero parameters in the true model, which is necessary in order to cover connected graphs. We demonstrate the performance of this criterion on simulated data when used in conjunction with the graphical lasso, and verify that the criterion indeed performs better than either cross-validation or the ordinary Bayesian information criterion when p and the number of non-zero parameters q both scale with n.

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.

abstract compiled · 2026-09-23 · no language-model review

How the main claim is stated: asserted 1.00

What the abstract itself states, as probabilities: claims first 0.06 · states limitation 0.14 · human participants 0.02 · controlled comparison 0.53 · randomized assignment 0.01 · states quantitative result 0.10 · compares with prior results 0.97 · mentions code or data availability 0.02

The abstract, sentence by sentence

This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.

SentenceRoleThe authors' own workStates the main conclusionStrength
Gaussian graphical models with sparsity in the inverse covariance matrix are of significant interest in many modern applications. background 1.00 0.04 0.02 asserted 1.00
For the problem of recovering the graphical structure, information criteria provide useful optimization objectives for algorithms searching through sets of graphs or for selection of tuning parameters of other methods such as the graphical lasso, which is a likelihood penalization technique. background 1.00 0.06 0.03 asserted 0.83
In this paper we establish the consistency of an extended Bayesian information criterion for Gaussian graphical models in a scenario where both the number of variables p and the sample size n grow. contribution 0.74 0.95 0.83 asserted 1.00
Compared to earlier work on the regression case, our treatment allows for growth in the number of non-zero parameters in the true model, which is necessary in order to cover connected graphs. contribution 0.87 0.84 0.12 asserted 1.00
We demonstrate the performance of this criterion on simulated data when used in conjunction with the graphical lasso, and verify that the criterion indeed performs better than either cross-validation or the ordinary Bayesian information criterion when p and the number of non-zero parameters q both scale with n. result 0.96 0.96 0.31 asserted 1.00

What kind of paper the classifier reports this is: theoretical result 0.99 · evidence from proof or derivation 0.73

What was examined, and what was not

Sources read

  • arXiv listing abstract v1

Not examined

  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers

Levels run

  • P abstract

Not run

  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

How the labels were made

Compiled by classifier-1.13-20260917 via OpenRouter, question bank abstract-p1-20260923, 2026-09-23: 1 request, 4,372 input tokens, $0.0002 reported.

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON

Cited by 3 Pith papers
How the literature uses it

7 arXiv papers cite this in 8 sentences

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Papers citing it · 3 sentences without a confident label

Uses its method or tool 3 papers
  • The optimal $λ$ is selected so as to minimize the extended Bayesian Information Criterion (eBIC) [ref] defined as [equation] where $ℒ$ is the negative log-likelihood of the model, $|E |$ is the number of non-zero predicted $β$ entries, $n$ is the sample size, $d$ is the number of nodes and $γ$ is an additional penalty term imposed on more complex structures.

    Markov Network Structure Learning via Ensemble-of-Forests Models · The EF-$λ$ heuristic · 0.97

  • As shown in (2), the EBIC adds an extra penalty, the hyperparameter Y (gamma) to control the model complexity [ref] and it is set manually from 0 to 0.5, L indicates the log-likelihood, n the sample size, E the number of non-zero edges and p the number of nodes.

    GLIME: A new graphical methodology for interpretable model-agnostic explanations · Methods · 0.96

  • In practice we do not have access to $$ so to demonstrate that the proposed method is practically useful we also show results for which $$ has been selected using the computationally efficient Extended Bayesian Information Criterion (EBIC) [ref] .

    L0 Sparse Inverse Covariance Estimation · The Simulation Procedure · 0.91

Cites it as background 2 papers

Challenges and discussion

Know something about this paper? Leave a comment.

No comments yet.

Sign in to comment