svm-multiclass-requires-architectural-extension

IN derived (depth 1)

Created 2026-06-21T10:01:28+00:00 · Reviewed 2026-06-21T15:37:01+00:00

SVMs' binary-native design requires substantial architectural extension for multiclass problems — decomposition into one-vs-all or one-vs-one subproblems, Platt scaling for probability calibration in OVA, or the unified Crammer-Singer formulation — with OVO generally outperforming OVA despite training more classifiers.

Justifications

SL — Four multiclass beliefs together show that multiclass SVM is not a simple extension but requires architectural decisions with empirical performance implications

Antecedents (all must be IN):

IN svm-multiclass-ova-vs-ovo — Multiclass SVM uses one-versus-all (OVA: K classifiers, winner-takes-all on calibrated scores) or one-versus-one (OVO: K(K-1)/2 classifiers, max-wins voting).
IN svm-multiclass-one-vs-one-outperforms-one-vs-all — For multiclass SVM, one-vs-one generally outperforms one-vs-all (Hsu & Lin 2002; Duan & Keerthi 2005).
IN svm-crammer-singer-single-optimization — The Crammer-Singer method casts multiclass SVM as a single unified optimization problem rather than decomposing into multiple binary sub-problems.
IN svm-platt-scaling-probability-calibration — Platt scaling is used to calibrate SVM outputs into probabilities, which is important for one-versus-all multiclass SVM.

Dependents

These beliefs depend on this one:

IN svm-complexity-compounds-with-scale — SVM complexity compounds as problems scale — multiclass classification requires architectural decomposition (OvA/OvO/Crammer-Singer) on top of already scale-dependent solver selection (SMO vs Pegasos vs LIBLINEAR), creating a combinatorial methodology burden that contrasts with neural network approaches which handle multiclass classification more naturally.