Exploring Large Feature Spaces with Hierarchical Multiple Kernel Learning
원문 초록
For supervised and unsupervised learning, positive definite kernels allow to use large and potentially infinite dimensional feature spaces with a computational cost that only depends on the number of observations. This is usually done through the penalization of predictor functions by Euclidean or Hilbertian norms. In this paper, we explore penalizing by sparsity-inducing norms such as the l1-norm or the block l1-norm. We assume that the kernel decomposes into a large sum of individual basis kernels which can be embedded in a directed acyclic graph; we show that it is then possible to perform kernel selection through a hierarchical multiple kernel learning framework, in polynomial time in the number of selected kernels. This framework is naturally applied to non linear variable selection; our extensive simulations on synthetic datasets and datasets from the UCI repository show that efficiently exploring the large feature space through sparsity-inducing norms leads to state-of-the-art predictive performance.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Handling bounded response in high dimensions: a Horseshoe prior Bayesian Beta regression approach
Stability Selection via Variable Decorrelation
High Dimensional Bayesian Optimization using Lasso Variable Selection
Causal Feature Learning in the Social Sciences
Bayesian Cox model with graph-structured variable selection priors for multi-omics biomarker identification
AirCast: Improving Air Pollution Forecasting Through Multi-Variable Data Alignment
토론
이 논문과 연결된 포럼 글이 아직 없습니다.