Robust multicategory support vector machines using difference convex algorithm
From MaRDI portal
Publication:1749454
DOI10.1007/s10107-017-1209-5zbMath1397.90319OpenAlexW2768140828MaRDI QIDQ1749454
Publication date: 16 May 2018
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-017-1209-5
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Nonconvex programming, global optimization (90C26)
Related Items (5)
Composite Difference-Max Programs for Modern Statistical Estimation Problems ⋮ Simplex-based Multinomial Logistic Regression with Diverging Numbers of Categories and Covariates ⋮ Robust distributed multicategory angle-based classification for massive data ⋮ Robust multicategory support matrix machines ⋮ Adaptively weighted large-margin angle-based classifiers
Uses Software
Cites Work
- Multicategory angle-based large-margin classification
- A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training
- Fast rates for support vector machines using Gaussian kernels
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- A decision-theoretic generalization of on-line learning and an application to boosting
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Smoothing spline ANOVA models for large data sets with Bernoulli observations and the randomized GACV.
- Empirical margin distributions and bounding the generalization error of combined classifiers
- Support-vector networks
- Weak convergence and empirical processes. With applications to statistics
- Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)
- A DC programming approach for feature selection in support vector machines learning
- Local Rademacher complexities
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- Computing B-Stationary Points of Nonsmooth DC Programs
- 10.1162/15324430260185628
- DC Programming and DCA for General DC Programs
- Robust Truncated Hinge Loss Support Vector Machines
- Proximal Decomposition Via Alternating Linearization
- 10.1162/153244303321897690
- Hard or Soft Classification? Large-Margin Unified Machines
- Scan Statistics With Weighted Observations
- Multicategory Support Vector Machines
- Convexity, Classification, and Risk Bounds
- Multicategory ψ-Learning
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Robust multicategory support vector machines using difference convex algorithm
