Fetching the paper…
Reading the bibliography…
Three important properties of a classification machinery are: (i) the system preserves the core information of the input data; (ii) the training examples convey information about unseen data; and (iii) the system is able to treat differently points from different classes.
W. B. Johnson and J. Lindenstrauss, “Extensions of lipschitz mappings into a hilbert space,” in Conf. in Modern Analysis and Probability , 1984, p. 189–206
1984
Earlier work this paper cites.
K. Hornik, M. Stinchcombe, and H. White, “Multilayer feedforward networks are universal approximators,” Neural Netw. , vol. 2, no. 5, pp. 359–366, Jul. 1989
1989
Earlier work this paper cites.
G. Cybenko, “Approximation by superpositions of a sigmoidal function,” Math. Control Signals Systems , vol. 2, pp. 303–314, 1989
1989
Earlier work this paper cites.
M. Ledoux and M. Talagrand, Probability in Banach Spaces . Springer-Verlag, 1991
1991
Earlier work this paper cites.
O. Yamaguchi, K. Fukui, and K. Maeda, “Face recognition using temporal image sequence,” in IEEE Int. Conf. Automatic Face and Gesture Recognition , 1998, pp. 318–323
1998
Earlier work this paper cites.
M. Gromov, Metric Structures for Riemannian and Non-Riemannian Spaces . Birkhäuser, Boston, US, 1999
1999
Earlier work this paper cites.
L. Wolf and A. Shashua, “Learning over sets using kernel principal angles,” Journal of Machine Learning Research , vol. 4, pp. 913–931, Oct. 2003
2003
Earlier work this paper cites.
B. Klartag and S. Mendelson, “Empirical processes and random projections,” Journal of Functional Analysis , vol. 225, no. 1, pp. 229–245, Aug. 2005
2005
Earlier work this paper cites.
E. J. Candès and T. Tao, “Near-optimal signal recovery from random projections: Universal encoding strategies?” IEEE Trans. Inf. Theory , vol. 52, no. 12, pp. 5406 –5425, Dec. 2006
2006
Earlier work this paper cites.
A. Andoni and P. Indyk, “Near-optimal hashing algorithms for near neighbor problem in high dimensions,” in Proceedings of the Symposium on the Foundations of Computer Science , 2006, pp. 459–468
2006
Earlier work this paper cites.
M. Elad, “Optimized projections for compressed sensing,” IEEE Trans. Signal Process. , vol. 55, no. 12, pp. 5695–5702, Dec 2007
2007
Earlier work this paper cites.
S. Mendelson, A. Pajor, and N. Tomczak-Jaegermann, “Uniform uncertainty principle for Bernoulli and sub-Gaussian ensembles,” Constructive Approximation , vol. 28, pp. 277–289, 2008
2008
Earlier work this paper cites.
N. Pinto, D. Doukhan, J. J. DiCarlo, and D. D. Cox, “A high-throughput screening approach to discovering good forms of biologically inspired visual representation,” PLoS Comput Biol , vol. 5, no. 11, p. e1000579, 11 2009
2009
Earlier work this paper cites.
J. M. Duarte-Carvajalino and G. Sapiro, “Learning to sense sparse signals: Simultaneous sensing matrix and sparsifying dictionary optimization,” IEEE Trans. Imag. Proc. , vol. 18, no. 7, pp. 1395–1408, July 2009
2009
Earlier work this paper cites.
M. Rudelson and R. Vershynin, “Non-asymptotic theory of random matrices: extreme singular values,” in International Congress of Mathematicans , 2010
2010
Earlier work this paper cites.
V. Nair and G. E. Hinton, “Rectified linear units improve restricted boltzmann machines,” in Int. Conf. on Machine Learning (ICML) , 2010, pp. 807–814
2010
Earlier work this paper cites.
J. Haupt, W. Bajwa, G. Raz, and R. Nowak, “Toeplitz compressed sensing matrices with applications to sparse channel estimation,” IEEE Trans. Inf. Theory , vol. 56, no. 11, pp. 5862–5875, Nov. 2010
2010
Earlier work this paper cites.
F. Perronnin, J. Sánchez, and T. Mensink, “Improving the fisher kernel for large-scale image classification,” in ECCV , 2010, vol. 6314, pp. 143–156
2010
Earlier work this paper cites.
A. Saxe, P. W. Koh, Z. Chen, M. Bhand, B. Suresh, and A. Y. Ng, “On random weights and unsupervised feature learning,” in Int. Conf. on Machine Learning (ICML) , 2011, pp. 1089–1096
2011
Earlier work this paper cites.
D. Cox and N. Pinto, “Beyond simple features: A large-scale feature search approach to unconstrained face recognition,” in IEEE International Conference on Automatic Face Gesture Recognition and Workshops (FG) , March 2011, pp. 8–15
2011
Cited alongside, same era.
G.-B. Huang, D. H. Wang, and Y. Lan, “Extreme learning machines: a survey,” International Journal of Machine Learning and Cybernetics , vol. 2, no. 2, pp. 107–122, 2011
2011
Cited alongside, same era.
A. Krizhevsky, I. Sutskever, and G. E. Hinton, “Imagenet classification with deep convolutional neural networks,” in Advances in Neural Information Processing Systems (NIPS) , 2012
2012
Cited alongside, same era.
V. Chandrasekaran, B. Recht, P. A. Parrilo, and A. S. Willsky, “The convex geometry of linear inverse problems,” Foundations of Computational Mathematics , vol. 12, no. 6, pp. 805–849, 2012
2012
Cited alongside, same era.
O. Russakovsky, J. Deng, H. Su, J. Krause, S. Satheesh, S. Ma, Z. Huang, A. Karpathy, A. Khosla, M. Bernstein, A. C. Berg, and L. Fei-Fei, “ImageNet Large Scale Visual Recognition Challenge,” 2014
2014
Later among the works it cites.
A. Ai, A. Lapanowski, Y. Plan, and R. Vershynin, “One-bit compressed sensing with non-Gaussian measurements,” Linear Algebra and its Applications , vol. 441, pp. 222 – 239, 2014, special Issue on Sparse Approximate Solution of Linear Systems
2014
Later among the works it cites.
Y. Plan and R. Vershynin, “Dimension reduction by random hyperplane tessellations,” Discrete and Computational Geometry , vol. 51, no. 2, pp. 438–461, 2014
2014
Later among the works it cites.
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
V. Saligrama, “Aperiodic sequences with uniformly decaying correlations with applications to compressed sensing and system identification,” IEEE Trans. Inf. Theory , vol. 58, no. 9, pp. 6023–6036, Sept. 2012
2012
Cited alongside, same era.
H. Rauhut, J. Romberg, and J. A. Tropp, “Restricted isometries for partial random circulant matrices,” Appl. Comput. Harmon. Anal. , vol. 32, no. 2, pp. 242–254, Mar. 2012
2012
Cited alongside, same era.
Y. Bengio, A. Courville, and P. Vincent, “Representation learning: A review and new perspectives,” IEEE Trans. Pattern Anal. Mach. Intell. , vol. 35, no. 8, pp. 1798–1828, Aug. 2013
2013
Cited alongside, same era.
E. J. Candès, T. Strohmer, and V. Voroninski, “Phaselift: Exact and stable signal recovery from magnitude measurements via convex programming,” Communications on Pure and Applied Mathematics , vol. 66, no. 8, pp. 1241–1274, 2013
2013
Cited alongside, same era.
J. Bruna and S. Mallat, “Invariant scattering convolution networks,” IEEE Trans. Pattern Analysis and Machine Intelligence (TPAMI) , vol. 35, no. 8, pp. 1872–1886, Aug 2013
2013
Cited alongside, same era.
J. Bruna, Y. LeCun, and A. Szlam, “Learning stable group invariant representations with convolutional networks,” in ICLR Workshop , Jan. 2013
2013
Cited alongside, same era.
Y. Plan and R. Vershynin, “Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach,” IEEE Trans. Inf. Theory , vol. 59, no. 1, pp. 482–494, Jan. 2013
2013
Cited alongside, same era.
E. Elhamifar and R. Vidal, “Sparse subspace clustering: Algorithm, theory, and applications,” IEEE Trans. Pattern Anal. Mach. Intell. , vol. 35, no. 11, pp. 2765–2781, 2013
2013
Cited alongside, same era.
K. Chatfield, K. Simonyan, A. Vedaldi, and A. Zisserman, “Return of the devil in the details: Delving deep into convolutional nets,” in British Machine Vision Conference , 2014
2014
Later among the works it cites.
R. Gribonval, R. Jenatton, and F. Bach, “Sparse and spurious: dictionary learning with noise and outliers,” Sep. 2014. [Online]. Available: https://hal.archives-ouvertes.fr/hal-01025503
2014
Later among the works it cites.
J. Mairal, P. Koniusz, Z. Harchaoui, and C. Schmid, “Convolutional kernel networks,” in Advances in Neural Information Processing Systems (NIPS) , 2014
2014
Later among the works it cites.
2014
Later among the works it cites.
J. Schmidhuber, “Deep learning in neural networks: An overview,” Neural Networks , vol. 61, pp. 85–117, 2015
2015
Closest in time.
C. Hegde, A. C. Sankaranarayanan, W. Yin, and R. G. Baraniuk, “Numax: A convex approach for learning near-isometric linear embeddings,” IEEE Trans. Signal Proc , vol. 63, no. 22, pp. 6109–6121, Nov 2015
2015
Closest in time.
A. Choromanska, M. B. Henaff, M. Mathieu, G. B. Arous, and Y. LeCun, “The loss surfaces of multilayer networks,” in International Conference on Artificial Intelligence and Statistics (AISTATS) , 2015
2015
Closest in time.
F. Anselmi, J. Z. Leibo, L. Rosasco, J. Mutch, A. Tacchetti, and T. Poggio, “Unsupervised learning of invariant representations,” Theoretical Computer Science , 2015
2015
Closest in time.
G. F. Montúfar and J. Morton, “When does a mixture of products contain a product of mixtures?” SIAM Journal on Discrete Mathematics (SIDMA) , vol. 29, no. 1, pp. 321–347, 2015
2015
Closest in time.
A. Mahendran and A. Vedaldi, “Understanding deep image representations by inverting them,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR) , 2015
2015
Closest in time.
Q. Qiu and G. Sapiro, “Learning transformations for clustering and classification,” Journal of Machine Learning Research , vol. 16, p. 187−225, Feb. 2015
2015
Closest in time.
K. Simonyan and A. Zisserman, “Very deep convolutional networks for large-scale image recognition,” in International Conference on Learning Representations (ICLR) , 2015
2015
Closest in time.
J. Huang, Q. Qiu, G. Sapiro, and R. Calderbank, “Discriminative robust transformation learning,” in Advances in Neural Information Processing Systems (NIPS) , 2015
2015
Closest in time.
——, “Geometry-aware deep transform,” in IEEE International Conference on Computer Vision (ICCV) , 2015
2015
Closest in time.