Learning Kernel-Based Halfspaces with the 0-1 Loss
From MaRDI portal
Publication:3225166
DOI10.1137/100806126zbMath1234.68172OpenAlexW1987635176MaRDI QIDQ3225166
Ohad Shamir, Karthik Sridharan, Shai Shalev-Shwartz
Publication date: 15 March 2012
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/97e45895efbdf6ded0824bab81b901ec4b9f8107
Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (7)
A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting ⋮ A nonlinear kernel SVM Classifier via \(L_{0/1}\) soft-margin loss with classification performance ⋮ Convergence Results for Neural Networks via Electrodynamics ⋮ Conditional Gradient Methods for Convex Optimization with General Affine and Nonlinear Constraints ⋮ Conditional Gradient Sliding for Convex Optimization ⋮ Learning Hurdles for Sleeping Experts ⋮ Unnamed Item
This page was built for publication: Learning Kernel-Based Halfspaces with the 0-1 Loss