An empirical feature-based learning algorithm producing sparse approximations

DOI10.1016/j.acha.2011.07.005zbMath1319.62119OpenAlexW2043216646MaRDI QIDQ413648

Ding-Xuan Zhou, Xin Guo

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) Ridge regression; shrinkage estimators (Lasso) (62J07) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (13)

On grouping effect of elastic net ⋮ Optimal learning rates for kernel partial least squares ⋮ Divergence-free quasi-interpolation ⋮ Distributed learning with partial coefficients regularization ⋮ Learning rate of distribution regression with dependent samples ⋮ Online learning for quantile regression and support vector regression ⋮ Refined Generalization Bounds of Gradient Learning over Reproducing Kernel Hilbert Spaces ⋮ Convergence analysis of an empirical eigenfunction-based ranking algorithm with truncated sparsity ⋮ Distributed learning and distribution regression of coefficient regularization ⋮ On empirical eigenfunction-based ranking with \(\ell^1\) norm regularization ⋮ Semi-supervised learning with summary statistics ⋮ Unnamed Item ⋮ Thresholded spectral algorithms for sparse approximations

Cites Work

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

This page was built for publication: An empirical feature-based learning algorithm producing sparse approximations