Graph Regularized PCA
arXiv:2601. 10199v2 Announce Type: replace Abstract: Multivariate data often exhibit complex dependencies that violate the assumption of isotropic residual noise.
arXiv:2601. 10199v2 Announce Type: replace Abstract: Multivariate data often exhibit complex dependencies that violate the assumption of isotropic residual noise.
arXiv:2606. 03553v1 Announce Type: cross Abstract: While principal component analysis (PCA) is a fundamental tool for dimensionality reduction, its dense representations make it ill-suited for high-dimensional data.
arXiv:2607. 08786v1 Announce Type: cross Abstract: With the growing deployment of large language models (LLMs), LLM inference cost has become a key challenge.
Celty introduces a co-designed sparse format, GPU kernel, and SIMT microarchitecture to efficiently handle Sparse Matrix‑Sparse Vector (SpMSpV) workloads in large language model inference. Its Run‑Length Compressed CSC (RLC‑CSC) format allows vectorized loading of compressed weight columns and skips memory accesses by exploiting both weight pruning and activation sparsity. The Celty Sparse SIMT Core adds a pipelined RLC decoder that eliminates software index reconstruction and uses local registers for conflict‑free accumulation, achieving up to 5.3× speedup over cuBLAS at 70% dual‑sparsity.
arXiv:2608.21607v1 Announce Type: cross Abstract: We investigate when a sparse nonnegative matrix can be recovered from a real-valued matrix of much lower rank by zeroing out its negative elements. T...
arXiv:2608. 05033v1 Announce Type: cross Abstract: Sparse matrix kernels are fundamental to scientific computing, graph analytics, and machine learning.
arXiv:2607. 25295v2 Announce Type: replace Abstract: Tensorial multi-view clustering (TMC) has achieved strong performance due to its ability to capture high-order correlations across multiple views.
arXiv:2606. 01546v1 Announce Type: new Abstract: Sparse high-dimensional representations are conducive to uncovering nontrivial structures in unsupervised exploration of data.
arXiv:2608. 01536v1 Announce Type: cross Abstract: Large Language Models (LLMs) increasingly rely on sparsity to reduce inference cost, but most prior work targets a single sparsity source-either weight or activation-and optimizes for batched multi-user inference.
arXiv:2607. 05229v1 Announce Type: cross Abstract: We present msPCA: an open-source R package for sparse principal component analysis with multiple components.
arXiv:2609.09211v1 Announce Type: new Abstract: The Davis-Kahan theorem is a fundamental tool in spectral analysis, providing quantitative control over the distance between the eigenspaces of a symme...
arXiv:2509. 10033v2 Announce Type: replace Abstract: Sparse dictionary coding represents signals as linear combinations of a few dictionary atoms.