arXiv:2611.25826v1 Announce Type: new
Abstract: Low-rank plus sparse decompositions, such as robust PCA, typically model the low-rank component as dense and the sparse component as corruption. This viewpoint is poorly suited to graph adjacency matrices, where sparsity is structural and dense low-rank factors destroy the combinatorial and computational properties of the graph. We propose signed biclique decomposition (SBD), a sparse low-rank decomposition for integer-weighted graphs that represents the structured component as a sum of sparse signed binary rank-one factors, together with a sparse signed residual. The resulting representation remains discrete, interpretable, sparse, and compatible with standard linear algebra. We formulate fixed-rank and greedy SBD objectives and derive a gain-based greedy algorithm with theoretical guarantees. Empirically, SBD recovers block structure in noisy graphs, while its factorized representation enables efficient sparse matrix-matrix multiplication (SpMM). On real graphs with strong shared-neighborhood structure, SBD achieves compression factors above $10$ and SpMM speedups up to $6\times$ over cuSPARSE, suggesting a practical alternative to dense low-rank decompositions for graphs. Code is available at https://github.com/IAntoineV/sbd.
Trending
- [2609.39632] Towards Better Exploration in Sequential Test-Time Scaling
- A Sparse Low-Rank Biclique Decomposition for Graphs
- Hours after Anthropic claims a Claude proof of the Riemann hypothesis, Stanford releases an all-human competing draft
- [2609.37351] Clause-Factored Bilateral State Grounding and Scoped Passivity for Counterfactual Open-World Deductive Reasoning
- Best Laptops for Travel (2026): Which to Take on the Road
- [2611.25796] How Reliable Are Explanations of Language Models That Detect Insider Threats?
- Lifting Classifier Training with Latent Gaussian Mixture Models
- New open model Inkling 2 Mini thinks in loops to solve problems with fewer words and still runs on a laptop
