Network reconstruction via the minimum description length principle

{
  "by": "Anon84",
  "descendants": 0,
  "id": 40247568,
  "score": 2,
  "time": 1714743691,
  "title": "Network reconstruction via the minimum description length principle",
  "type": "story",
  "url": "https://arxiv.org/abs/2405.01015"
}

{
  "author": "Tiago P. Peixoto",
  "date": "2024-05-02T12:00:00.000Z",
  "description": "A fundamental problem associated with the task of network reconstruction from dynamical or behavioral data consists in determining the most appropriate model complexity in a manner that prevents overfitting, and produces an inferred network with a statistically justifiable number of edges. The status quo in this context is based on $L_{1}$ regularization combined with cross-validation. However, besides its high computational cost, this commonplace approach unnecessarily ties the promotion of sparsity with weight “shrinkage”. This combination forces a trade-off between the bias introduced by shrinkage and the network sparsity, which often results in substantial overfitting even after cross-validation. In this work, we propose an alternative nonparametric regularization scheme based on hierarchical Bayesian inference and weight quantization, which does not rely on weight shrinkage to promote sparsity. Our approach follows the minimum description length (MDL) principle, and uncovers the weight distribution that allows for the most compression of the data, thus avoiding overfitting without requiring cross-validation. The latter property renders our approach substantially faster to employ, as it requires a single fit to the complete data. As a result, we have a principled and efficient inference scheme that can be used with a large variety of generative models, without requiring the number of edges to be known in advance. We also demonstrate that our scheme yields systematically increased accuracy in the reconstruction of both artificial and empirical networks. We highlight the use of our method with the reconstruction of interaction networks between microbial communities from large-scale abundance samples involving in the order of $10^{4}$ to $10^{5}$ species, and demonstrate how the inferred model can be used to predict the outcome of interventions in the system.",
  "image": "https://arxiv.org/static/browse/0.3.4/images/arxiv-logo-fb.png",
  "logo": "https://logo.clearbit.com/arxiv.org",
  "publisher": "arXiv.org",
  "title": "Network reconstruction via the minimum description length principle",
  "url": "https://arxiv.org/abs/2405.01015v2"
}

{
  "url": "https://arxiv.org/abs/2405.01015",
  "title": "Network reconstruction via the minimum description length principle",
  "description": "A fundamental problem associated with the task of network reconstruction from dynamical or behavioral data consists in determining the most appropriate model complexity in a manner that prevents...",
  "links": [
    "https://arxiv.org/abs/2405.01015v2",
    "https://arxiv.org/abs/2405.01015"
  ],
  "image": "https://static.arxiv.org/icons/twitter/arxiv-logo-twitter-square.png",
  "content": "<div>\n                <p>View a PDF of the paper titled Network reconstruction via the minimum description length principle, by Tiago P. Peixoto</p>\n    <p><a target=\"_blank\" href=\"https://arxiv.org/pdf/2405.01015\">View PDF</a></p><blockquote>\n            <span>Abstract:</span>A fundamental problem associated with the task of network reconstruction from dynamical or behavioral data consists in determining the most appropriate model complexity in a manner that prevents overfitting, and produces an inferred network with a statistically justifiable number of edges. The status quo in this context is based on $L_{1}$ regularization combined with cross-validation. However, besides its high computational cost, this commonplace approach unnecessarily ties the promotion of sparsity with weight \"shrinkage\". This combination forces a trade-off between the bias introduced by shrinkage and the network sparsity, which often results in substantial overfitting even after cross-validation. In this work, we propose an alternative nonparametric regularization scheme based on hierarchical Bayesian inference and weight quantization, which does not rely on weight shrinkage to promote sparsity. Our approach follows the minimum description length (MDL) principle, and uncovers the weight distribution that allows for the most compression of the data, thus avoiding overfitting without requiring cross-validation. The latter property renders our approach substantially faster to employ, as it requires a single fit to the complete data. As a result, we have a principled and efficient inference scheme that can be used with a large variety of generative models, without requiring the number of edges to be known in advance. We also demonstrate that our scheme yields systematically increased accuracy in the reconstruction of both artificial and empirical networks. We highlight the use of our method with the reconstruction of interaction networks between microbial communities from large-scale abundance samples involving in the order of $10^{4}$ to $10^{5}$ species, and demonstrate how the inferred model can be used to predict the outcome of interventions in the system.\n    </blockquote>\n  </div><div>\n      <h2>Submission history</h2><p> From: Tiago Peixoto [<a target=\"_blank\" href=\"https://arxiv.org/show-email/f68a784b/2405.01015\">view email</a>]      <br />            <strong><a target=\"_blank\" href=\"https://arxiv.org/abs/2405.01015v1\">[v1]</a></strong>\n        Thu, 2 May 2024 05:35:09 UTC (19,343 KB)<br />\n    <strong>[v2]</strong>\n        Tue, 7 May 2024 16:54:52 UTC (19,344 KB)<br />\n</p></div>",
  "author": "",
  "favicon": "https://arxiv.org/static/browse/0.3.4/images/icons/favicon-16x16.png",
  "source": "arxiv.org",
  "published": "",
  "ttr": 64,
  "type": "website"
}