activity
20182024
most citedSparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networks

341 citations · 467 across the 22 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2021

Pebbles, Graphs, and a Pinch of Combinatorics: Towards Tight I/O Lower Bounds for Statically Analyzable Programs

Grzegorz Kwasniewski, Tal Ben-Nun, Lukas Gianinazzi +5

Determining I/O lower bounds is a crucial step in obtaining communication-efficient parallel algorithms, both across the memory hierarchy and between processors. Current approaches…