Fetching the paper…
Reading the bibliography…
Many scientific fields study data with an underlying structure that is a non-Euclidean space.
J. Nash, “The imbedding problem for Riemannian manifolds,” Annals of Mathematics , vol. 63, no. 1, pp. 20–63, 1956
1956
Earlier work this paper cites.
H. L. Morgan, “The generation of a unique machine description for chemical structure,” J. Chemical Documentation , vol. 5, no. 2, pp. 107–113, 1965
1965
Earlier work this paper cites.
D. J. Field, “What the statistics of natural images tell us about visual coding,” in Proc. SPIE , 1989
1989
Earlier work this paper cites.
Y. LeCun, B. Boser, J. S. Denker, D. Henderson, R. E. Howard, W. Hubbard, and L. D. Jackel, “Backpropagation applied to handwritten ZIP code recognition,” Neural Computation , vol. 1, no. 4, pp. 541–551, 1989
1989
Earlier work this paper cites.
U. Pinkall and K. Polthier, “Computing discrete minimal surfaces and their conjugates,” Experimental Mathematics , vol. 2, no. 1, pp. 15–36, 1993
1993
Earlier work this paper cites.
S. Rosenberg, The Laplacian on a Riemannian manifold: an introduction to analysis on manifolds . Cambridge University Press, 1997
1997
Earlier work this paper cites.
S. Mallat, A wavelet tour of signal processing . Academic Press, 1999
1999
Earlier work this paper cites.
J. B. Tenenbaum, V. De Silva, and J. C. Langford, “A global geometric framework for nonlinear dimensionality reduction,” Science , vol. 290, no. 5500, pp. 2319–2323, 2000
2000
Earlier work this paper cites.
S. T. Roweis and L. K. Saul, “Nonlinear dimensionality reduction by locally linear embedding,” Science , vol. 290, no. 5500, pp. 2323–2326, 2000
2000
Earlier work this paper cites.
E. P. Simoncelli and B. A. Olshausen, “Natural image statistics and neural representation,” Annual Review of Neuroscience , vol. 24, no. 1, pp. 1193–1216, 2001
2001
Earlier work this paper cites.
E. H. Davidson et al. , “A genomic regulatory network for development,” Science , vol. 295, no. 5560, pp. 1669–1678, 2002
2002
Earlier work this paper cites.
R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon, “Network motifs: simple building blocks of complex networks,” Science , vol. 298, no. 5594, pp. 824–827, 2002
2002
Earlier work this paper cites.
M. Belkin and P. Niyogi, “Laplacian eigenmaps for dimensionality reduction and data representation,” Neural Computation , vol. 15, no. 6, pp. 1373–1396, 2003
2003
Earlier work this paper cites.
M. B. Wakin, D. L. Donoho, H. Choi, and R. G. Baraniuk, “The multiscale structure of non-differentiable image manifolds,” in Proc. SPIE , 2005
2005
Earlier work this paper cites.
M. Gori, G. Monfardini, and F. Scarselli, “A new model for learning in graph domains,” in Proc. IJCNN , 2005
2005
Earlier work this paper cites.
A. D. Szlam, M. Maggioni, R. R. Coifman, and J. C. BremerJr, “Diffusion-driven multiscale analysis on manifolds and graphs: top-down and bottom-up constructions,” in Optics & Photonics 2005 . International Society for Optics and Photonics, 2005, pp. 59 141D–59 141D
2005
Earlier work this paper cites.
R. R. Coifman and S. Lafon, “Diffusion maps,” App. and Comp. Harmonic Analysis , vol. 21, no. 1, pp. 5–30, 2006
2006
Earlier work this paper cites.
R. Hadsell, S. Chopra, and Y. LeCun, “Dimensionality reduction by learning an invariant mapping,” in Proc. CVPR , 2006
2006
Earlier work this paper cites.
R. R. Coifman and M. Maggioni, “Diffusion wavelets,” App. and Comp. Harmonic Analysis , vol. 21, no. 1, pp. 53–94, 2006
2006
Earlier work this paper cites.
A. M. Bronstein, M. M. Bronstein, and R. Kimmel, “Generalized multidimensional scaling: a framework for isometry-invariant partial surface matching,” PNAS , vol. 103, no. 5, pp. 1168–1172, 2006
2006
Earlier work this paper cites.
R. C. Glem, A. Bender, C. H. Arnby, L. Carlsson, S. Boyer, and J. Smith, “The generation of a unique machine description for chemical structure,” Investigational Drugs , vol. 9, no. 3, pp. 199–204, 2006
2006
Earlier work this paper cites.
N. Pržulj, “Biological network comparison using graphlet degree distribution,” Bioinformatics , vol. 23, no. 2, pp. 177–183, 2007
2007
Earlier work this paper cites.
M. Wardetzky, S. Mathur, F. Kälberer, and E. Grinspun, “Discrete laplace operators: no free lunch,” in Proc. SGP , 2007
2007
Earlier work this paper cites.
U. Von Luxburg, “A tutorial on spectral clustering,” Statistics and Computing , vol. 17, no. 4, pp. 395–416, 2007
2007
Earlier work this paper cites.
L. Maaten and G. Hinton, “Visualizing data using t-SNE,” JMLR , vol. 9, pp. 2579–2605, 2008
2008
Earlier work this paper cites.
M. Wardetzky, “Convergence of the cotangent formula: An overview,” in Discrete Differential Geometry , 2008, pp. 275–286
2008
Earlier work this paper cites.
N. L. Roux, Y. Bengio, P. Lamblin, M. Joliveau, and B. Kégl, “Learning the 2-d topology of images,” in Proc. NIPS , 2008
2008
Earlier work this paper cites.
P. Sen, G. Namata, M. Bilgic, L. Getoor, B. Galligher, and T. Eliassi-Rad, “Collective classification in network data,” AI Magazine , vol. 29, no. 3, p. 93, 2008
2008
Earlier work this paper cites.
D. Lazer et al. , “Life in the network: the coming age of computational social science,” Science , vol. 323, no. 5915, p. 721, 2009
2009
Earlier work this paper cites.
N. Verma, S. Kpotufe, and S. Dasgupta, “Which spatial partition trees are adaptive to intrinsic dimension?” in Proc. Uncertainty in Artificial Intelligence , 2009
2009
Earlier work this paper cites.
J. Sun, M. Ovsjanikov, and L. J. Guibas, “A concise and provably informative multi-scale signature based on heat diffusion,” Computer Graphics Forum , vol. 28, no. 5, pp. 1383–1392, 2009
2009
Earlier work this paper cites.
F. Scarselli, M. Gori, A. C. Tsoi, M. Hagenbuchner, and G. Monfardini, “The graph neural network model,” IEEE Trans. Neural Networks , vol. 20, no. 1, pp. 61–80, 2009
2009
Earlier work this paper cites.
Y. Koren, R. Bell, and C. Volinsky, “Matrix factorization techniques for recommender systems,” Computer , vol. 42, no. 8, pp. 30–37, 2009
2009
Earlier work this paper cites.
Y. LeCun, K. Kavukcuoglu, and C. Farabet, “Convolutional networks and applications in vision,” in Proc. ISCAS , 2010
2010
Earlier work this paper cites.
S. Fortunato, “Community detection in graphs,” Physics Reports , vol. 486, no. 3, pp. 75–174, 2010
2010
Earlier work this paper cites.
P. F. Felzenszwalb, R. B. Girshick, D. McAllester, and D. Ramanan, “Object detection with discriminatively trained part-based models,” Trans. PAMI , vol. 32, no. 9, pp. 1627–1645, 2010
2010
Earlier work this paper cites.
M. Gavish, B. Nadler, and R. R. Coifman, “Multiscale wavelets on trees, graphs and high dimensional data: Theory and applications to semi supervised learning,” in Proc. ICML , 2010
2010
Earlier work this paper cites.
K. Gregor and Y. LeCun, “Learning fast approximations of sparse coding,” in Proc. ICML , 2010
2010
Earlier work this paper cites.
M. M. Bronstein and I. Kokkinos, “Scale-invariant heat kernel signatures for non-rigid shape recognition,” in Proc. CVPR , 2010
2010
Earlier work this paper cites.
F. Tombari, S. Salti, and L. Di Stefano, “Unique signatures of histograms for local surface description,” in Proc. ECCV , 2010
2010
Earlier work this paper cites.
D. Rogers and M. Hahn, “Extended-connectivity fingerprints,” J. Chemical Information and Modeling , vol. 50, no. 5, pp. 742–754, 2010
2010
Earlier work this paper cites.
T. Mikolov, A. Deoras, D. Povey, L. Burget, and J. Černockỳ, “Strategies for training large scale neural network language models,” in Proc. ASRU , 2011, pp. 196–201
2011
Cited alongside, same era.
D. Cireşan, U. Meier, J. Masci, and J. Schmidhuber, “A committee of neural networks for traffic sign classification,” in Proc. IJCNN , 2011
2011
Cited alongside, same era.
E. Cho, S. A. Myers, and J. Leskovec, “Friendship and mobility: user movement in location-based social networks,” in Proc. KDD , 2011
2011
Cited alongside, same era.
A. Coates and A. Y. Ng, “Selecting receptive fields in deep networks,” in Proc. NIPS , 2011
2011
Cited alongside, same era.
H. Ma, D. Zhou, C. Liu, M. Lyu, and I. King, “Recommender systems with social regularization,” in Proc. Web Search and Data Mining , 2011
2011
Cited alongside, same era.
A. Choromanska, M. Henaff, M. Mathieu, G. B. Arous, and Y. LeCun, “The loss surfaces of multilayer networks,” in Proc. AISTATS , 2015
2015
Later among the works it cites.
2015
Later among the works it cites.
2015
Later among the works it cites.
L.-H. Lim, “Hodge Laplacians on graphs,” arXiv:1507.05379 , 2015
2015
Later among the works it cites.
D. Eynard, A. Kovnatsky, M. M. Bronstein, K. Glashoff, and A. M. Bronstein, “Multimodal manifold analysis by simultaneous diagonalization of Laplacians,” Trans. PAMI , vol. 37, no. 12, pp. 2505–2517, 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
V. Kim, Y. Lipman, and T. Funkhouser, “Blended intrinsic maps,” ACM Trans. Graphics , vol. 30, no. 4, p. 79, 2011
2011
Cited alongside, same era.
A. M. Bronstein, M. M. Bronstein, L. J. Guibas, and M. Ovsjanikov, “ShapeGoogle: Geometric words and expressions for invariant shape retrieval,” ACM Trans. Graphics , vol. 30, no. 1, p. 1, 2011
2011
Cited alongside, same era.
G. Hinton, L. Deng, D. Yu, G. E. Dahl, A. Mohamed, N. Jaitly, A. Senior, V. Vanhoucke, P. Nguyen, and T. N. Sainath, “Deep neural networks for acoustic modeling in speech recognition: The shared views of four research groups,” IEEE Sig. Proc. Magazine , vol. 29, no. 6, pp. 82–97, 2012
2012
Cited alongside, same era.
A. Krizhevsky, I. Sutskever, and G. Hinton, “Imagenet classification with deep convolutional neural networks,” in Proc. NIPS , 2012
2012
Cited alongside, same era.
S. Mallat, “Group invariant scattering,” Communications on Pure and Applied Mathematics , vol. 65, no. 10, pp. 1331–1398, 2012
2012
Cited alongside, same era.
E. Candès and B. Recht, “Exact matrix completion via convex optimization,” Commu. ACM , vol. 55, no. 6, pp. 111–119, 2012
2012
Cited alongside, same era.
M. Ovsjanikov, M. Ben-Chen, J. Solomon, A. Butscher, and L. J. Guibas, “Functional maps: a flexible representation of maps between shapes,” ACM Trans. Graphics , vol. 31, no. 4, p. 30, 2012
2012
Cited alongside, same era.
2015
Later among the works it cites.
D. Boscaini, J. Masci, S. Melzi, M. M. Bronstein, U. Castellani, and P. Vandergheynst, “Learning class-specific descriptors for deformable shapes using localized spectral convolutional networks,” in Computer Graphics Forum , vol. 34, no. 5, 2015, pp. 13–23
2015
Later among the works it cites.
N. Rao, H.-F. Yu, P. K. Ravikumar, and I. S. Dhillon, “Collaborative filtering with graph information: Consistency and scalable methods,” in Proc. NIPS , 2015
2015
Later among the works it cites.
H. Su, S. Maji, E. Kalogerakis, and E. Learned-Miller, “Multi-view convolutional neural networks for 3D shape recognition,” in Proc. ICCV , 2015
2015
Later among the works it cites.
Z. Wu, S. Song, A. Khosla, F. Yu, L. Zhang, X. Tang, and J. Xiao, “3D shapenets: A deep representation for volumetric shapes,” in Proc. CVPR , 2015
2015
Later among the works it cites.
S. Biasotti, A. Cerri, A. M. Bronstein, and M. M. Bronstein, “Recent trends, applications, and perspectives in 3D shape similarity assessment,” in Computer Graphics Forum , 2015
2015
Later among the works it cites.
M. Jaderberg, K. Simonyan, A. Zisserman, and K. Kavukcuoglu, “Spatial transformer networks,” in Proc. NIPS , 2015
2015
Later among the works it cites.
A. Dosovitskiy, J. Springenberg, M. Tatarchenko, and T. Brox, “Learning to generate chairs, tables and cars with convolutional networks,” in Proc. CVPR , 2015
2015
Later among the works it cites.
D. Boscaini, D. Eynard, D. Kourounis, and M. M. Bronstein, “Shape-from-operator: Recovering shapes from intrinsic operators,” in Computer Graphics Forum , vol. 34, no. 2, 2015, pp. 265–274
2015
Later among the works it cites.
I. Goodfellow, Y. Bengio, and A. Courville, Deep Learning . MIT Press, 2016, in preparation
2016
Closest in time.
M. Tygert, J. Bruna, S. Chintala, Y. LeCun, S. Piantino, and A. Szlam, “A mathematical motivation for complex-valued convolutional networks,” Neural Computation , 2016
2016
Closest in time.
M. Defferrard, X. Bresson, and P. Vandergheynst, “Convolutional neural networks on graphs with fast localized spectral filtering,” in Proc. NIPS , 2016
2016
Closest in time.
J. Atwood and D. Towsley, “Diffusion-convolutional neural networks,” arXiv:1511.02136v2 , 2016
2016
Closest in time.
D. Boscaini, J. Masci, E. Rodolà, and M. M. Bronstein, “Learning shape correspondence with anisotropic convolutional neural networks,” in Proc. NIPS , 2016
2016
Closest in time.
2016
Closest in time.
D. Boscaini, J. Masci, E. Rodolà, M. M. Bronstein, and D. Cremers, “Anisotropic diffusion descriptors,” in Computer Graphics Forum , vol. 35, no. 2, 2016, pp. 431–441
2016
Closest in time.
S. Mallat, “Understanding deep convolutional networks,” Phil. Trans. R. Soc. A , vol. 374, no. 2065, 2016
2016
Closest in time.
K. Kawaguchi, “Deep learning without poor local minima,” in Proc. NIPS , 2016
2016
Closest in time.
2016
Closest in time.
M. B. Chang, T. Ullman, A. Torralba, and J. B. Tenenbaum, “A compositional object-based approach to learning physical dynamics,” 2016
2016
Closest in time.
P. Battaglia, R. Pascanu, M. Lai, D. Jimenez Rezende, and K. Kavukcuoglu, “Interaction networks for learning about objects, relations and physics,” in Proc. NIPS , 2016
2016
Closest in time.
D. I. Shuman, B. Ricaud, and P. Vandergheynst, “Vertex-frequency analysis on graphs,” App. and Comp. Harmonic Analysis , vol. 40, no. 2, pp. 260–291, 2016
2016
Closest in time.
X. Cheng, X. Chen, and S. Mallat, “Deep Haar scattering networks,” Information and Inference , vol. 5, pp. 105–133, 2016
2016
Closest in time.
2016
Closest in time.
L. Wei, Q. Huang, D. Ceylan, E. Vouga, and H. Li, “Dense human body correspondences using convolutional networks,” in Proc. CVPR , 2016
2016
Closest in time.
C. R. Qi, H. Su, M. Nießner, A. Dai, M. Yan, and L. J. Guibas, “Volumetric and multi-view CNNs for object classification on 3D data,” in Proc. CVPR , 2016
2016
Closest in time.
P. Battaglia, R. Pascanu, M. Lai, D. J. Rezende et al. , “Interaction networks for learning about objects, relations and physics,” in Proc. NIPS , 2016
2016
Closest in time.
2016
Closest in time.
M. G. Preti, T. A. Bolton, and D. Van De Ville, “The dynamic functional connectome: State-of-the-art and perspectives,” NeuroImage , 2016
2016
Closest in time.
2016
Closest in time.
F. Monti, D. Boscaini, J. Masci, E. Rodolà, J. Svoboda, and M. M. Bronstein, “Geometric deep learning on graphs and manifolds using mixture model CNNs,” in Proc. CVPR , 2017
2017
Closest in time.
2017
Closest in time.
C. D. Freeman and J. Bruna, “Topology and geometry of half-rectified network optimization,” ICLR , 2017
2017
Closest in time.
2017
Closest in time.
2017
Closest in time.
L. Yi, H. Su, X. Guo, and L. J. Guibas, “SyncSpecCNN: Synchronized spectral CNN for 3D shape segmentation,” in Proc. CVPR , 2017
2017
Closest in time.