The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Robust Truncated Hinge Loss Support Vector Machines
Abstract
The support vector machine (SVM) has been widely applied for classification problems in both machine learning and statistics. Despite its popularity, however, SVM has some drawbacks in certain situations. In particular, the SVM classifier can be very sensitive to outliers in the training sample. Moreover, the number of support vectors (SVs) can be very large in many applications. To circumvent these drawbacks, we propose the robust truncated hinge loss SVM (RSVM), which uses a truncated hinge loss. The RSVM is shown to be more robust to outliers and to deliver more accurate classifiers using a smaller set of SVs than the standard SVM. Our theoretical results show that the RSVM is Fisher-consistent, even when there is no dominating class, a scenario that is particularly challenging for multicategory classification. Similar results are obtained for a class of margin-based classifiers.
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
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
Self-citationAn Introduction to Support Vector Machines and Other Kernel-based Learning Methods
Cristianini, N., & Shawe-Taylor, J. (2000) · doi:10.1017/cbo9780511801389 · Cited by 13,855
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Fan, J., & Li, R. (2001) · Journal of the American Statistical Association · doi:10.1198/016214501753382273 · Cited by 8,900
The adaptive lasso and its oracle properties
Zou, H. (2006) · Journal of the American Statistical Association · doi:10.1198/016214506000000735 · Cited by 7,470 · cited 1×
“Zou (2006) proposed the adaptive L 1 penalty for variable selection and showed its oracle property for regression problems .”
BackgroundModel Selection and Estimation in Regression with Grouped Variables
Yuan, M., & Lin, Y. (2006) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00532.x · Cited by 7,261
Friedman, J., Hastie, T., & Tibshirani, R. (2000) · The Annals of Statistics · doi:10.1214/aos/1016218223 · Cited by 6,884 · cited 2×
“Therefore, most classification meth-ods use convex losses as surrogates of the 0–1 loss, for example the hinge loss of the SVM, the logistic loss in the penalized logistic regression (Lin et al. 2000; Zhu and Hastie 2005), and the exponential loss function used in AdaBoost (Friedman, Hastie and Tibshirani 2000 Despite…”
MethodAn Introduction to Support Vector Machines
Cristianini, N., & Shawe-Taylor, J. S. (2000) · ePrints Soton (University of Southampton) · Cited by 4,115
On the algorithmic implementation of multiclass kernel-based vector machines
Crammer, K., & Singer, Y. (2002) · Journal of Machine Learning Research · Cited by 2,312
Knowledge-based analysis of microarray gene expression data by using support vector machines
Brown, M. P. S., Grundy, W. N., Lin, D., Cristianini, N., Sugnet, C. W., Furey, T. S., Ares, M., & Haussler, D. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.97.1.262 · Cited by 2,308
Some results on Tchebycheffian spline functions
Kimeldorf, G., & Wahba, G. (1971) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(71)90184-3 · Cited by 1,254
Cited by
Sure Independence Screening for Ultrahigh Dimensional Feature Space
Fan, J., & Lv, J. (2008) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2008.00674.x · Cited by 2,711
Enhancing one-class support vector machines for unsupervised anomaly detection
Amer, M., Goldstein, M., & Abdennadher, S. (2013) · Proceedings of the ACM SIGKDD Workshop on Outlier Detection and Description · doi:10.1145/2500853.2500857 · Cited by 427
VARIABLE SELECTION IN QUANTILE REGRESSION
Wu, Y., & Liu, Y. (2021) · Carolina Digital Repository (University of North Carolina at Chapel Hill) · doi:10.17615/gccn-qy67 · Cited by 358
Self-citationSupport Vector Machine Classifier With Pinball Loss
Huang, X., Shi, L., & Suykens, J. A. K. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.178 · Cited by 355
DC programming and DCA: thirty years of developments
Le Thi, H. A., & Pham Dinh, T. (2018) · Mathematical Programming · doi:10.1007/s10107-018-1235-y · Cited by 348
Bankruptcy visualization and prediction using neural networks: A study of U.S. commercial banks
López Iturriaga, F. J., & Sanz, I. P. (2015) · Expert Systems with Applications · doi:10.1016/j.eswa.2014.11.025 · Cited by 199
Kruppa, J., Liu, Y., Biau, G., Kohler, M., König, I. R., Malley, J. D., & Ziegler, A. (2014) · Biometrical Journal · doi:10.1002/bimj.201300068 · Cited by 97
“Examples of consistent multicategory loss functions include the truncated hinge loss (Wu and Liu, 2007) and the reinforced multicategory hinge loss (Liu and Yuan, 2011).”
BackgroundSelf-citationTrinh, H. D., Fernandez Gambin, A., Giupponi, L., Rossi, M., & Dini, P. (2021) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2020.3028197 · Cited by 40
Optimal Adaptive Power Control for Over-The-Air Federated Edge Learning Under Fading Channels
Yu, X., Xiao, B., Ni, W., & Wang, X. (2023) · IEEE Transactions on Communications · doi:10.1109/tcomm.2023.3283790 · Cited by 19
Deep Learning as a Mixed Convex-Combinatorial Optimization Problem
Friesen, A. L., & Domingos, P. (2017) · arXiv · doi:10.48550/arxiv.1710.11573 · Cited by 14
“First, the hinge loss is sensitive to noisy data and outliers (Wu & Liu, 2007), which can cause learning to focus on instances that are unlikely to ever be classified correctly, instead of on instances near the separator.”
Background
Metadata
- Authors
- Wu, Y., & Liu, Y.
- Venue
- Journal of the American Statistical Association
- Publisher
- Informa UK Limited
- Published
- 2007-09
- Volume
- 102
- Issue
- 479
- Pages
- 974-983
- ISSN
- 0162-1459 (ISSN-L)
- 1537-274X
- OpenAlex
- W2089394015
- Cited by
- 375
- References
- 33
- FWCI
- 6.30
- Type
- journal article
- 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.