Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2601.22106 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914292064845824 |
|---|---|
| author | Bond, Harry T. Gauthier, Bertrand Strokorb, Kirstin |
| author_facet | Bond, Harry T. Gauthier, Bertrand Strokorb, Kirstin |
| contents | We investigate the properties of a class of regularisation-free approaches for Gaussian graphical inference based on the information-geometry-driven sequential growth of initially edgeless graphs. Relating the growth of a graph to a coordinate descent process, we characterise the fully-corrective descents corresponding to information-optimal growths, and propose numerically efficient strategies for their approximation. We demonstrate the ability of the proposed procedures to reliably extract sparse graphical models while limiting the number of false detections, and illustrate how activation ranks can provide insight into the informational relevance of edge sets. The considered approaches are tuning-parameter-free and have complexities akin to coordinate descents. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_22106 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Information-geometry-driven graph sequential growth Bond, Harry T. Gauthier, Bertrand Strokorb, Kirstin Methodology 62H22, 62B11, 90C25 We investigate the properties of a class of regularisation-free approaches for Gaussian graphical inference based on the information-geometry-driven sequential growth of initially edgeless graphs. Relating the growth of a graph to a coordinate descent process, we characterise the fully-corrective descents corresponding to information-optimal growths, and propose numerically efficient strategies for their approximation. We demonstrate the ability of the proposed procedures to reliably extract sparse graphical models while limiting the number of false detections, and illustrate how activation ranks can provide insight into the informational relevance of edge sets. The considered approaches are tuning-parameter-free and have complexities akin to coordinate descents. |
| title | Information-geometry-driven graph sequential growth |
| topic | Methodology 62H22, 62B11, 90C25 |
| url | https://arxiv.org/abs/2601.22106 |