Structure learning via unstructured kernel-based M-estimation
From MaRDI portal
Abstract: In statistical learning, identifying underlying structures of true target functions based on observed data plays a crucial role to facilitate subsequent modeling and analysis. Unlike most of those existing methods that focus on some specific settings under certain model assumptions, this paper proposes a general and novel framework for recovering true structures of target functions by using unstructured M-regression in a reproducing kernel Hilbert space (RKHS). The proposed framework is inspired by the fact that gradient functions can be employed as a valid tool to learn underlying structures, including sparse learning, interaction selection and model identification, and it is easy to implement by taking advantage of the nice properties of the RKHS. More importantly, it admits a wide range of loss functions, and thus includes many commonly used methods, such as mean regression, quantile regression, likelihood-based classification, and margin-based classification, which is also computationally efficient by solving convex optimization tasks. The asymptotic results of the proposed framework are established within a rich family of loss functions without any explicit model specifications. The superior performance of the proposed framework is also demonstrated by a variety of simulated examples and a real case study.
Cites work
- scientific article; zbMATH DE number 5957364 (Why is no real title available?)
- scientific article; zbMATH DE number 1804106 (Why is no real title available?)
- scientific article; zbMATH DE number 204196 (Why is no real title available?)
- scientific article; zbMATH DE number 7370644 (Why is no real title available?)
- A Bernstein-type inequality for some mixing processes and dynamical systems with an application to learning
- A Selective Overview of Variable Selection in High Dimensional Feature Space (Invited Review Article)
- A generic sure independence screening procedure
- Can Tests for Jumps be Viewed as Tests for Clusters?
- Consistency of Support Vector Machines and Other Regularized Kernel Classifiers
- Consistent selection of tuning parameters via variable selection stability
- Controlling the false discovery rate via knockoffs
- Derivative reproducing properties for kernel methods in learning theory
- Discovering model structure for partially linear models
- Efficient kernel-based variable selection with sparsistency
- Feature elimination in kernel machines in moderately high dimensions
- Feature screening via distance correlation learning
- High dimensional ordinary least squares projection for screening variables
- Individualized Multidirectional Variable Selection
- Interaction pursuit in high-dimensional multi-response regression via distance correlation
- Interaction screening for ultrahigh-dimensional data
- Kernel distribution embeddings: universal kernels, characteristic kernels and kernel metrics on distributions
- Learning coordinate covariances via gradients
- Learning gradients on manifolds
- Learning sparse conditional distribution: an efficient kernel-based approach
- Learning sparse gradients for variable selection and dimension reduction
- Likelihood-based selection and sharp parameter estimation
- Linear or nonlinear? Automatic structure discovery for partially linear models
- Model selection for high-dimensional quadratic regression via regularization
- Model-free feature screening for ultrahigh dimensional data through a modified Blum-Kiefer-Rosenblatt correlation
- Model-free feature screening for ultrahigh dimensional discriminant analysis
- Model-free feature screening for ultrahigh-dimensional data
- Model-free variable selection in reproducing kernel Hilbert space
- Nonparametric Interaction Selection
- Nonparametric screening under conditional strictly convex loss for ultrahigh dimensional sparse data
- Nonparametric sparsity and regularization
- On constrained and regularized high-dimensional regression
- On quantile regression in reproducing kernel Hilbert spaces with the data sparsity constraint
- Optimal regression rates for SVMs using Gaussian kernels
- Oracle inequalities for sparse additive quantile regression in reproducing kernel Hilbert space
- Quantile-adaptive model-free variable screening for high-dimensional heterogeneous data
- Regularization in kernel learning
- Robust Variable and Interaction Selection for Logistic Regression and General Index Models
- Sobolev norm learning rates for regularized least-squares algorithms
- Statistical consistency and asymptotic normality for high-dimensional robust \(M\)-estimators
- Sums of Powers in Large Finite Fields
- Support Vector Machines
- Sure independence screening for ultrahigh dimensional feature space. With discussion and authors' reply
- Sure independence screening in generalized linear models with NP-dimensionality
- The Kolmogorov filter for variable screening in high-dimensional binary classification
- Ultrahigh dimensional feature selection: beyond the linear model
- Variable selection for support vector machines in moderately high dimensions
- Variable selection for classification with derivative-induced regularization
- Variable selection in nonparametric additive models
- Variable selection in quantile regression
- Variable selection using adaptive nonlinear interaction structures in high dimensions
This page was built for publication: Structure learning via unstructured kernel-based M-estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184881)
