Kernel methods for independence measurement with coefficient constraints
From MaRDI portal
Recommendations
Cites work
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Classifiers of support vector machine type with \(\ell_1\) complexity regularization
- Convergence rate of kernel canonical correlation analysis
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Learning Theory
- Support vector machines regression with l^1-regularizer
Cited in
(6)- Large-scale kernel methods for independence testing
- Estimations of singular functions of kernel cross-covariance operators
- A kernel-based measure for conditional mean dependence
- Kernel methods for measuring independence
- Convergence rate of SVM for kernel-based robust regression
- Error analysis of the kernel regularized regression based on refined convex losses and RKBSs
This page was built for publication: Kernel methods for independence measurement with coefficient constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874062)