scientific article; zbMATH DE number 7164761

No author found.

Publication date: 7 February 2020

Full work available at URL: http://jmlr.csail.mit.edu/papers/v20/13-124.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

learning theory kernel regression sparsity $\ell_2$-empirical covering number coefficient-based $\ell_q$-regularization ($0< q \leq 1$)

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08) Nonparametric regression and quantile regression (62G08)

Related Items

Toward Efficient Ensemble Learning with Structure Constraints: Convergent Algorithms and Applications ⋮ Analysis of regularized least-squares in reproducing kernel Kreĭn spaces ⋮ Unnamed Item

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Learning with coefficient-based regularization and $\ell^1$-penalty
Concentration estimates for learning with $\ell ^{1}$-regularizer and data dependent hypothesis spaces
Iterative thresholding for sparse approximations
Enhancing sparsity by reweighted $\ell _{1}$ minimization
Regularization in kernel learning
Nonlinear regression modeling via regularized radial basis function networks
Sparse recovery by non-convex optimization - instance optimality
Fast rates for support vector machines using Gaussian kernels
Universal Donsker classes and metric entropy
Sharper bounds for Gaussian and empirical processes
Asymptotics for Lasso-type estimators.
Compactly supported positive definite radial functions
Piecewise polynomial, positive definite and compactly supported radial functions of minimal degree
Weak convergence and empirical processes. With applications to statistics
Learning theory estimates for coefficient-based regularized regression
An approximation theory approach to learning with $\ell^1$ regularization
Learning with sample dependent hypothesis spaces
Indefinite kernels in least squares support vector machines and principal component analysis
Statistical performance of support vector machines
Asymptotic properties of bridge estimators in sparse high-dimensional regression models
Learning rates of least-square regularized regression
Learning theory estimates via integral operators and their approximations
Local polynomial reproduction and moving least squares approximation
An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
Learning Theory
Support Vector Machines
Error estimates for scattered data interpolation on spheres
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
Leave-One-Out Bounds for Kernel Methods
10.1162/1532443041827925
Sparse Approximate Solutions to Linear Systems
Learning Rates of l^q Coefficient Regularization Learning with Gaussian Kernel
Thresholded spectral algorithms for sparse approximations
Minimax Rates of Estimation for High-Dimensional Linear Regression Over $\ell_q$-Balls
Indefinite Proximity Learning: A Review
Kernelized Elastic Net Regularization: Generalization Bounds, and Sparse Recovery
Stable signal recovery from incomplete and inaccurate measurements
PIECEWISE-POLYNOMIAL APPROXIMATIONS OF FUNCTIONS OF THE CLASSES $ W_{p}^{\alpha}$
Theory of Reproducing Kernels
Scattered Data Approximation
Compressed sensing