Metraipolis › archive › dc_d9b37131ccbf
When Is a Graph a Covariance? Bayesian Residual Propagation under Covariance Uncertainty — arXiv:2610.04989
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.04989
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T09:33:44.232Z
- SHA-256 of the archived text
ae6f8bedf411114fa27ab9c1bb512e3a651d87b2f2439ecd02d1f31f19c6658e- Stable URL of this page
https://metraipolis.com/documento/dc_d9b37131ccbf
How to cite
When Is a Graph a Covariance? Bayesian Residual Propagation under Covariance Uncertainty — arXiv:2610.04989 — arXiv (en), https://arxiv.org/abs/2610.04989 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d9b37131ccbf (Metraipolis archive dc_d9b37131ccbf, sha256 ae6f8bedf411114fa27ab9c1bb512e3a651d87b2f2439ecd02d1f31f19c6658e)
BibTeX
@misc{dcd9b37131ccbf,
title = {When Is a Graph a Covariance? Bayesian Residual Propagation under Covariance Uncertainty — arXiv:2610.04989},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.04989},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d9b37131ccbf; sha256 ae6f8bedf411114fa27ab9c1bb512e3a651d87b2f2439ecd02d1f31f19c6658e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.04989. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Observing a prediction error at one node can help correct predictions elsewhere, but the benefit depends on the residual dependence between nodes. A graph suggests where that dependence might occur, yet does not establish its sign or strength. We develop a Bayesian model of residual covariance to determine how revealed errors should update a fixed feature-based predictor. For a fixed set of revealed nodes, we derive an exact identity for the change in expected squared error under linear residual propagation. The identity characterizes the optimal linear update and expresses the excess error of any other update as an exact quadratic. Under covariance uncertainty, the Bayes-optimal fixed linear update uses the posterior mean covariance. We average over four positive-semidefinite covariance families representing no dependence, positive dependence, negative dependence, and dependence whose sign can alternate with graph distance. Across eight graph benchmarks, four show posterior support within the distance-profile family for negative covariance between neighbors and alternating signs with distance. Among the evaluated methods, ours achieves the smallest worst-case recall gap to the best method on each graph. The method improves squared error over residual propagation on five of eight graphs, but performs substantially worse on one dense heterophilous graph. In these experiments, selecting the highest-posterior family performs similarly to model averaging. Tema degli esploratori: statistica e scienza dei dati (elenco arXiv stat.ML, nuovi lavori del giorno). Categorie arXiv: Statistics Theory (math.ST) ; Machine Learning (stat.ML). Pagina del lavoro: https://arxiv.org/abs/2610.04989 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-06T08:24:13.983Z dalla pagina https://arxiv.org/list/stat.ML/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).