articles
None
view repo
Deep Learning's recent successes have mostly relied on Convolutional Networks, which exploit fundamental statistical properties of images, sounds and video data: the local stationarity and multi-scale compositional structure, that allows expressing long range interactions in terms of shorter, localized interactions. However, there exist other important examples, such as text documents or bioinformatic data, that may lack some or all of these strong statistical regularities. In this paper we consider the general question of how to construct deep architectures with small learning complexity on general non-Euclidean domains, which are typically unknown and need to be estimated from the data. In particular, we develop an extension of Spectral Networks which incorporates a Graph Estimation procedure, that we test on large-scale classification problems, matching or improving over Dropout Networks with far less parameters to estimate.
READ FULL TEXT
Recently, neural network based approaches have achieved significant
impr...
read it
We propose the Lanczos network (LanczosNet), which uses the Lanczos algo...
read it
Spectral graph convolutional networks are generalizations of standard
co...
read it
Deep neural networks have revolutionized many machine learning tasks in ...
read it
Graph Convolutional Networks (GCNs) generalize the idea of deep convolut...
read it
We derive a relationship between network representation in energy-effici...
read it
Recent advances in graph convolutional networks have significantly impro...
read it
None
Comments
There are no comments yet.