Regularization, optimization, kernels, and support vector machines
From MaRDI portal
Recommendations
- On sparsity inducing regularization methods for machine learning
- Support vector machines. Optimization based theory, algorithms, and extensions
- An introduction to support vector machines and other kernel-based learning methods.
- scientific article; zbMATH DE number 1314294
- scientific article; zbMATH DE number 6438182
Cited in
(26)- A nearest neighbor estimate of the residual variance
- Multiplicative updates for polynomial root finding
- Principles of experimental design for big data analysis
- The equivalence of support vector machine and regularization neural networks
- Regularization networks and support vector machines
- Algorithms for nonnegative matrix factorization with the Kullback-Leibler divergence
- Low-rank matrix completion via preconditioned optimization on the Grassmann manifold
- Decomposition techniques for bilinear saddle point problems and variational inequalities with affine monotone operators
- Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm
- Low-rank spectral optimization via gauge duality
- scientific article; zbMATH DE number 5957245 (Why is no real title available?)
- Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization
- Multiplicative Updates for NMF with $\beta$-Divergences under Disjoint Equality Constraints
- An efficient nonmonotone projected Barzilai-Borwein method for nonnegative matrix factorization with extrapolation
- A dynamical system approach for continuous nonnegative matrix factorization
- On sparsity inducing regularization methods for machine learning
- Nonnegative matrix factorization requires irrationality
- Cyclic coordinate-update algorithms for fixed-point problems: analysis and applications
- Robust support vector machines for classification with nonconvex and smooth losses
- Algorithms for Sparse Support Vector Machines
- Complexity of a projected Newton-CG method for optimization with bounds
- A proximal gradient method with double inertial steps for minimization problems involving demicontractive mappings
- Latent Dirichlet Analysis of Categorical Survey Responses
- Distribution-free tests for lossless feature selection in classification and regression
- Regularization in kernel learning
- Ideal regularization for learning kernels from labels
This page was built for publication: Regularization, optimization, kernels, and support vector machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5173028)
