The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Fast and scalable polynomial kernels via explicit feature maps
Abstract
Approximation of non-linear kernels using random feature mapping has been successfully employed in large-scale data analysis applications, accelerating the training of kernel machines. While previous random feature mappings run in O(ndD) time for $n$ training samples in d-dimensional space and D random feature maps, we propose a novel randomized tensor product technique, called Tensor Sketching, for approximating any polynomial kernel in O(n(d+D \log{D})) time. Also, we introduce both absolute and relative error bounds for our approximation to guarantee the reliability of our estimation algorithm. Empirically, Tensor Sketching achieves higher accuracy and often runs orders of magnitude faster than the state-of-the-art approach for large-scale real-world datasets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Gradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805
LIBSVM: A library for support vector machines
Chang, C.-C., & Lin, C.-J. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961199 · Cited by 40,918
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,410
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
Random Features for Large-Scale Kernel Machines
Rahimi, A., & Recht, B. (2007) · Cited by 2,783
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
(2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2005.848998 · Cited by 2,225
Training linear SVMs in linear time
Joachims, T. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150429 · Cited by 1,920
Using the Nyström Method to Speed Up Kernel Machines
Williams, C. K. I., & Seeger, M. (2000) · Cited by 1,646
Pegasos: primal estimated sub-gradient solver for SVM
Shalev-Shwartz, S., Singer, Y., Srebro, N., & Cotter, A. (2011) · Mathematical Programming · doi:10.1007/s10107-010-0420-4 · Cited by 1,477
Finding frequent items in data streams
Charikar, M., Chen, K., & Farach-Colton, M. (2004) · Theoretical Computer Science · doi:10.1016/s0304-3975(03)00400-6 · Cited by 1,278
On the Nyström Method for Approximating a Gram Matrix for Improved Kernel-Based Learning
Petros Drineas, B., & Mahoney, M. W. (2005) · Journal of Machine Learning Research · doi:10.5555/1046920.1194916 · Cited by 1,174
An improved training algorithm for support vector machines
Osuna, E., Freund, R., & Girosi, F. (2002) · Neural Networks for Signal Processing VII. Proceedings of the 1997 IEEE Signal Processing Society Workshop · doi:10.1109/nnsp.1997.622408 · Cited by 1,061
Pegasos: Primal Estimated sub-GrAdient SOlver for SVM
Shalev-Shwartz, S., Singer, Y., & Srebro, N. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273598 · Cited by 973
Feature hashing for large scale multitask learning
Weinberger, K., Dasgupta, A., Langford, J., Smola, A., & Attenberg, J. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553516 · Cited by 906
Efficient svm training using low-rank kernel representations
Fine, S., & Scheinberg, K. (2002) · doi:10.5555/944790.944812 · Cited by 579
Sparse Greedy Matrix Approximation for Machine Learning
Smola, A. J., & Schökopf, B. (2000) · doi:10.5555/645529.657980 · Cited by 574
LIBLINEAR: A Library for Large Linear Classification
FanRong-En, ChangKai-Wei, HsiehCho-Jui, WangXiang-Rui, & LinChih-Jen (2008) · Journal of Machine Learning Research · doi:10.5555/1390681.1442794 · Cited by 328
Efficient additive kernels via explicit feature maps
Vedaldi, A., & Zisserman, A. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539949 · Cited by 257
Max-margin additive classifiers for detection
Maji, S., & Berg, A. C. (2009) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2009.5459203 · Cited by 181
Approximate kernel k-means: solution to large scale kernel clustering
Chitta, R., Jin, R., Havens, T. C., & Jain, A. K. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020558 · Cited by 167
Compressed matrix multiplication
Pagh, R. (2013) · ACM Transactions on Computation Theory · doi:10.1145/2493252.2493254 · Cited by 105
Self-citationGeneralized RBF feature maps for Efficient Detection
Vempati, S., Vedaldi, A., Zisserman, A., & Jawahar, C. V. (2010) · British Machine Vision Conference (BMVC) · doi:10.5244/c.24.2 · Cited by 95
Random Feature Maps for Dot Product Kernels
Kar, P., & Karnick, H. (2012) · Cited by 87
Efficient Kernel Clustering Using Random Fourier Features
Chitta, R., Jin, R., & Jain, A. K. (2012) · Proceedings · doi:10.1109/icdm.2012.61 · Cited by 86
The power of simple tabulation hashing
Pǎtraşcu, M., & Thorup, M. (2011) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1993636.1993638 · Cited by 54
Compressed matrix multiplication
Pagh, R. (2012) · Conference on Innovations in Theoretical Computer Science · doi:10.1145/2090236.2090271 · Cited by 23
Self-citation
Cited by
Multimodal Compact Bilinear Pooling for Visual Question Answering and Visual Grounding
Fukui, A., Park, D. H., Yang, D., Rohrbach, A., Darrell, T., & Rohrbach, M. (2016) · Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d16-1044 · Cited by 1,582
Gao, Y., Beijbom, O., Zhang, N., & Darrell, T. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.41 · Cited by 871
Part-Aligned Bilinear Representations for Person Re-identification
Suh, Y., Wang, J., Tang, S., Mei, T., & Lee, K. M. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-01264-9_25 · Cited by 557
Deep Multimodal Representation Learning: A Survey
Guo, W., Wang, J., & Wang, S. (2019) · IEEE Access · doi:10.1109/access.2019.2916887 · Cited by 535
Multimodal intelligence: Representation learning, information fusion, and applications
Zhang, C., Yang, Z., He, X., & Deng, L. (2020) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2020.2987728 · Cited by 511
Metadata
- Authors
- Pham, N., & Pagh, R.
- Venue
- Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2013-08-11
- Pages
- 239-247
- OpenAlex
- W2146897752
- Cited by
- 306
- References
- 26
- FWCI
- 9.76
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.