Learning sparse gradients for variable selection and dimension reduction

DOI10.1007/S10994-012-5284-9zbMATH Open1243.68258OpenAlexW2070991548MaRDI QIDQ439003FDOQ439003

Authors: Gui-Bo Ye, Xiaohui Xie 

Publication date: 31 July 2012

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-012-5284-9

Recommendations

• Model-free variable selection in reproducing kernel Hilbert space
• A nonlinear multi-dimensional variable selection method for high dimensional data: sparse MAVE
• Coordinate-independent sparse sufficient dimension reduction and variable selection
• Robust variable selection through MAVE
• Learning the coordinate gradients

zbMATH Keywords

variable selectionforward-backward splittingeffective dimension reductiongradient learning

Mathematics Subject Classification ID

General nonlinear regression (62J02) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Least angle regression. (With discussion)
• Weak convergence and empirical processes. With applications to statistics
• 10.1162/153244303322753616
• Title not available (Why is that?)
• Gene selection for cancer classification using support vector machines
• Sliced Inverse Regression for Dimension Reduction
• Theory & Methods: Special Invited Paper: Dimension Reduction and Visualization in Discriminant Analysis (with discussion)
• Regularization and Variable Selection Via the Elastic Net
• On Learning Vector-Valued Functions
• Theory of Reproducing Kernels
• Title not available (Why is that?)
• Learning Theory
• An Adaptive Estimation of Dimension Reduction Space
• Contour regression: a general approach to dimension reduction
• Selection of variables and dimension reduction in high-dimensional non-parametric regression
• Kernel dimension reduction in regression
• Title not available (Why is that?)
• Title not available (Why is that?)
• Component selection and smoothing in multivariate nonparametric regression
• Multivariate locally weighted least squares regression
• Structure adaptive approach for dimension reduction.
• Statistical behavior and consistency of classification methods based on convex risk minimization.
• Consistency of the group Lasso and multiple kernel learning
• Exploring Regression Structure Using Nonparametric Functional Estimation
• Title not available (Why is that?)
• On Principal Hessian Directions for Data Visualization and Dimension Reduction: Another Application of Stein's Lemma
• Compressed sensing
• De-noising by soft-thresholding
• Signal Recovery by Proximal Forward-Backward Splitting
• Some properties of invariant sets of a flow
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Title not available (Why is that?)
• Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data
• A framelet-based image inpainting algorithm
• Learning and approximation by Gaussians on Riemannian manifolds
• Manifold regularization: a geometric framework for learning from labeled and unlabeled examples
• 10.1162/153244303322753751
• Learning coordinate covariances via gradients
• Estimation of gradients and coordinate covariation in classification
• Learning gradients on manifolds
• 10.1162/153244303322753661
• Feature space perspectives for learning the kernel
• Rodeo: Sparse, greedy nonparametric regression
• Minimal realizations of nonlinear systems

Cited In (12)

• Performance analysis of the LapRSSLG algorithm in learning theory
• Refined Generalization Bounds of Gradient Learning over Reproducing Kernel Hilbert Spaces
• Sparse dimension reduction for survival data
• Structure learning via unstructured kernel-based M-estimation
• High-dimensional local linear regression under sparsity and convex losses
• Learning gradients: predictive models that infer geometry and statistical dependence
• Variable selection for partially linear models via learning gradients
• Learning Reductions to Sparse Sets
• Discovering model structure for partially linear models
• Learning the coordinate gradients
• Learning gradients on manifolds
• LEARNING GRADIENTS FROM NONIDENTICAL DATA

This page was built for publication: Learning sparse gradients for variable selection and dimension reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439003)