Sparse Shrunk Additive Models
Most existing feature selection methods in literature are linear models, so that the nonlinear relations between features and response variables are not considered. Meanwhile, in these feature selection models, the interactions between features are often ignored or just discussed under prior structure information. To address these challenging issues, we consider the problem of sparse additive models for high-dimensional nonparametric regression with the allowance of the flexible interactions between features. A new method, called as sparse shrunk additive models (SSAM), is proposed to explore the structure information among features. This method bridges sparse kernel regression and sparse feature selection. Theoretical results on the convergence rate and sparsity characteristics of SSAM are established by the novel analysis techniques with integral operator and concentration estimate. In particular, our algorithm and theoretical analysis only require the component functions to be continuous and bounded, which are not necessary to be in reproducing kernel Hilbert spaces. Experiments on both synthetic and real-world data demonstrate the effectiveness of the proposed approach.
Code (0)
등록된 구현이 없습니다.
Tasks
Additive modelsfeature selectionregressionMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
SHRIMP: Sparser Random Feature Models via Iterative Magnitude Pruning
Sparse shrunk additive models and sparse random feature models have been developed separately as methods to learn low-order functions, where there are few interactions between variables, but neither offers computational …
Additive modelsComputational Efficiencyfeature selectionMultimodal Image Denoising based on Coupled Dictionary Learning
In this paper, we propose a new multimodal image denoising approach to attenuate white Gaussian additive noise in a given image modality under the aid of a guidance image modality. The proposed coupled image denoising ap…
DenoisingDictionary LearningImage DenoisingLOss-Based SensiTivity rEgulaRization: towards deep sparse neural networks
LOBSTER (LOss-Based SensiTivity rEgulaRization) is a method for training neural networks having a sparse topology. Let the sensitivity of a network parameter be the variation of the loss function with respect to the vari…
SensitivityRidge regression with adaptive additive rectangles and other piecewise functional templates
We propose an $L_{2}$-based penalization algorithm for functional linear regression models, where the coefficient function is shrunk towards a data-driven shape template $\gamma$, which is constrained to belong to a clas…
global-optimizationregressionUnsupervised Trajectory Clustering via Adaptive Multi-Kernel-Based Shrinkage
This paper proposes a shrinkage-based framework for unsupervised trajectory clustering. Facing to the challenges of trajectory clustering, e.g., large variations within a cluster and ambiguities across clusters, we first…
Anomaly DetectionClusteringTrajectory Clustering