Sparse Network Inference under Imperfect Detection and its Application to Ecological Networks
Aoran Zhang, Tianyao Wei, Maria J. Guerrero, C\'esar A. Uribe

TL;DR
This paper introduces a structured sparse nonnegative low-rank factorization framework with detection probability estimation to improve ecological network inference from imperfect, sparse count data.
Contribution
It proposes a novel nonconvex regularization approach and an ADMM-based algorithm to enhance structural recovery in ecological networks with imperfect detection.
Findings
Improved recovery of latent factors and network structure in ecological datasets.
The proposed method outperforms existing baselines in synthetic and real-world experiments.
Abstract
Recovering latent structure from count data has received considerable attention in network inference, particularly when one seeks both cross-group interactions and within-group similarity patterns in bipartite networks, which is widely used in ecology research. Such networks are often sparse and inherently imperfect in their detection. Existing models mainly focus on interaction recovery, while the induced similarity graphs are much less studied. Moreover, sparsity is often not controlled, and scale is unbalanced, leading to oversparse or poorly rescaled estimates with degrading structural recovery. To address these issues, we propose a framework for structured sparse nonnegative low-rank factorization with detection probability estimation. We impose nonconvex regularization on the latent similarity and connectivity structures to promote sparsity within-group similarity and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
