Demo Data from VLDB 2026 / reviewers in the wild / expert
William H. Renninger
dblp:410/3902
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Efficient and distributed learning · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Hardware accelerators and domain-specific architectures · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning › model compression › sparse training
dynamic sparse training |
0.9 | 1 | 2025 | Dynamic Sparse Training of Diagonally Sparse Networks · ICML 2025 |
Machine learning › Efficient and distributed learning
model compression |
0.9 | 1 | 2025 | Dynamic Sparse Training of Diagonally Sparse Networks · ICML 2025 |
Machine learning › Efficient and distributed learning › model compression › sparsity
structured sparsity |
0.9 | 1 | 2025 | Dynamic Sparse Training of Diagonally Sparse Networks · ICML 2025 |
Hardware accelerators and domain-specific architectures
machine learning accelerator |
0.9 | 1 | 2025 | Dynamic Sparse Training of Diagonally Sparse Networks · ICML 2025 |
Hardware accelerators and domain-specific architectures › sparsity exploitation
sparse tensor computation |
0.9 | 1 | 2025 | Dynamic Sparse Training of Diagonally Sparse Networks · ICML 2025 |
Methods — techniques the papers use, named apart from their topics
diagonal sparsity pattern · 1.7CUDA kernel · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Dynamic Sparse Training of Diagonally Sparse NetworksabstractRecent advances in Dynamic Sparse Training (DST) have pushed the frontier of sparse neural network training in structured and unstructured contexts, matching dense-model performance while drastically reducing parameter counts to facilitate model scaling. However, unstructured sparsity often fails to translate into practical speedups on modern hardware. To address this shortcoming, we propose DynaDiag, a novel structured sparse-to-sparse DST method that performs at par with unstructured sparsity. DynaDiag enforces a diagonal sparsity pattern throughout training and preserves sparse computation in forward and backward passes. We further leverage the diagonal structure to accelerate computation via a custom CUDA kernel, rendering the method hardware-friendly. Empirical evaluations on diverse neural architectures demonstrate that our method maintains accuracy on par with unstructured counterparts while benefiting from tangible computational gains. Notably, with 90\% sparse linear layers in ViTs, we observe up to a 3.13x speedup in online inference without sacrificing model performance and a 1.59x speedup in training on a GPU compared to equivalent unstructured layers. Abhishek Tyagi, Arjun Iyer, William H. Renninger, Christopher Kanan, Yuhao Zhu 0001 |
ICML | 3 |