Archives AI News

Graph Contrastive Learning via Spectral Graph Alignment

arXiv:2512.07878v1 Announce Type: new Abstract: Given augmented views of each input graph, contrastive learning methods (e.g., InfoNCE) optimize pairwise alignment of graph embeddings across views while providing no mechanism to control the global structure of the view specific graph-of-graphs built…

Nonnegative Matrix Factorization through Cone Collapse

arXiv:2512.07879v1 Announce Type: new Abstract: Nonnegative matrix factorization (NMF) is a widely used tool for learning parts-based, low-dimensional representations of nonnegative data, with applications in vision, text, and bioinformatics. In clustering applications, orthogonal NMF (ONMF) variants further impose (approximate) orthogonality…

Semi-Supervised Contrastive Learning with Orthonormal Prototypes

arXiv:2512.07880v1 Announce Type: new Abstract: Contrastive learning has emerged as a powerful method in deep learning, excelling at learning effective representations through contrasting samples from different distributions. However, dimensional collapse, where embeddings converge into a lower-dimensional space, poses a significant…

GSPN-2: Efficient Parallel Sequence Modeling

arXiv:2512.07884v1 Announce Type: new Abstract: Efficient vision transformer remains a bottleneck for high-resolution images and long-video related real-world applications. Generalized Spatial Propagation Network (GSPN) addresses this by replacing quadratic self-attention with a line-scan propagation scheme, bringing the cost close to…

GateRA: Token-Aware Modulation for Parameter-Efficient Fine-Tuning

arXiv:2511.17582v2 Announce Type: replace Abstract: Parameter-efficient fine-tuning (PEFT) methods, such as LoRA, DoRA, and HiRA, enable lightweight adaptation of large pre-trained models via low-rank updates. However, existing PEFT approaches apply static, input-agnostic updates to all tokens, disregarding the varying importance…