Sparse kernel regression with coefficient-based _q-regularization
From MaRDI portal
Sparse kernel regression with coefficient-based \(\ell q\)-regularization
Recommendations
- Learning with coefficient-based regularization and ^1-penalty
- An approximation theory approach to learning with \(\ell^1\) regularization
- Optimal rates for coefficient-based regularized regression
- Sharp learning rates of coefficient-based l^q-regularized regression with indefinite kernels
- Learning Rates of lq Coefficient Regularization Learning with Gaussian Kernel
Cites work
- 10.1162/1532443041827925
- An approximation theory approach to learning with \(\ell^1\) regularization
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- An unconstrained \(\ell_q\) minimization with \(0<q\leq 1\) for sparse solution of underdetermined linear systems
- Asymptotic properties of bridge estimators in sparse high-dimensional regression models
- Asymptotics for Lasso-type estimators.
- Compactly supported positive definite radial functions
- Compressed sensing
- Concentration estimates for learning with \(\ell ^{1}\)-regularizer and data dependent hypothesis spaces
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Error estimates for scattered data interpolation on spheres
- Fast rates for support vector machines using Gaussian kernels
- scientific article; zbMATH DE number 1377487 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 2208228 (Why is no real title available?)
- scientific article; zbMATH DE number 962825 (Why is no real title available?)
- Indefinite kernels in least squares support vector machines and principal component analysis
- Indefinite proximity learning: a review
- Iterative thresholding for sparse approximations
- Kernelized elastic net regularization: generalization bounds, and sparse recovery
- Learning Rates of lq Coefficient Regularization Learning with Gaussian Kernel
- Learning rates of least-square regularized regression
- Learning Theory
- Learning theory estimates for coefficient-based regularized regression
- Learning theory estimates via integral operators and their approximations
- Learning with coefficient-based regularization and ^1-penalty
- Learning with sample dependent hypothesis spaces
- Leave-One-Out Bounds for Kernel Methods
- Local polynomial reproduction and moving least squares approximation
- Lower bound theory of nonzero entries in solutions of _2-_p minimization
- Minimax Rates of Estimation for High-Dimensional Linear Regression Over \ell_q-Balls
- Nonlinear regression modeling via regularized radial basis function networks
- Piecewise polynomial, positive definite and compactly supported radial functions of minimal degree
- PIECEWISE-POLYNOMIAL APPROXIMATIONS OF FUNCTIONS OF THE CLASSES $ W_{p}^{\alpha}$
- Regularization in kernel learning
- Scattered Data Approximation
- Sharper bounds for Gaussian and empirical processes
- Sobolev norm learning rates for regularized least-squares algorithms
- Sparse Approximate Solutions to Linear Systems
- Sparse recovery by non-convex optimization - instance optimality
- Stable signal recovery from incomplete and inaccurate measurements
- Statistical performance of support vector machines
- Support vector machine soft margin classifiers: error analysis
- Support Vector Machines
- Theory of Reproducing Kernels
- Thresholded spectral algorithms for sparse approximations
- Universal Donsker classes and metric entropy
- Universal kernels
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Weak convergence and empirical processes. With applications to statistics
Cited in
(8)- Analysis of regularized least-squares in reproducing kernel Kreĭn spaces
- Sparsity and error analysis of empirical feature-based regularization schemes
- Toward Efficient Ensemble Learning with Structure Constraints: Convergent Algorithms and Applications
- Generalization properties of hyper-RKHS and its applications
- Randomized multi-scale kernels learning with sparsity constraint regularization for regression
- Sparse online regression algorithm with insensitive loss functions
- Iterative kernel regression with preconditioning
- Sparse kernel sufficient dimension reduction
This page was built for publication: Sparse kernel regression with coefficient-based \(\ell_q\)-regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5214255)
