Fetching the paper…
Reading the bibliography…
As real-world graphs expand in size, larger GNN models with billions of parameters are deployed.
M. C. Mozer et al. , “Skeletonization: A technique for trimming the fat from a network via relevance assessment,” ICLR , vol. 1, 1988
1988
Earlier work this paper cites.
C. L. Giles et al. , “Citeseer: An automatic citation indexing system,” in Proceedings of the third ACM conference on Digital libraries , 1998, pp. 89–98
1998
Earlier work this paper cites.
A. K. McCallum et al. , “Automating the construction of internet portals with machine learning,” Information Retrieval , vol. 3, no. 2, pp. 127–163, 2000
2000
Earlier work this paper cites.
C. Rasmussen and Z. Ghahramani, “Occam’s razor,” ICLR , vol. 13, 2000
2000
Earlier work this paper cites.
J. Shetty and J. Adibi, “The enron email dataset database schema and brief statistical report,” 2004
2004
Earlier work this paper cites.
P. Sen et al. , “Collective classification in network data,” AI magazine , vol. 29, no. 3, pp. 93–93, 2008
2008
Earlier work this paper cites.
F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini, “The graph neural network model,” IEEE Transactions on Neural Networks , vol. 20, pp. 61–80, 2009
2009
Earlier work this paper cites.
S. P. Boyd et al. , “Distributed optimization and statistical learning via the alternating direction method of multipliers,” Found. Trends Mach. Learn. , vol. 3, pp. 1–122, 2011
2011
Earlier work this paper cites.
A. Krizhevsky, I. Sutskever, G. E. Hinton, F. Pereira, C. Burges, L. Bottou, and K. Weinberger, “Advances in neural information processing systems,” 2012
2012
Earlier work this paper cites.
2013
Earlier work this paper cites.
B. Perozzi et al. , “Deepwalk: online learning of social representations,” KDD ’14 , 2014
2014
Earlier work this paper cites.
J. Leskovec and A. Krevl, “{SNAP Datasets}: {Stanford} large network dataset collection,” 2014
2014
Earlier work this paper cites.
M. A. Bragin et al. , “Convergence of the surrogate lagrangian relaxation method,” J. Optim. Theory Appl , vol. 164, no. 1, pp. 173–201, 2015
2015
Earlier work this paper cites.
R. A. Rossi and N. Ahmed, “The network data repository with interactive graph analytics and visualization,” in AAAI , 2015
2015
Earlier work this paper cites.
2017
Earlier work this paper cites.
W. L. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in NIPS , 2017
2017
Earlier work this paper cites.
C. Ding et al. , “Circnn: accelerating and compressing deep neural networks using block-circulant weight matrices,” in MICRO-50 , 2017, pp. 395–408
2017
Earlier work this paper cites.
J. Li et al. , “Towards acceleration of deep convolutional neural networks using stochastic computing,” in ASP-DAC . IEEE, 2017, pp. 115–120
2017
Earlier work this paper cites.
A. Ren et al. , “Sc-dcnn: Highly-scalable deep convolutional neural network using stochastic computing,” ASPLOS , 2017
2017
Earlier work this paper cites.
Y. He et al. , “Channel pruning for accelerating very deep neural networks,” ICCV ’17 , pp. 1398–1406, 2017
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
A. Paranjape et al. , “Motifs in temporal networks,” WSDM ’17 , 2017
2017
Earlier work this paper cites.
M. G. Preti et al. , “The dynamic functional connectome: State-of-the-art and perspectives,” NeuroImage , vol. 160, pp. 41–54, 2017
2017
Earlier work this paper cites.
P. Velickovic et al. , “Graph attention networks,” ArXiv , vol. abs/1710.10903, 2018
2018
Earlier work this paper cites.
R. Ying et al. , “Graph convolutional neural networks for web-scale recommender systems,” KDD ’18 , 2018
2018
Earlier work this paper cites.
2018
Earlier work this paper cites.
J. Frankle and M. Carbin, “The lottery ticket hypothesis: Finding sparse, trainable neural networks,” in ICLR , 2018
2018
Earlier work this paper cites.
T. Zhang et al. , “A systematic dnn weight pruning framework using alternating direction method of multipliers,” in ECCV , 2018, pp. 184–199
2018
Cited alongside, same era.
G. H. Nguyen et al. , “Continuous-time dynamic network embeddings,” WWW ’18 , 2018
2018
Cited alongside, same era.
Y. Guo, C. Zhang, C. Zhang, and Y. Chen, “Sparse dnns with improved adversarial robustness,” ICLR , vol. 31, 2018
2018
Cited alongside, same era.
D. C. Mocanu, E. Mocanu, P. Stone, P. H. Nguyen, M. Gibescu, and A. Liotta, “Scalable training of artificial neural networks with adaptive sparse connectivity inspired by network science,” Nature communications , vol. 9, no. 1, pp. 1–12, 2018
2018
Cited alongside, same era.
X. Sun et al. , “Formal verification of neural network controlled autonomous systems,” in HSCC , 2019, pp. 147–156
2019
Cited alongside, same era.
D. Gurevin et al. , “Enabling retrain-free deep neural network pruning using surrogate lagrangian relaxation,” in IJCAI , 2021
2021
Later among the works it cites.
H. Peng et al. , “Optimizing fpga-based accelerator design for large-scale molecular similarity search (special session paper),” in ICCAD ’21 . IEEE, 2021, pp. 1–7
2021
Later among the works it cites.
T. Chen et al. , “A unified lottery ticket hypothesis for graph neural networks,” in ICML . PMLR, 2021, pp. 1695–1706
2021
Later among the works it cites.
P. Qi et al. , “Accelerating framework of transformer by hardware design and model compression co-optimization,” in ICCAD ’21 . IEEE, 2021, pp. 1–9
2021
Later among the works it cites.
S. Huang et al. , “Hmc-tran: A tensor-core inspired hierarchical model compression for transformer-based dnns on gpu,” in GLSVLSI , 2021, pp. 169–174
2021
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. Zhu et al. , “Aligraph: A comprehensive graph neural network platform,” KDD ’19 , 2019
2019
Cited alongside, same era.
Y. Cao, Z. Liu, C. Li, Z. Liu, J.-Z. Li, and T.-S. Chua, “Multi-channel graph neural network for entity alignment,” in ACL , 2019
2019
Cited alongside, same era.
Z. Liu, M. Sun et al. , “Rethinking the value of network pruning,” in ICLR , 2019
2019
Cited alongside, same era.
H. Li et al. , “Admm-based weight pruning for real-time deep learning acceleration on mobile devices,” GLSVLSI , 2019
2019
Cited alongside, same era.
N. Lee et al. , “Snip: Single-shot network pruning based on connection sensitivity,” in ICLR , 2019
2019
Cited alongside, same era.
2019
Cited alongside, same era.
S. Cunningham and D. Craig, “Creator governance in social media entertainment,” Social Media + Society , vol. 5, 2019
2019
Cited alongside, same era.
Later among the works it cites.
H. Peng et al. , “Accelerating transformer-based deep learning models on fpgas using column balanced block pruning,” in ISQED ’21 . IEEE, 2021, pp. 142–148
2021
Later among the works it cites.
D. Xu et al. , “Rethinking network pruning–under the pre-train and fine-tune paradigm,” in NAACL ’21 , 2021, pp. 2376–2382
2021
Later among the works it cites.
T. Chen, Y. Sui, X. Chen, A. Zhang, and Z. Wang, “A unified lottery ticket hypothesis for graph neural networks,” in ICML , 2021
2021
Later among the works it cites.
H. Peng et al. , “Binary complex neural network acceleration on fpga,” in ASAP ’21 . IEEE, 2021, pp. 85–92
2021
Later among the works it cites.
P. Qi et al. , “Accommodating transformer onto fpga: Coupling the balanced model compression and fpga-implementation optimization,” in GLSVLSI , 2021, pp. 163–168
2021
Later among the works it cites.
S. Yu, A. Mazaheri, and A. Jannesari, “Auto graph encoder-decoder for neural network pruning,” in Proceedings of the IEEE/CVF International Conference on Computer Vision , 2021, pp. 6362–6372
2021
Later among the works it cites.
G. Yuan et al. , “Improving dnn fault tolerance using weight pruning and differential crossbar mapping for reram-based edge ai,” in ISQED ’21 . IEEE, 2021, pp. 135–141
2021
Later among the works it cites.
S. Chen et al. , “Et: re-thinking self-attention for transformer models on gpus,” in SC ’21 , 2021, pp. 1–18
2021
Later among the works it cites.
S. Liu, L. Yin, D. C. Mocanu, and M. Pechenizkiy, “Do we actually need dense over-parameterization? in-time over-parameterization in sparse training,” in ICML . PMLR, 2021, pp. 6989–7000
2021
Later among the works it cites.
G. Yuan et al. , “Mest: Accurate and fast memory-economic sparse training framework on the edge,” ICLR , vol. 34, 2021
2021
Later among the works it cites.
N. Talati et al. , “A deep dive into understanding the random walk-based temporal graph learning,” IISWC ’21 , pp. 87–100, 2021
2021
Later among the works it cites.
N. Tonellotto and C. Macdonald, “Query embedding pruning for dense retrieval,” in Proceedings of the 30th ACM International Conference on Information & Knowledge Management , 2021, pp. 3453–3457
2021
Later among the works it cites.
W. Jiang and J. Luo, “Graph neural network for traffic forecasting: A survey,” Expert Systems with Applications , p. 117921, 2022
2022
Closest in time.
2022
Closest in time.
S. Huang et al. , “An automatic and efficient bert pruning for edge ai systems,” in ISQED ’22 . IEEE, 2022, pp. 1–6
2022
Closest in time.
H. Tessier et al. , “Rethinking weight decay for efficient neural network pruning,” Journal of Imaging , vol. 8, no. 3, p. 64, 2022
2022
Closest in time.
S. Huang et al. , “Sparse progressive distillation: Resolving overfitting under pretrain-and-finetune paradigm,” in ACL , 2022, pp. 190–200
2022
Closest in time.
H. Peng et al. , “A length adaptive algorithm-hardware co-design of transformer on fpga through sparse attention and dynamic pipelining,” in DAC ’22 . IEEE, 2022
2022
Closest in time.
T. Chen et al. , “Coarsening the granularity: Towards structurally sparse lottery tickets,” ICML , 2022
2022
Closest in time.
B. Chen, T. Dao, K. Liang, J. Yang, Z. Song, A. Rudra, and C. Re, “Pixelated butterfly: Simple and efficient sparse training for neural network models,” ICLR , 2022
2022
Closest in time.
X. Ma et al. , “Effective model sparsification by scheduled grow-and-prune methods,” in ICLR , 2022
2022
Closest in time.