Support Vector Machine Solvers
The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Abstract
Considerable efforts have been devoted to the implementation of efficient optimization method for solving the Support Vector Machine dual problem. This document proposes an historical perspective and and in depth review of the algorithmic and computational issues associated with this problem.
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
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
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
Self-citationThe Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
A training algorithm for optimal margin classifiers
Boser, B. E., Guyon, I. M., & Vapnik, V. N. (1992) · Proceedings of the fifth annual workshop on Computational learning theory · doi:10.1145/130385.130401 · Cited by 11,992
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Estimating the Support of a High-Dimensional Distribution
Schölkopf, B., Platt, J. C., Shawe-Taylor, J., Smola, A. J., & Williamson, R. C. (2001) · Neural Computation · doi:10.1162/089976601750264965 · Cited by 6,168 · cited 2×
“…include SVMs for computing regressions (Vapnik, 1995), for solving integral equations (Vapnik, 1995), for estimating the support of a density (Schölkopf et al., 2001), SVMs that use different soft-margin costs (Cortes and Vapnik, 1995), and parameters (Schölkopf et al., 2000; Chang and…”
MethodFast Training of Support Vector Machines Using Sequential Minimal Optimization
Platt, J. C. (1998) · Advances in Kernel Methods · doi:10.7551/mitpress/1130.003.0016 · Cited by 5,437
Making Large-Scale SVM Learning Practical
Joachims, T. (1998) · RePEc: Research Papers in Economics · doi:10.17877/de290r-14262 · Cited by 4,411
(1999) · doi:10.1162/089976600300015565 · Cited by 2,799
Cited by
Multiple instance learning: A survey of problem characteristics and applications
Carbonneau, M.-A., Cheplygina, V., Granger, E., & Gagnon, G. (2018) · Pattern Recognition · doi:10.1016/j.patcog.2017.10.009 · Cited by 740
“For example, the computational complexity of 1915 an SVM is between O(n2) and O(n3) when using traditional QP and LP solvers [180], where n is the number of instances.”
MethodEfficient Additive Kernels via Explicit Feature Maps
Vedaldi, A., & Zisserman, A. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.153 · Cited by 688
Problem formulations and solvers in linear SVM: a review
Chauhan, V. K., Dahiya, K., & Sharma, A. (2019) · Artificial Intelligence Review · doi:10.1007/s10462-018-9614-6 · Cited by 660
Hyperparameter Search in Machine Learning
Claesen, M., & Moor, B. D. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1502.02127 · Cited by 333
How Complex Is Your Classification Problem?: A Survey on Measuring Classification Complexity
Lorena, A. C., Garcia, L. P. F., Lehmann, J., Souto, M. C. P., & Ho, T. K. (2020) · ACM Computing Surveys · doi:10.1145/3347711 · Cited by 275
A Survey of Machine Learning for Indoor Positioning
Nessa, A., Adhikari, B., Hussain, F., & Fernando, X. N. (2020) · IEEE Access · doi:10.1109/access.2020.3039271 · Cited by 269
"What is relevant in a text document?": An interpretable machine learning approach
Arras, L., Horn, F., Montavon, G., Müller, K.-R., & Samek, W. (2017) · PLOS ONE · doi:10.1371/journal.pone.0181142 · Cited by 257
SVM optimization: inverse dependence on training set size
Shalev-Shwartz, S., & Srebro, N. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390273 · Cited by 240
“In fact, Bottou and Lin (2007) argue that any method that solves the dual problem very accurately might in general require runtime O(dm2), and also provide empirical evidence suggesting that modern dual-decomposition methods come close to a runtime of O(dm2 log(1/E)).”
BackgroundLarge Scale Image Completion via Co-Modulated Generative Adversarial Networks
Zhao, S., Cui, J., Sheng, Y., Dong, Y., Liang, X., Chang, E. I., & Xu, Y. (2021) · arXiv · doi:10.48550/arxiv.2103.10428 · Cited by 224
“The time complexity of training a linear SVM is between O(n2) and O(n3) (Bottou & Lin, 2007), compared to O(nd2 + d3) of FID (Heusel et al., 2017) and O(n2d) of KID (Bińkowski et al., 2018), where n is the sampling size and d is the dimension of feature space.”
BackgroundEmbedded Intelligence on FPGA: Survey, Applications and Challenges
Seng, K. P., Lee, P. J., & Ang, L. M. (2021) · Electronics · doi:10.3390/electronics10080895 · Cited by 105
Survey on Models and Techniques for Root-Cause Analysis
Solé, M., Muntés-Mulero, V., Rana, A. I., & Estrada, G. (2017) · arXiv · doi:10.48550/arxiv.1701.08546 · Cited by 74
“5 [69] ID5R [100] MinEntropy [35] Conditional Inference trees [101] Propositional logic (rule sets) Separate-and-conquer [102] Association rules [103] Artificial Immune Systems [104] Fuzzy logic (fuzzy rule sets) Artificial Immune Systems [105] Possibilistic Logic [106], [107] Non-axiomatic Logic – Automata/FSM See [1…”
BackgroundRobust Authentication of Consumables With Extrinsic Tags and Chemical Fingerprinting
Masna, N. V. R., Chen, C., Mandal, S., & Bhunia, S. (2019) · IEEE Access · doi:10.1109/access.2019.2893518 · Cited by 15
Metadata
- Authors
- Bottou, L., & Lin, C.-J.
- Venue
- Large-Scale Kernel Machines
- Publisher
- The MIT Press
- Published
- 2007-08-17
- Pages
- 1-28
- OpenAlex
- W2546945975
- Cited by
- 336
- References
- 43
- FWCI
- 12.03
- Type
- book chapter
- 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.