Datasets:
Tasks:
Tabular Regression
Formats:
parquet
Size:
< 1K
ArXiv:
Tags:
sparse-matrices
linear-systems
preconditioners
numerical-linear-algebra
suitesparse
scientific-computing
License:
Update dataset card with benchmark and ablation results
Browse files
README.md
CHANGED
|
@@ -66,8 +66,12 @@ A curated subset of the [SuiteSparse Matrix Collection](https://sparse.tamu.edu/
|
|
| 66 |
│ ├── ACTIVSg2000/
|
| 67 |
│ │ └── ACTIVSg2000.mtx
|
| 68 |
│ └── ... # 867 matrix directories
|
| 69 |
-
|
| 70 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
| 71 |
```
|
| 72 |
|
| 73 |
### manifest.parquet
|
|
@@ -86,7 +90,64 @@ Browsable in the HuggingFace Dataset Viewer. Fields:
|
|
| 86 |
|
| 87 |
### benchmark_results/
|
| 88 |
|
| 89 |
-
JSONL file with FGMRES solver results
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 90 |
|
| 91 |
## Dataset Creation
|
| 92 |
|
|
|
|
| 66 |
│ ├── ACTIVSg2000/
|
| 67 |
│ │ └── ACTIVSg2000.mtx
|
| 68 |
│ └── ... # 867 matrix directories
|
| 69 |
+
├── benchmark_results/
|
| 70 |
+
│ └── benchmark_gnp_paper.jsonl # FGMRES benchmark: 838 matrices × 6 preconditioners
|
| 71 |
+
└── ablation_results/
|
| 72 |
+
├── ablation_edge_features.json # Study 1: 3 seeds, 500 epochs (original)
|
| 73 |
+
├── ablation_edge_features_v2.json # Study 2: 3 seeds, 500 epochs (pre-Dirichlet fix)
|
| 74 |
+
└── ablation_edge_features_v3.json # Study 3: 5 seeds, 1000 epochs (definitive)
|
| 75 |
```
|
| 76 |
|
| 77 |
### manifest.parquet
|
|
|
|
| 90 |
|
| 91 |
### benchmark_results/
|
| 92 |
|
| 93 |
+
JSONL file with FGMRES solver results for 838/867 matrices (29 timed out/OOM) using 6 preconditioners.
|
| 94 |
+
|
| 95 |
+
**FGMRES settings** (matching GNP paper): restart=10, max_iters=100, rtol=1e-8.
|
| 96 |
+
|
| 97 |
+
Per-entry fields: matrix properties (symmetry, diagonal dominance, scaling factor, zero diagonal count), and per-preconditioner results (construction time/status, convergence, iterations, residual history, Iter-AUC, Time-AUC).
|
| 98 |
+
|
| 99 |
+
#### Benchmark Results Summary
|
| 100 |
+
|
| 101 |
+
| Preconditioner | Converged | Construction Failed | Not Converged |
|
| 102 |
+
|---|---|---|---|
|
| 103 |
+
| **ILU(0)** | **376 (44.9%)** | 309 (36.9%) | 153 (18.3%) |
|
| 104 |
+
| AMG (AIR) | 206 (24.6%) | 16 (1.9%) | 616 (73.5%) |
|
| 105 |
+
| GMRES-Inner | 107 (12.8%) | 0 (0.0%) | 731 (87.2%) |
|
| 106 |
+
| None | 64 (7.6%) | 0 (0.0%) | 774 (92.4%) |
|
| 107 |
+
| Block Jacobi | 41 (4.9%) | 577 (68.9%) | 220 (26.3%) |
|
| 108 |
+
| Jacobi | 33 (3.9%) | 603 (72.0%) | 202 (24.1%) |
|
| 109 |
+
|
| 110 |
+
**Iter-AUC win rates** (best preconditioner per matrix):
|
| 111 |
+
ILU 41.1% · GMRES-Inner 33.9% · AMG 24.4% · Rest 0.5%
|
| 112 |
+
|
| 113 |
+
**Key findings:**
|
| 114 |
+
- 525/838 (62.6%) matrices solved by at least one preconditioner
|
| 115 |
+
- 313/838 (37.4%) matrices unsolved by any classical method
|
| 116 |
+
- 72% of matrices have zero diagonal entries (→ Jacobi family construction failure)
|
| 117 |
+
- ILU dominates small matrices (<5K), AMG becomes competitive at >10K
|
| 118 |
+
- ILU ∪ AMG covers 511/838 (61.0%); 327 matrices (39.0%) have both ILU and AMG failing
|
| 119 |
+
|
| 120 |
+
**Comparison with GNP paper** (arXiv 2406.00809v3, same 867 matrices):
|
| 121 |
+
|
| 122 |
+
| Metric | Ours | GNP paper |
|
| 123 |
+
|---|---|---|
|
| 124 |
+
| ILU construction failures | 309 (36.9%) | 348 (40.1%) |
|
| 125 |
+
| AMG construction failures | 16 (1.9%) | 62 (7.2%) |
|
| 126 |
+
| ILU iter-AUC win rate | 41.1% | ~40% |
|
| 127 |
+
| AMG iter-AUC win rate | 24.4% | ~25% |
|
| 128 |
+
| GNP iter-AUC win rate | — | ~25% |
|
| 129 |
+
| GNP construction failures | — | 0 (0.0%) |
|
| 130 |
+
|
| 131 |
+
### ablation_results/
|
| 132 |
+
|
| 133 |
+
GCN vs MPNN ablation studies comparing `ContextResGCN` (GCN with Gershgorin-normalized adjacency) against `ContextResMPNN` (explicit edge function with sum aggregation).
|
| 134 |
+
|
| 135 |
+
**FGMRES settings**: restart=30, max_iters=300, rtol=1e-6. Training on diffusion + advection only, evaluated on diffusion, advection, and graph_laplacian (OOD). Grid sizes: 16, 24, 32 (train) + 48 (OOD).
|
| 136 |
+
|
| 137 |
+
#### Study 3 Results (definitive, 5 seeds × 1000 epochs)
|
| 138 |
+
|
| 139 |
+
| Domain | Model | Convergence | Avg Iterations |
|
| 140 |
+
|---|---|---|---|
|
| 141 |
+
| Diffusion | GCN | **800/800 (100%)** | 90.5 |
|
| 142 |
+
| Diffusion | MPNN | **800/800 (100%)** | 85.7 |
|
| 143 |
+
| Advection | GCN | **800/800 (100%)** | 87.2 |
|
| 144 |
+
| Advection | MPNN | **800/800 (100%)** | 83.0 |
|
| 145 |
+
| Graph Laplacian (OOD) | GCN | **400/400 (100%)** | 63.1 |
|
| 146 |
+
| Graph Laplacian (OOD) | MPNN | **0/400 (0%)** | — |
|
| 147 |
+
|
| 148 |
+
**Training loss** (nearly identical): GCN 0.091 vs MPNN 0.092.
|
| 149 |
+
|
| 150 |
+
MPNN is competitive on in-distribution domains but catastrophically fails on OOD graph topology (Barabási-Albert graphs with power-law degree distribution). Root cause: MPNN's explicit edge function overfits to training topology; GCN's Gershgorin-normalized adjacency is degree-invariant by construction. See [ADR-04](https://github.com/Csed-dev/MatrixPFN/blob/main/docs/adr/04-gcn-over-mpnn.md) and [ADR-08](https://github.com/Csed-dev/MatrixPFN/blob/main/docs/adr/08-mpnn-generalization-failure.md).
|
| 151 |
|
| 152 |
## Dataset Creation
|
| 153 |
|