Fetching the paper…
Reading the bibliography…
Constant-curvature Riemannian manifolds (CCMs) have been shown to be ideal embedding spaces in many application domains, as their non-Euclidean geometry can naturally account for some relevant properties of data, like hierarchy and circularity.
Grammar variational autoencoder,
M. J. Kusner, B. Paige, J. M. Hernández-Lobato, · 1954
Earlier work this paper cites.
N. I. Fisher, T. Lewis, B. J. Embleton, Statistical analysis of spherical data, Cambridge university press, 1993
1993
Earlier work this paper cites.
On the quantitative analysis of deep belief networks,
R. Salakhutdinov, I. Murray, · 2008
Earlier work this paper cites.
Auto-encoding variational bayes,
D. P. Kingma, M. Welling, · 2013
Earlier work this paper cites.
Spherical and hyperbolic Embeddings of data,
R. C. Wilson, E. R. Hancock, E. Pȩkalska, R. P. W. Duin, · 2014
Earlier work this paper cites.
Generative adversarial nets,
I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, Y. Bengio, · 2014
Earlier work this paper cites.
Semi-supervised learning with deep generative models,
D. P. Kingma, S. Mohamed, D. J. Rezende, M. Welling, · 2014
Earlier work this paper cites.
A Dirichlet process mixture model for spherical data,
J. Straub, J. Chang, O. Freifeld, J. Fisher III, · 2015
Earlier work this paper cites.
Adversarial autoencoders,
A. Makhzani, J. Shlens, N. Jaitly, I. Goodfellow, · 2016
Earlier work this paper cites.
Variational graph auto-encoders,
T. N. Kipf, M. Welling, · 2016
Earlier work this paper cites.
Gated graph sequence neural networks,
Y. Li, D. Tarlow, M. Brockschmidt, R. Zemel, · 2016
Cited alongside, same era.
Poincaré embeddings for learning hierarchical representations,
M. Nickel, D. Kiela, · 2017
Cited alongside, same era.
Geometric deep learning: Going beyond Euclidean data,
M. M. Bronstein, J. Bruna, Y. LeCun, A. Szlam, P. Vandergheynst, · 2017
Cited alongside, same era.
Latent space oddity: on the curvature of deep generative models,
G. Arvanitidis, L. K. Hansen, S. Hauberg, · 2017
Cited alongside, same era.
Semi-supervised classification with graph convolutional networks,
T. N. Kipf, M. Welling, · 2017
Cited alongside, same era.
Dynamic edge-conditioned filters in convolutional neural networks on graphs,
M. Simonovsky, N. Komodakis, · 2017
E. O. Korman, · 2018
Closest in time.
The riemannian geometry of deep generative models,
H. Shao, A. Kumar, P. Thomas Fletcher, · 2018
Closest in time.
Spherical latent spaces for stable variational autoencoders,
J. Xu, G. Durrett, · 2018
Closest in time.
Anomaly and change detection in graph streams through constant-curvature manifold embeddings,
D. Zambon, L. Livi, C. Alippi, · 2018
Closest in time.
GraphVAE: Towards generation of small graphs using variational autoencoders,
M. Simonovsky, N. Komodakis, · 2018
Closest in time.
Molgan: An implicit generative model for small molecular graphs,
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Hyperspherical variational auto-encoders,
T. R. Davidson, L. Falorsi, N. De Cao, T. Kipf, J. M. Tomczak, · 2018
Cited alongside, same era.
Hyperbolic neural networks,
O. Ganea, G. Bécigneul, T. Hofmann, · 2018
Cited alongside, same era.
Hyperbolic attention networks,
C. Gulcehre, M. Denil, M. Malinowski, A. Razavi, R. Pascanu, K. M. Hermann, P. Battaglia, V. Bapst, D. Raposo, A. Santoro, et al., · 2018
Cited alongside, same era.
Change detection in graph streams by learning graph embeddings on constant-curvature manifolds,
D. Grattarola, D. Zambon, C. Alippi, L. Livi, · 2018
Cited alongside, same era.
N. De Cao, T. Kipf, · 2018
Closest in time.
Nevae: A deep generative model for molecular graphs,
B. Samanta, A. De, G. Jana, P. K. Chattaraj, N. Ganguly, M. Gomez-Rodriguez, · 2018
Closest in time.
Automatic chemical design using a data-driven continuous representation of molecules,
R. Gómez-Bombarelli, J. N. Wei, D. Duvenaud, J. M. Hernández-Lobato, B. Sánchez-Lengeling, D. Sheberla, J. Aguilera-Iparraguirre, T. D. Hirzel, R. P. Adams, A. Aspuru-Guzik, · 2018
Closest in time.
Finding matches in a haystack: A max-pooling strategy for graph matching in the presence of outliers,
M. Cho, J. Sun, O. Duchenne, J. Ponce, · 2090
Closest in time.