Schur's Positive-Definite Network: Deep Learning in the SPD cone with structure
원문 초록
Estimating matrices in the symmetric positive-definite (SPD) cone is of interest for many applications ranging from computer vision to graph learning. While there exist various convex optimization-based estimators, they remain limited in expressivity due to their model-based approach. The success of deep learning motivates the use of learning-based approaches to estimate SPD matrices with neural networks in a data-driven fashion. However, designing effective neural architectures for SPD learning is challenging, particularly when the task requires additional structural constraints, such as element-wise sparsity. Current approaches either do not ensure that the output meets all desired properties or lack expressivity. In this paper, we introduce SpodNet, a novel and generic learning module that guarantees SPD outputs and supports additional structural constraints. Notably, it solves the challenging task of learning jointly SPD and sparse matrices. Our experiments illustrate the versatility and relevance of SpodNet layers for such applications.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Towards Effective Federated Graph Foundation Model via Mitigating Knowledge Entanglement
Graph World Model
Learning Robust Stereo Matching in the Wild with Selective Mixture-of-Experts
S2FGL: Spatial Spectral Federated Graph Learning
AGTCNet: A Graph-Temporal Approach for Principled Motor Imagery EEG Classification
Self-Supervised Graph Learning via Spectral Bootstrapping and Laplacian-Based Augmentations
토론
이 논문과 연결된 포럼 글이 아직 없습니다.