Good pivots for small sparse matrices
For sparse matrices up to size $8 \times 8$, we determine optimal choices for pivot selection in Gaussian elimination. It turns out that they are slightly better than the pivots chosen by a popular pivot selection strategy, so there is some room for improvement. We then create a pivot selection strategy using machine learning and find that it indeed leads to a small improvement compared to the classical strategy.
Code (1)
Tasks
BIG-bench Machine LearningSimilar Papers 제목 키워드 기반
Hierarchical Attention Transfer Network for Cross-Domain Sentiment Classification
Cross-domain sentiment classification aims to leverage useful information in a source domain to help do sentiment classifi- cation in a target domain that has no or little supervised infor- mation. Existing cross-domain …
ClassificationCross-Domain Text ClassificationDomain AdaptationGeneral Classification+2Sparse Recovery from Extreme Eigenvalues Deviation Inequalities
This article provides a new toolbox to derive sparse recovery guarantees from small deviations on extreme singular values or extreme eigenvalues obtained in Random Matrix Theory. This work is based on Restricted Isometry…
compressed sensingOptimization for Compressed Sensing: the Simplex Method and Kronecker Sparsification
In this paper we present two new approaches to efficiently solve large-scale compressed sensing problems. These two ideas are independent of each other and can therefore be used either separately or together. We consider…
compressed sensingPIVOTSBench: Evaluating Fine-Grained Interpersonal Relationship Reasoning in Multimodal Large Language Models
Humans possess an innate ability to understand fine-grained interpersonal relationships, which is central to everyday social interactions. Although such reasoning is inherently multimodal, it remains largely unexplored b…
Solving Quadratic Systems with Full-Rank Matrices Using Sparse or Generative Priors
The problem of recovering a signal $\boldsymbol x\in \mathbb{R}^n$ from a quadratic system $\{y_i=\boldsymbol x^\top\boldsymbol A_i\boldsymbol x,\ i=1,\ldots,m\}$ with full-rank matrices $\boldsymbol A_i$ frequently aris…