Selection of Supervised Learning-based Sparse Matrix Reordering Algorithms
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917078453190656 |
|---|---|
| author | Tang, Tao Jiang, Youfu Cui, Yingbo Fang, Jianbin Zhang, Peng Peng, Lin Huang, Chun |
| author_facet | Tang, Tao Jiang, Youfu Cui, Yingbo Fang, Jianbin Zhang, Peng Peng, Lin Huang, Chun |
| contents | Sparse matrix ordering is a vital optimization technique often employed for solving large-scale sparse matrices. Its goal is to minimize the matrix bandwidth by reorganizing its rows and columns, thus enhancing efficiency. Conventional methods for algorithm selection usually depend on brute-force search or empirical knowledge, lacking the ability to adjust to diverse sparse matrix structures.As a result, we have introduced a supervised learning-based model for choosing sparse matrix reordering algorithms. This model grasps the correlation between matrix characteristics and commonly utilized reordering algorithms, facilitating the automated and intelligent selection of the suitable sparse matrix reordering algorithm. Experiments conducted on the Florida sparse matrix dataset reveal that our model can accurately predict the optimal reordering algorithm for various matrices, leading to a 55.37% reduction in solution time compared to solely using the AMD reordering algorithm, with an average speedup ratio of 1.45. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_10180 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Selection of Supervised Learning-based Sparse Matrix Reordering Algorithms Tang, Tao Jiang, Youfu Cui, Yingbo Fang, Jianbin Zhang, Peng Peng, Lin Huang, Chun Distributed, Parallel, and Cluster Computing Sparse matrix ordering is a vital optimization technique often employed for solving large-scale sparse matrices. Its goal is to minimize the matrix bandwidth by reorganizing its rows and columns, thus enhancing efficiency. Conventional methods for algorithm selection usually depend on brute-force search or empirical knowledge, lacking the ability to adjust to diverse sparse matrix structures.As a result, we have introduced a supervised learning-based model for choosing sparse matrix reordering algorithms. This model grasps the correlation between matrix characteristics and commonly utilized reordering algorithms, facilitating the automated and intelligent selection of the suitable sparse matrix reordering algorithm. Experiments conducted on the Florida sparse matrix dataset reveal that our model can accurately predict the optimal reordering algorithm for various matrices, leading to a 55.37% reduction in solution time compared to solely using the AMD reordering algorithm, with an average speedup ratio of 1.45. |
| title | Selection of Supervised Learning-based Sparse Matrix Reordering Algorithms |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2511.10180 |