Fetching the paper…
Reading the bibliography…
Diffusion models have become a new SOTA generative modeling method in various fields, for which there are multiple survey works that provide an overall survey.
P. Erdős, A. Rényi et al. , “On the evolution of random graphs,” Publ. Math. Inst. Hung. Acad. Sci , vol. 5, no. 1, pp. 17–60, 1960
1960
Earlier work this paper cites.
J. P. Glusker, M. Lewis, and M. Rossi, Crystal structure analysis for chemists and biologists . John Wiley & Sons, 1996, vol. 16
1996
Earlier work this paper cites.
D. J. Watts and S. H. Strogatz, “Collective dynamics of ‘small-world’networks,” nature , vol. 393, no. 6684, pp. 440–442, 1998
1998
Earlier work this paper cites.
S. Brooks, “Markov chain monte carlo method and its application,” Journal of the royal statistical society: series D (the Statistician) , vol. 47, no. 1, pp. 69–100, 1998
1998
Earlier work this paper cites.
A.-L. Barabási and R. Albert, “Emergence of scaling in random networks,” science , vol. 286, no. 5439, pp. 509–512, 1999
1999
Earlier work this paper cites.
A. C. Anderson, “The process of structure-based drug design,” Chemistry & biology , vol. 10, no. 9, pp. 787–797, 2003
2003
Earlier work this paper cites.
M.-P. Lefranc, C. Pommié, M. Ruiz, V. Giudicelli, E. Foulquier, L. Truong, V. Thouvenin-Contet, and G. Lefranc, “Imgt unique numbering for immunoglobulin and t cell receptor variable domains and ig superfamily v-like domains,” Developmental & Comparative Immunology , vol. 27, no. 1, pp. 55–77, 2003
2003
Earlier work this paper cites.
D. Chakrabarti, Y. Zhan, and C. Faloutsos, “R-mat: A recursive model for graph mining,” in Proceedings of the 2004 SIAM International Conference on Data Mining . SIAM, 2004, pp. 442–446
2004
Earlier work this paper cites.
A. Clauset, M. E. Newman, and C. Moore, “Finding community structure in very large networks,” Physical review E , vol. 70, no. 6, p. 066111, 2004
2004
Earlier work this paper cites.
J. Sun, M. Ovsjanikov, and L. Guibas, “A concise and provably informative multi-scale signature based on heat diffusion,” in Computer graphics forum , vol. 28, no. 5. Wiley Online Library, 2009, pp. 1383–1392
2009
Earlier work this paper cites.
D. L. Mobley and K. A. Dill, “Binding of small-molecule ligands to proteins:“what you see” is not always “what you get”,” Structure , vol. 17, no. 4, pp. 489–498, 2009
2009
Earlier work this paper cites.
G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski, “Pregel: a system for large-scale graph processing,” in Proceedings of the 2010 ACM SIGMOD International Conference on Management of data , 2010, pp. 135–146
2010
Earlier work this paper cites.
J. Leskovec, D. Chakrabarti, J. Kleinberg, C. Faloutsos, and Z. Ghahramani, “Kronecker graphs: an approach to modeling networks.” Journal of Machine Learning Research , vol. 11, no. 2, 2010
2010
Earlier work this paper cites.
B. North, A. Lehmann, and R. L. Dunbrack Jr, “A new clustering of antibody cdr loop conformations,” Journal of molecular biology , vol. 406, no. 2, pp. 228–256, 2011
2011
Earlier work this paper cites.
B. Karrer and M. E. Newman, “Stochastic blockmodels and community structure in networks,” Physical review E , vol. 83, no. 1, p. 016107, 2011
2011
Earlier work this paper cites.
J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin, “Powergraph: Distributed graph-parallel computation on natural graphs,” in Presented as part of the 10th { \{ USENIX } \} Symposium on Operating Systems Design and Implementation ( { \{ OSDI } \} 12) , 2012, pp. 17–30
2012
Earlier work this paper cites.
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
2013
Earlier work this paper cites.
I. Sutskever, O. Vinyals, and Q. V. Le, “Sequence to sequence learning with neural networks,” Advances in neural information processing systems , vol. 27, 2014
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
J. Dunbar, K. Krawczyk, J. Leem, T. Baker, A. Fuchs, G. Georges, J. Shi, and C. M. Deane, “Sabdab: the structural antibody database,” Nucleic acids research , vol. 42, no. D1, pp. D1140–D1146, 2014
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
D. K. Duvenaud, D. Maclaurin, J. Iparraguirre, R. Bombarell, T. Hirzel, A. Aspuru-Guzik, and R. P. Adams, “Convolutional networks on graphs for learning molecular fingerprints,” vol. 28, 2015
2015
Earlier work this paper cites.
2015
Earlier work this paper cites.
D. Rezende and S. Mohamed, “Variational inference with normalizing flows,” in International conference on machine learning . PMLR, 2015, pp. 1530–1538
2015
Earlier work this paper cites.
2015
Earlier work this paper cites.
2015
Earlier work this paper cites.
2016
Earlier work this paper cites.
Z. Yang, W. Cohen, and R. Salakhudinov, “Revisiting semi-supervised learning with graph embeddings,” in International conference on machine learning . PMLR, 2016, pp. 40–48
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
C. Doersch, “Tutorial on variational autoencoders,” arXiv preprint arXiv:1606.05908 , 2016
2016
Earlier work this paper cites.
T. N. Kipf and M. Welling, “Variational graph auto-encoders,” arXiv preprint arXiv:1611.07308 , 2016
2016
Earlier work this paper cites.
T. Salimans, I. Goodfellow, W. Zaremba, V. Cheung, A. Radford, and X. Chen, “Improved techniques for training gans,” Advances in neural information processing systems , 2016
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
D. Wang, P. Cui, and W. Zhu, “Structural deep network embedding,” in Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining , 2016, pp. 1225–1234
2016
Earlier work this paper cites.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” Advances in neural information processing systems , vol. 30, 2017
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
A. Fout, J. Byrd, B. Shariat, and A. Ben-Hur, “Protein interface prediction using graph convolutional networks,” Advances in neural information processing systems , vol. 30, 2017
2017
Earlier work this paper cites.
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.
2017
Earlier work this paper cites.
S. Reed, A. Oord, N. Kalchbrenner, S. G. Colmenarejo, Z. Wang, Y. Chen, D. Belov, and N. Freitas, “Parallel multiscale autoregressive density estimation,” in International Conference on Machine Learning . PMLR, 2017, pp. 2912–2921
2017
Earlier work this paper cites.
J. Gilmer, S. S. Schoenholz, P. F. Riley, O. Vinyals, and G. E. Dahl, “Neural message passing for quantum chemistry,” 2017, pp. 1263–1272
2017
Earlier work this paper cites.
G. Papamakarios, T. Pavlakou, and I. Murray, “Masked autoregressive flow for density estimation,” Advances in neural information processing systems , vol. 30, 2017
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
Z. Wu, B. Ramsundar, E. N. Feinberg, J. Gomes, C. Geniesse, A. S. Pappu, K. Leswing, and V. Pande, “Moleculenet: a benchmark for molecular machine learning,” Chemical science , vol. 9, no. 2, pp. 513–530, 2018
2018
Earlier work this paper cites.
M. Popova, O. Isayev, and A. Tropsha, “Deep reinforcement learning for de novo drug design,” Science advances , vol. 4, no. 7, p. eaap7885, 2018
2018
Earlier work this paper cites.
Y. Jing, Y. Bian, Z. Hu, L. Wang, and X.-Q. S. Xie, “Deep learning for drug design: an artificial intelligence paradigm for drug discovery in the big data era,” The AAPS journal , vol. 20, pp. 1–10, 2018
2018
Earlier work this paper cites.
J. You, R. Ying, X. Ren, W. Hamilton, and J. Leskovec, “Graphrnn: Generating realistic graphs with deep auto-regressive models,” in International conference on machine learning . PMLR, 2018, pp. 5708–5717
2018
Cited alongside, same era.
M. Simonovsky and N. Komodakis, “Graphvae: Towards generation of small graphs using variational autoencoders,” in International conference on artificial neural networks . Springer, 2018, pp. 412–422
2018
Cited alongside, same era.
2018
Cited alongside, same era.
A. Bojchevski, O. Shchur, D. Zügner, and S. Günnemann, “Netgan: Generating graphs via random walks,” in International conference on machine learning . PMLR, 2018, pp. 610–619
2018
Cited alongside, same era.
H. Dai, A. Nazi, Y. Li, B. Dai, and D. Schuurmans, “Scalable deep generative modeling for sparse graphs,” in International Conference on Machine Learning . PMLR, 2020, pp. 2302–2312
2020
Later among the works it cites.
2020
Later among the works it cites.
W. P. Walters and R. Barzilay, “Applications of deep learning in molecule generation and molecular property prediction,” Accounts of chemical research , vol. 54, no. 2, pp. 263–270, 2020
2020
Later among the works it cites.
A. W. Senior, R. Evans, J. Jumper, J. Kirkpatrick, L. Sifre, T. Green, C. Qin, A. Žídek, A. W. Nelson, A. Bridgland et al. , “Improved protein structure prediction using potentials from deep learning,” Nature , vol. 577, no. 7792, pp. 706–710, 2020
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. Ying, R. He, K. Chen, P. Eksombatchai, W. L. Hamilton, and J. Leskovec, “Graph convolutional neural networks for web-scale recommender systems,” in Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining , 2018, pp. 974–983
2018
Cited alongside, same era.
T. D. Bui, S. Ravi, and V. Ramavajjala, “Neural graph learning: Training neural networks using graphs,” in Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining , 2018, pp. 64–71
2018
Cited alongside, same era.
J. You, B. Liu, Z. Ying, V. Pande, and J. Leskovec, “Graph convolutional policy network for goal-directed molecular graph generation,” Advances in neural information processing systems , vol. 31, 2018
2018
Cited alongside, same era.
T. Ma, J. Chen, and C. Xiao, “Constrained generation of semantically valid graphs via regularizing variational autoencoders,” Advances in Neural Information Processing Systems , vol. 31, 2018
2018
Cited alongside, same era.
Q. Liu, M. Allamanis, M. Brockschmidt, and A. Gaunt, “Constrained graph variational autoencoders for molecule design,” Advances in neural information processing systems , vol. 31, 2018
2018
Cited alongside, same era.
W. Jin, R. Barzilay, and T. Jaakkola, “Junction tree variational autoencoder for molecular graph generation,” 2018, pp. 2323–2332
2018
Cited alongside, same era.
A. Creswell, T. White, V. Dumoulin, K. Arulkumaran, B. Sengupta, and A. A. Bharath, “Generative adversarial networks: An overview,” IEEE signal processing magazine , vol. 35, no. 1, pp. 53–65, 2018
2018
Cited alongside, same era.
2018
Cited alongside, same era.
J. Yang, I. Anishchenko, H. Park, Z. Peng, S. Ovchinnikov, and D. Baker, “Improved protein structure prediction using predicted interresidue orientations,” Proceedings of the National Academy of Sciences , vol. 117, no. 3, pp. 1496–1503, 2020
2020
Later among the works it cites.
J. Zhou, G. Cui, S. Hu, Z. Zhang, C. Yang, Z. Liu, L. Wang, C. Li, and M. Sun, “Graph neural networks: A review of methods and applications,” AI Open , vol. 1, pp. 57–81, 2020
2020
Later among the works it cites.
Y. Luo, K. Yan, and S. Ji, “Graphdf: A discrete flow model for molecular graph generation,” in International Conference on Machine Learning . PMLR, 2021, pp. 7192–7203
2021
Later among the works it cites.
2021
Later among the works it cites.
P. Dhariwal and A. Nichol, “Diffusion models beat gans on image synthesis,” vol. 34, 2021, pp. 8780–8794
2021
Later among the works it cites.
V. G. Satorras, E. Hoogeboom, and M. Welling, “E (n) equivariant graph neural networks,” in International conference on machine learning . PMLR, 2021, pp. 9323–9332
2021
Later among the works it cites.
C. Shi, S. Luo, M. Xu, and J. Tang, “Learning gradient fields for molecular conformation generation,” 2021, pp. 9558–9568
2021
Later among the works it cites.
K. Atz, F. Grisoni, and G. Schneider, “Geometric deep learning on molecular representations,” Nature Machine Intelligence , vol. 3, no. 12, pp. 1023–1032, 2021
2021
Later among the works it cites.
2021
Later among the works it cites.
S. Luo, C. Shi, M. Xu, and J. Tang, “Predicting molecular conformation via dynamic graph score matching,” vol. 34, 2021, pp. 19 784–19 795
2021
Later among the works it cites.
J. Jumper, R. Evans, A. Pritzel, T. Green, M. Figurnov, O. Ronneberger, K. Tunyasuvunakool, R. Bates, A. Žídek, A. Potapenko et al. , “Highly accurate protein structure prediction with alphafold,” Nature , vol. 596, no. 7873, pp. 583–589, 2021
2021
Later among the works it cites.
A. Rives, J. Meier, T. Sercu, S. Goyal, Z. Lin, J. Liu, D. Guo, M. Ott, C. L. Zitnick, J. Ma et al. , “Biological structure and function emerge from scaling unsupervised learning to 250 million protein sequences,” Proceedings of the National Academy of Sciences , vol. 118, no. 15, p. e2016239118, 2021
2021
Later among the works it cites.
2021
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
S. Luo, Y. Su, X. Peng, S. Wang, J. Peng, and J. Ma, “Antigen-specific antibody design and optimization with diffusion-based generative models,” bioRxiv , 2022
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
E. Hoogeboom, V. G. Satorras, C. Vignac, and M. Welling, “Equivariant diffusion for molecule generation in 3d,” in ICML . PMLR, 2022, pp. 8867–8887
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
2022
Later among the works it cites.
2023
Closest in time.
2023
Closest in time.
2023
Closest in time.
C. Zhang, C. Zhang, C. Li, S. Zheng, Y. Qiao, S. K. Dam, M. Zhang, J. U. Kim, S. T. Kim, G.-M. Park, J. Choi, S.-H. Bae, L.-H. Lee, P. Hui, I. S. Kweon, and C. S. Hong, “One small step for generative ai, one giant leap for agi: A complete survey on chatgpt in aigc era,” researchgate DOI:10.13140/RG.2.2.24789.70883 , 2023
2023
Closest in time.
2023
Closest in time.
X. Wang, H. Ji, C. Shi, B. Wang, Y. Ye, P. Cui, and P. S. Yu, “Heterogeneous graph attention network,” in The world wide web conference , 2019, pp. 2022–2032
2032
Closest in time.