Learning kernel-based halfspaces with the 0-1 loss
From MaRDI portal
Publication:3225166
Recommendations
Cited in
(10)- A new central limit theorem and decomposition for Gaussian polynomials, with an application to deterministic approximate counting
- Conditional gradient sliding for convex optimization
- Learning hurdles for sleeping experts
- Convergence results for neural networks via electrodynamics
- On convergence of distributed approximate Newton methods: globalization, sharper bounds and beyond
- Conditional Gradient Methods for Convex Optimization with General Affine and Nonlinear Constraints
- Efficiently learning halfspaces with Tsybakov noise
- A nonlinear kernel SVM Classifier via \(L_{0/1}\) soft-margin loss with classification performance
- On the expressive power of kernel methods and the efficiency of kernel learning by association schemes
- Stochastic limited memory BFGS algorithms for solving nonconvex support vector machine problems and nonconvex risk minimization program
This page was built for publication: Learning kernel-based halfspaces with the 0-1 loss
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3225166)