Sparse Covariance Neural Networks
<|reference_start|>Sparse Covariance Neural Networks: Covariance Neural Networks (VNNs) perform graph convolutions on the covariance matrix of tabular data and achieve success in a variety of applications. However, the empirical covariance matrix on which the VNNs operate may contain many spurious correlations, making VNNs' performance inconsistent due to these noisy estimates and decreasing their computational efficiency. To tackle this issue, we put forth Sparse coVariance Neural Networks (S-VNNs), a framework that applies sparsification techniques on the sample covariance matrix before convolution. When the true covariance matrix is sparse, we propose hard and soft thresholding to improve covariance estimation and reduce computational cost. Instead, when the true covariance is dense, we propose stochastic sparsification where data correlations are dropped in probability according to principled strategies. We show that S-VNNs are more stable than nominal VNNs as well as sparse principal component analysis. By analyzing the impact of sparsification on their behavior, we provide novel connections between S-VNN stability and data distribution. We support our theoretical findings with experimental results on various application scenarios, ranging from brain data to human action recognition, and show an improved task performance, stability, and computational efficiency of S-VNNs compared with nominal VNNs.<|reference_end|>
@article{cavallo2024sparse,
    title={Sparse Covariance Neural Networks},
    author={Andrea Cavallo, Zhan Gao, Elvin Isufi},
    journal={arXiv preprint arXiv:2410.01669},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.01669},
    primaryClass={cs.LG stat.ML}
}