Pith. sign in

REVIEW

Learning Local Receptive Fields and their Weight Sharing Scheme on Graphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1706.02684 v3 pith:KX6LL7M3 submitted 2017-06-08 cs.LG cs.CVcs.NE

classification cs.LGcs.CVcs.NE
keywords convolutionalfiltersformulationgraphschemesharingweightable
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We propose a simple and generic layer formulation that extends the properties of convolutional layers to any domain that can be described by a graph. Namely, we use the support of its adjacency matrix to design learnable weight sharing filters able to exploit the underlying structure of signals in the same fashion as for images. The proposed formulation makes it possible to learn the weights of the filter as well as a scheme that controls how they are shared across the graph. We perform validation experiments with image datasets and show that these filters offer performances comparable with convolutional ones.

Discussion (0). Sign in to comment.

Pith tools