Nonparametric linear feature learning in regression through regularisation
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 45848 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- 10.1162/153244303321897690
- A Multiple-Index Model and Dimension Reduction
- A distribution-free theory of nonparametric regression
- A new algorithm for estimating the effective dimension-reduction subspace
- An Adaptive Estimation of Dimension Reduction Space
- Comment
- Concentration inequalities. A nonasymptotic theory of independence
- Consistent Estimation of Scaled Coefficients
- Direct estimation of the index coefficient in a single-index model
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- High-dimensional probability. An introduction with applications in data science
- Kernel dimension reduction in regression
- Model Selection and Estimation in Regression with Grouped Variables
- Multivariate adaptive regression splines
- Nearly unbiased variable selection under minimax concave penalty
- Nonparametric sparsity and regularization
- On Principal Hessian Directions for Data Visualization and Dimension Reduction: Another Application of Stein's Lemma
- Optimization with sparsity-inducing penalties
- Orthogonal polynomials.
- Scikit-learn: machine learning in Python
- Selected Works of David Brillinger
- Slice inverse regression with score functions
- Sliced Inverse Regression for Dimension Reduction
- Structured variable selection with sparsity-inducing norms
- Subspace Estimation with Automatic Dimension and Variable Selection in Sufficient Dimension Reduction
- Theory of Reproducing Kernels
This page was built for publication: Nonparametric linear feature learning in regression through regularisation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034347)
