Fetching the paper…
Reading the bibliography…
Continual graph learning (CGL) is purposed to continuously update a graph model with graph data being fed in a streaming manner.
A. McCallum, K. Nigam, J. Rennie, and K. Seymore, “Automating the construction of internet portals with machine learning,” Inf. Retr. , 2000
2000
Earlier work this paper cites.
L. Van der Maaten and G. Hinton, “Visualizing data using t-sne.” JMLR , 2008
2008
Earlier work this paper cites.
Y. Chen, M. Welling, and A. J. Smola, “Super-samples from kernel herding,” in UAI , 2010
2010
Earlier work this paper cites.
Z. Wang and J. Ye, “Querying discriminative and representative samples for batch mode active learning,” in KDD , 2013
2013
Earlier work this paper cites.
2016
Earlier work this paper cites.
Y. Li, D. Tarlow, M. Brockschmidt, and R. S. Zemel, “Gated graph sequence neural networks,” in ICLR , 2016
2016
Earlier work this paper cites.
W. L. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in NeurIPS , 2017
2017
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Semi-supervised classification with graph convolutional networks,” in ICLR , 2017
2017
Earlier work this paper cites.
D. Lopez-Paz and M. Ranzato, “Gradient episodic memory for continual learning,” in NeurIPS , 2017
2017
Earlier work this paper cites.
A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, L. Kaiser, and I. Polosukhin, “Attention is all you need,” in NeurIPS , 2017
2017
Earlier work this paper cites.
R. Aljundi, F. Babiloni, M. Elhoseiny, M. Rohrbach, and T. Tuytelaars, “Memory aware synapses: Learning what (not) to forget,” in ECCV , 2018
2018
Earlier work this paper cites.
Z. Li and D. Hoiem, “Learning without forgetting,” TPAMI , 2018
2018
Earlier work this paper cites.
O. Sener and S. Savarese, “Active learning for convolutional neural networks: A core-set approach,” in ICLR , 2018
2018
Earlier work this paper cites.
P. Velickovic, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio, “Graph attention networks,” in ICLR , 2018
2018
Earlier work this paper cites.
2018
Earlier work this paper cites.
F. Wu, A. H. S. Jr., T. Zhang, C. Fifty, T. Yu, and K. Q. Weinberger, “Simplifying graph convolutional networks,” in ICML , 2019
2019
Cited alongside, same era.
K. Xu, W. Hu, J. Leskovec, and S. Jegelka, “How powerful are graph neural networks?” in ICLR , 2019
2019
Cited alongside, same era.
W. Hu, M. Fey, M. Zitnik, Y. Dong, H. Ren, B. Liu, M. Catasta, and J. Leskovec, “Open graph benchmark: Datasets for machine learning on graphs,” in NeurIPS , 2020
2020
Cited alongside, same era.
W. Masarczyk and I. Tautkute, “Reducing catastrophic forgetting with learning on synthetic data,” in CVPR Workshop , 2020
2020
Cited alongside, same era.
R. Qiu, H. Yin, Z. Huang, and T. Chen, “GAG: global attributed graph neural network for streaming session-based recommendation,” in SIGIR , 2020
2020
Cited alongside, same era.
2022
Later among the works it cites.
2022
Later among the works it cites.
M. Sangermano, A. Carta, A. Cossu, and D. Bacciu, “Sample condensation in online continual learning,” in IJCNN , 2022
2022
Later among the works it cites.
K. Wang, B. Zhao, X. Peng, Z. Zhu, S. Yang, S. Wang, G. Huang, H. Bilen, X. Wang, and Y. You, “CAFE: learning to condense dataset by aligning features,” in CVPR , 2022
2022
Later among the works it cites.
X. Zhang, D. Song, and D. Tao, “Cglb: Benchmark tasks for continual graph learning,” in NeurIPS Systems Datasets and Benchmarks Track , 2022
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Y. Xu, Y. Zhang, W. Guo, H. Guo, R. Tang, and M. Coates, “Graphsail: Graph structure aware incremental learning for recommender systems,” in CIKM , 2020
2020
Cited alongside, same era.
A. A. Daruna, M. Gupta, M. Sridharan, and S. Chernova, “Continual learning of knowledge graph embeddings,” IEEE Robotics Autom. Lett. , 2021
2021
Cited alongside, same era.
H. Liu, Y. Yang, and X. Wang, “Overcoming catastrophic forgetting in graph neural networks,” in AAAI , 2021
2021
Cited alongside, same era.
A. Rosasco, A. Carta, A. Cossu, V. Lomonaco, and D. Bacciu, “Distilled replay: Overcoming forgetting through synthetic samples,” in Continual Semi-Supervised Learning - First International Workshop, CSSL , 2021
2021
Cited alongside, same era.
F. Wiewel and B. Yang, “Condensed composite memory continual learning,” in IJCNN , 2021
2021
Cited alongside, same era.
B. Zhao and H. Bilen, “Dataset condensation with differentiable siamese augmentation,” in ICML , 2021
2021
Cited alongside, same era.
B. Zhao, K. R. Mopuri, and H. Bilen, “Dataset condensation with gradient matching,” in ICLR , 2021
2021
Cited alongside, same era.
2022
Later among the works it cites.
——, “Sparsified subgraph memory for continual graph representation learning,” in ICDM , 2022
2022
Later among the works it cites.
G. Cazenavette, T. Wang, A. Torralba, A. A. Efros, and J. Zhu, “Generalizing dataset distillation via deep generative prior,” in CVPR , 2023
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
——, “Hierarchical prototype networks for continual graph representation learning,” TPAMI , 2023
2023
Closest in time.
——, “Sufficient subgraph embedding memory for continual graph representation learning,” 2023. [Online]. Available: https://openreview.net/forum?id=SJjvXfape5U
2023
Closest in time.
——, “Dataset condensation with distribution matching,” in WACV , 2023
2023
Closest in time.