Pith. sign in

REVIEW

Graph Signal Processing and Deep Learning: Convolution, Pooling, and Topology

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 2008.01247 v1 pith:RRRMJYIB submitted 2020-08-04 eess.SP

classification eess.SP
keywords graphdeeplearningdatadomainsprocessingsignalstructure
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Deep learning, particularly convolutional neural networks (CNNs), have yielded rapid, significant improvements in computer vision and related domains. But conventional deep learning architectures perform poorly when data have an underlying graph structure, as in social, biological, and many other domains. This paper explores 1)how graph signal processing (GSP) can be used to extend CNN components to graphs in order to improve model performance; and 2)how to design the graph CNN architecture based on the topology or structure of the data graph.

Discussion (0). Continue with ORCID to comment.

Pith tools