暂无分享,去创建一个
[1] David P. Woodruff,et al. Optimal Approximate Matrix Product in Terms of Stable Rank , 2015, ICALP.
[2] Sören Sonnenburg,et al. COFFIN: A Computational Framework for Linear SVMs , 2010, ICML.
[3] Alex Gittens,et al. The spectral norm error of the naive Nystrom extension , 2011, ArXiv.
[4] Christos Boutsidis,et al. Random Projections for Support Vector Machines , 2012, AISTATS.
[5] Francis R. Bach,et al. Sharp analysis of low-rank kernel matrix approximations , 2012, COLT.
[6] Michael W. Mahoney,et al. Fast Randomized Kernel Ridge Regression with Statistical Guarantees , 2015, NIPS.
[7] Rong Jin,et al. Random Projections for Classification: A Recovery Approach , 2014, IEEE Transactions on Information Theory.
[8] Avrim Blum,et al. Random Projection, Margins, Kernels, and Feature-Selection , 2005, SLSFS.
[9] Martin J. Wainwright,et al. Randomized sketches of convex programs with sharp guarantees , 2014, 2014 IEEE International Symposium on Information Theory.
[10] Daniel M. Kane,et al. Sparser Johnson-Lindenstrauss Transforms , 2010, JACM.
[11] Vladimir N. Vapnik,et al. The Nature of Statistical Learning Theory , 2000, Statistics for Engineering and Information Science.
[12] Vladimir Vapnik,et al. Statistical learning theory , 1998 .
[13] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[14] Rong Jin,et al. Theory of Dual-sparse Regularized Randomized Reduction , 2015, ICML.
[15] Michael W. Mahoney,et al. Revisiting the Nystrom Method for Improved Large-scale Machine Learning , 2013, J. Mach. Learn. Res..
[16] Nathan Srebro,et al. Fast Rates for Regularized Objectives , 2008, NIPS.
[17] Anton van den Hengel,et al. Is margin preserved after random projection? , 2012, ICML.
[18] Rong Jin,et al. Improved Bounds for the Nyström Method With Application to Kernel Classification , 2011, IEEE Transactions on Information Theory.
[19] Nathan Halko,et al. Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions , 2009, SIAM Rev..
[20] Ohad Shamir,et al. Attribute Efficient Linear Regression with Distribution-Dependent Sampling , 2015, ICML.
[21] Christos Boutsidis,et al. Improved Matrix Algorithms via the Subsampled Randomized Hadamard Transform , 2012, SIAM J. Matrix Anal. Appl..
[22] Gábor Lugosi,et al. Introduction to Statistical Learning Theory , 2004, Advanced Lectures on Machine Learning.
[23] Huy L. Nguyen,et al. OSNAP: Faster Numerical Linear Algebra Algorithms via Sparser Subspace Embeddings , 2012, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[24] Sanjoy Dasgupta,et al. An elementary proof of a theorem of Johnson and Lindenstrauss , 2003, Random Struct. Algorithms.
[25] Ata Kabán,et al. Sharp Generalization Error Bounds for Randomly-projected Classifiers , 2013, ICML.
[26] Michael W. Mahoney. Randomized Algorithms for Matrices and Data , 2011, Found. Trends Mach. Learn..
[27] Rong Jin,et al. Nyström Method vs Random Fourier Features: A Theoretical and Empirical Comparison , 2012, NIPS.