Nonparametric sparsity and regularization
From MaRDI portal
Publication:2933860
zbMath1317.68183arXiv1208.2572MaRDI QIDQ2933860
Lorenzo Rosasco, Sofia Mosci, Matteo Santoro, Alessandro Verri, Silvia Villa
Publication date: 8 December 2014
Full work available at URL: https://arxiv.org/abs/1208.2572
Nonparametric regression and quantile regression (62G08) General nonlinear regression (62J02) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (36)
A Maximum Principle Argument for the Uniform Convergence of Graph Laplacian Regressors ⋮ Lipschitz Regularity of Graph Laplacians on Random Data Clouds ⋮ Efficient kernel-based variable selection with sparsistency ⋮ Low-Rank and Sparse Dictionary Learning ⋮ Improvement on LASSO-type estimator in nonparametric regression ⋮ Improved spectral convergence rates for graph Laplacians on \(\varepsilon \)-graphs and \(k\)-NN graphs ⋮ Unnamed Item ⋮ Non-linear dictionary learning with partially labeled data ⋮ Variable selection based on squared derivative averages ⋮ A unified penalized method for sparse additive quantile models: an RKHS approach ⋮ A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression ⋮ A General Framework of Nonparametric Feature Selection in High-Dimensional Data ⋮ The convergence rate of semi-supervised regression with quadratic loss ⋮ Thresholding gradient methods in Hilbert spaces: support identification and linear convergence ⋮ A classification-oriented dictionary learning model: explicitly learning the particularity and commonality across categories ⋮ Sparse representation based Fisher discrimination dictionary learning for image classification ⋮ Structure learning via unstructured kernel-based M-estimation ⋮ High-dimensional local linear regression under sparsity and convex losses ⋮ Regularizers for structured sparsity ⋮ The performance of semi-supervised Laplacian regularized regression with the least square loss ⋮ Proximal methods for the latent group lasso penalty ⋮ Statistical inference in compound functional models ⋮ Kernel based approaches to local nonlinear non-parametric variable selection ⋮ Robust and discriminative dictionary learning for face recognition ⋮ Kernel Meets Sieve: Post-Regularization Confidence Bands for Sparse Additive Model ⋮ Variable selection of high-dimensional non-parametric nonlinear systems by derivative averaging to avoid the curse of dimensionality ⋮ Ranking the importance of variables in nonlinear system identification ⋮ Kernel variable selection for multicategory support vector machines ⋮ Convergence of stochastic proximal gradient algorithm ⋮ Unnamed Item ⋮ Statistical modeling of longitudinal data with non-ignorable non-monotone missingness with semiparametric Bayesian and machine learning components ⋮ Learning sparse conditional distribution: an efficient kernel-based approach ⋮ Variable Selection for Nonparametric Learning with Power Series Kernels ⋮ Performance analysis of the LapRSSLG algorithm in learning theory ⋮ Bayesian Approximate Kernel Regression With Variable Selection ⋮ Proximal Gradient Methods for Machine Learning and Imaging
This page was built for publication: Nonparametric sparsity and regularization
