about
Submanifold Spare Convolutional Networks (arxiv.org)
2 points by fnbr on Jul 24, 2017 | hide | past | pdf | 1 comment on HN

In plain words: A convolution that only works where data already exists, instead of spreading activity into empty space with every layer, keeps sparse inputs like pen strokes or 3D scans from filling up with zeros. It matched the best existing approaches while needing far less computation.

Abstract · Submanifold Sparse Convolutional Networks

Convolutional network are the de-facto standard for analysing spatio-temporal data such as images, videos, 3D shapes, etc. Whilst some of this data is naturally dense (for instance, photos), many other data sources are inherently sparse. Examples include pen-strokes forming on a piece of paper, or (colored) 3D point clouds that were obtained using a LiDAR scanner or RGB-D camera. Standard "dense" implementations of convolutional networks are very inefficient when applied on such sparse data. We introduce a sparse convolutional operation tailored to processing sparse data that differs from prior work on sparse convolutional networks in that it operates strictly on submanifolds, rather than "dilating" the observation with every layer in the network. Our empirical analysis of the resulting submanifold sparse convolutional networks shows that they perform on par with state-of-the-art methods whilst requiring substantially less computation.

Benjamin Graham, Laurens van der Maaten
arXiv:1706.01307 · cs.NE, cs.CV · submitted Jun 5, 2017
abstract · pdf · html · 10 pages

add comment on HN

Currently reading this. I'm really interested in the subject, as current work is limited by the fact that GPUs can make dense matrix multiplications really, really fast, but aren't great at much else (as far as I'm aware). Sparsity seems essential to scaling networks up to bigger sizes & datasets, and the paper shows one way of doing this.