Efficient Network Automatic Relevance Determination
Hongwei Zhang, Ziqi Ye, Xinyuan Wang, Xin Guo, Zenglin Xu, Yuan Cheng, Zixin Hu, Yuan Qi

TL;DR
This paper introduces NARD, a sparse feature selection method for probabilistic models that efficiently captures input-output relationships and correlations, with significant computational improvements over previous methods.
Contribution
The paper extends ARD to NARD, incorporating a matrix normal prior and proposing Sequential NARD and Surrogate Function methods for computational efficiency.
Findings
Significant reduction in computational complexity per iteration.
Comparable performance on synthetic and real-world datasets.
Effective feature relevance determination with sparse models.
Abstract
We propose Network Automatic Relevance Determination (NARD), an extension of ARD for linearly probabilistic models, to simultaneously model sparse relationships between inputs and outputs , while capturing the correlation structure among the . NARD employs a matrix normal prior which contains a sparsity-inducing parameter to identify and discard irrelevant features, thereby promoting sparsity in the model. Algorithmically, it iteratively updates both the precision matrix and the relationship between and the refined inputs. To mitigate the computational inefficiencies of the cost per iteration, we introduce Sequential NARD, which evaluates features sequentially, and a Surrogate Function Method, leveraging an efficient approximation of the marginal likelihood and simplifying the calculation of…
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.
Taxonomy
TopicsNetwork Packet Processing and Optimization · Neural Networks and Applications · Network Security and Intrusion Detection
