An empirical feature-based learning algorithm producing sparse approximations
From MaRDI portal
Recommendations
- An approximation theory approach to learning with \(\ell^1\) regularization
- Sparsity and error analysis of empirical feature-based regularization schemes
- Concentration estimates for learning with \(\ell ^{1}\)-regularizer and data dependent hypothesis spaces
- Sparse kernel learning with LASSO and Bayesian inference algorithm
- On the convergence rate of kernel-based sequential greedy regression
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Capacity of reproducing kernel spaces in learning theory
- Compressed sensing
- Consistency of spectral clustering
- Cross-validation based adaptation for regularization operators in learning theory
- Eigenvalues of Analytic Kernels
- Eigenvalues of Positive Definite Kernels II
- Geometry on probability spaces
- Learning theory estimates via integral operators and their approximations
- Least square regression with indefinite kernels and coefficient regularization
- ONLINE LEARNING WITH MARKOV SAMPLING
- Optimal rates for the regularized least-squares algorithm
- Optimum bounds for the distributions of martingales in Banach spaces
- Random matrix approximation of spectra of integral operators
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Spectral Algorithms for Supervised Learning
- The Hoffman-Wielandt inequality in infinite dimensions
- The variation of the spectrum of a normal matrix
- Variation of discrete spectra
Cited in
(20)- scientific article; zbMATH DE number 1708089 (Why is no real title available?)
- Thresholded spectral algorithms for sparse approximations
- Learning sparse linear combinations of basis functions over a finite domain
- Convergence analysis of an empirical eigenfunction-based ranking algorithm with truncated sparsity
- Divergence-free quasi-interpolation
- On empirical eigenfunction-based ranking with \(\ell^1\) norm regularization
- Sparsity and error analysis of empirical feature-based regularization schemes
- Learning rate of distribution regression with dependent samples
- scientific article; zbMATH DE number 6723396 (Why is no real title available?)
- Optimal learning rates for kernel partial least squares
- Online learning for quantile regression and support vector regression
- Distributed learning with regularized least squares
- Hierarchical regularization networks for sparsification based learning on noisy datasets
- On grouping effect of elastic net
- Refined generalization bounds of gradient learning over reproducing kernel Hilbert spaces
- An approximation theory approach to learning with \(\ell^1\) regularization
- Semi-supervised learning with summary statistics
- Distributed learning with partial coefficients regularization
- Regularized vector field learning with sparse approximation for mismatch removal
- Distributed learning and distribution regression of coefficient regularization
This page was built for publication: An empirical feature-based learning algorithm producing sparse approximations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413648)
