An empirical feature-based learning algorithm producing sparse approximations

DOI10.1016/J.ACHA.2011.07.005zbMATH Open1319.62119OpenAlexW2043216646MaRDI QIDQ413648FDOQ413648

Xin Guo, Ding-Xuan Zhou

Publication date: 7 May 2012

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.acha.2011.07.005

zbMATH Keywords

learning theoryreproducing kernel Hilbert spacesparsity\(\ell ^{1}\)-regularizerempirical features

Mathematics Subject Classification ID

Nonparametric regression and quantile regression (62G08) Factor analysis and principal components; correspondence analysis (62H25) Learning and adaptive systems in artificial intelligence (68T05) Ridge regression; shrinkage estimators (Lasso) (62J07)

Cites Work

• Title not available (Why is that?)
• Consistency of spectral clustering
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Compressed sensing
• Optimal rates for the regularized least-squares algorithm
• The variation of the spectrum of a normal matrix
• Learning theory estimates via integral operators and their approximations
• Capacity of reproducing kernel spaces in learning theory
• Least square regression with indefinite kernels and coefficient regularization
• Random matrix approximation of spectra of integral operators
• Spectral Algorithms for Supervised Learning
• CROSS-VALIDATION BASED ADAPTATION FOR REGULARIZATION OPERATORS IN LEARNING THEORY
• The Hoffman-Wielandt inequality in infinite dimensions
• Variation of discrete spectra
• Optimum bounds for the distributions of martingales in Banach spaces
• Eigenvalues of Analytic Kernels
• ONLINE LEARNING WITH MARKOV SAMPLING
• Geometry on probability spaces
• Eigenvalues of Positive Definite Kernels II

Cited In (16)

• Optimal learning rates for kernel partial least squares
• Online learning for quantile regression and support vector regression
• Refined Generalization Bounds of Gradient Learning over Reproducing Kernel Hilbert Spaces
• Semi-supervised learning with summary statistics
• Thresholded spectral algorithms for sparse approximations
• On empirical eigenfunction-based ranking with \(\ell^1\) norm regularization
• Divergence-free quasi-interpolation
• Convergence analysis of an empirical eigenfunction-based ranking algorithm with truncated sparsity
• Learning rate of distribution regression with dependent samples
• Title not available (Why is that?)
• Learning sparse linear combinations of basis functions over a finite domain
• Title not available (Why is that?)
• Distributed learning and distribution regression of coefficient regularization
• Title not available (Why is that?)
• On grouping effect of elastic net
• Distributed learning with partial coefficients regularization

   Recommendations

• An approximation theory approach to learning with \(\ell^1\) regularization 👍 👎
• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)