pith. sign in

arxiv: 1312.6203 · v3 · pith:EBFHJHDEnew · submitted 2013-12-21 · 💻 cs.LG · cs.CV· cs.NE

Spectral Networks and Locally Connected Networks on Graphs

classification 💻 cs.LG cs.CVcs.NE
keywords networksarchitecturesconvolutionaldomainefficientgraphspossibleability
0
0 comments X
read the original abstract

Convolutional Neural Networks are extremely efficient architectures in image and audio recognition tasks, thanks to their ability to exploit the local translational invariance of signal classes over their domain. In this paper we consider possible generalizations of CNNs to signals defined on more general domains without the action of a translation group. In particular, we propose two constructions, one based upon a hierarchical clustering of the domain, and another based on the spectrum of the graph Laplacian. We show through experiments that for low-dimensional graphs it is possible to learn convolutional layers with a number of parameters independent of the input size, resulting in efficient deep architectures.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 13 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. FlexVector: A SpMM Vector Processor with Flexible VRF for GCNs on Varying-Sparsity Graphs

    cs.DC 2026-04 unverdicted novelty 7.0

    FlexVector achieves 3.78x speedup and 40.5% lower energy for GCN inference on five real-world datasets by using flexible VRFs and graph preprocessing to match varying-sparsity graphs.

  2. Rodrigues Network for Learning Robot Actions

    cs.RO 2025-06 unverdicted novelty 7.0

    Proposes Rodrigues Network using a learnable Neural Rodrigues Operator to add kinematic inductive biases for improved robot action learning and prediction.

  3. A Benchmark Dataset for Graph Regression with Homogeneous and Multi-Relational Variants

    cs.LG 2025-05 unverdicted novelty 7.0

    RelSC is a new graph regression benchmark from program graphs with execution time labels, released in homogeneous (RelSC-H) and multi-relational (RelSC-M) variants to study representation effects.

  4. Ada-Diffuser: Latent-Aware Adaptive Diffusion for Decision-Making

    cs.LG 2026-05 unverdicted novelty 6.0

    Ada-Diffuser is a causal diffusion model that jointly learns observed interaction structure and underlying latent dynamics from minimal observations for adaptive planning and policy learning.

  5. ASPIRE: Make Spectral Graph Collaborative Filtering Great Again via Adaptive Filter Learning

    cs.IR 2026-04 unverdicted novelty 6.0

    ASPIRE learns adaptive graph filters via bi-level optimization to overcome low-frequency explosion bias in spectral collaborative filtering, achieving strong performance and stability.

  6. Uniform Inductive Spatio-Temporal Kriging

    cs.AI 2026-03 unverdicted novelty 6.0

    UniSTOK improves inductive spatio-temporal kriging under incomplete observations by reliability-guided signal regulation and residual bias calibration.

  7. When Structure Doesn't Help: LLMs Do Not Read Text-Attributed Graphs as Effectively as We Expected

    cs.LG 2025-11 conditional novelty 6.0

    LLMs achieve strong results on text-attributed graphs using only node textual descriptions, while most methods for encoding graph structure deliver marginal or negative gains.

  8. Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks

    cs.LG 2019-09 unverdicted novelty 6.0

    DGL is a graph-centric library that optimizes GNNs via generalized sparse tensor operations, transparent graph-based optimizations, and framework-neutral design, claiming superior speed and memory use over other GNN f...

  9. Graph Transductive Sharpening: Leveraging Unlabeled Predictions in Node Classification

    cs.LG 2026-05 unverdicted novelty 5.0

    Transductive Sharpening adds an entropy-minimization term on unlabeled-node predictions to the training objective for graph node classification.

  10. Make Your LVLM KV Cache More Lightweight

    cs.CV 2026-05 unverdicted novelty 5.0

    LightKV compresses vision-token KV cache in LVLMs to 55% size via prompt-guided cross-modality aggregation, halving cache memory, cutting compute 40%, and maintaining performance on benchmarks.

  11. Efficient and Scalable Granular-ball Graph Coarsening Method for Large-scale Graph Node Classification

    cs.LG 2026-03 unverdicted novelty 5.0

    A multi-granularity granular-ball coarsening algorithm reduces large graphs in linear time for faster GCN training on node classification, with experiments claiming superior performance over prior methods.

  12. PH-GCN: Person Re-identification with Part-based Hierarchical Graph Convolutional Network

    cs.CV 2019-07 unverdicted novelty 4.0

    PH-GCN constructs a hierarchical graph of person parts and performs local/global feature learning via message passing in an end-to-end network for person re-identification.

  13. A review on deep learning techniques for 3D sensed data classification

    cs.CV 2019-07 unverdicted novelty 1.0

    A survey of deep learning architectures for 3D sensed data classification covering RGB-D, multi-view, volumetric and end-to-end methods along with datasets and future directions.