Structured sparsity and generalization
From MaRDI portal
Recommendations
Cited in
(17)- A note on ``Reguralizers for structured sparsity
- An analysis of the SPARSEVA estimate for the finite sample data case
- Inductive matrix completion with feature selection
- Structured iterative hard thresholding with on- and off-grid applications
- A sparsity driven kernel machine based on minimizing a generalization error bound
- Learning with optimal interpolation norms
- Error bounds for learning the kernel
- scientific article; zbMATH DE number 6670747 (Why is no real title available?)
- Oracle inequalities for local and global empirical risk minimizers
- Learning the Structure for Structured Sparsity
- Regularized learning schemes in feature Banach spaces
- Sharp oracle inequalities for square root regularization
- Regularization and the small-ball method. II: Complexity dependent error rates
- scientific article; zbMATH DE number 7626791 (Why is no real title available?)
- Kernelized elastic net regularization: generalization bounds, and sparse recovery
- Learning with Structured Sparsity
- A learning generalization bound with an application to sparse-representation classifiers
This page was built for publication: Structured sparsity and generalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405139)