paper-with-me

홈 › Papers

Efficient and Robust Feature Selection via Joint ℓ2,1-Norms Minimization

2010-12-01 · NeurIPS 2010 12 · Feiping Nie, Heng Huang, Xiao Cai, Chris H. Ding

Feature selection is an important component of many machine learning applications. Especially in many bioinformatics tasks, efficient and robust feature selection methods are desired to extract meaningful features and eliminate noisy ones. In this paper, we propose a new robust feature selection method with emphasizing joint ℓ2,1-norm minimization on both loss function and regularization. The ℓ2,1-norm based loss function is robust to outliers in data points and the ℓ2,1-norm regularization selects features across all data points with joint sparsity. An efficient algorithm is introduced with proved convergence. Our regression based objective makes the feature selection process more efficient. Our method has been applied into both genomic and proteomic biomarkers discovery. Extensive empirical studies were performed on six data sets to demonstrate the effectiveness of our feature selection method.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

feature selectionregression

Similar Papers 제목 키워드 기반

Probabilistic Multi-Task Feature Selection

2010-12-01 · NeurIPS 2010 12 · Yu Zhang, Dit-yan Yeung, Qian Xu

Recently, some variants of the $l_1$ norm, particularly matrix norms such as the $l_{1,2}$ and $l_{1,\infty}$ norms, have been widely used in multi-task learning, compressed sensing and other related areas to enforce spa…

Cancer Classificationcompressed sensingfeature selectionMulti-Task Learning

Tractable and Scalable Schatten Quasi-Norm Approximations for Rank Minimization

2018-02-28 · Fanhua Shang, Yuanyuan Liu, James Cheng

The Schatten quasi-norm was introduced to bridge the gap between the trace norm and rank function. However, existing algorithms are too slow or even impractical for large-scale problems. Motivated by the equivalence rela…

Implicit Regularization in Deep Learning May Not Be Explainable by Norms

2020-05-13 · NeurIPS 2020 12 · Noam Razin, Nadav Cohen

Mathematically characterizing the implicit regularization induced by gradient-based optimization is a longstanding pursuit in the theory of deep learning. A widespread hope is that a characterization based on minimizatio…

Deep LearningMatrix CompletionOpen-Ended Question Answering

ETAGE: Enhanced Test Time Adaptation with Integrated Entropy and Gradient Norms for Robust Model Performance

2024-09-14 · Afshar Shamsi, Rejisa Becirovic, Ahmadreza Argha, Ehsan Abbasnejad 외

Test time adaptation (TTA) equips deep learning models to handle unseen test data that deviates from the training distribution, even when source data is inaccessible. While traditional TTA methods often rely on entropy a…

Pseudo LabelTest-time Adaptation

Feature Selection based on the Local Lift Dependence Scale

2017-11-11 · Diego Marcondes, Adilson Simonis, Junior Barrera

This paper uses a classical approach to feature selection: minimization of a cost function applied on estimated joint distributions. However, the search space in which such minimization is performed is extended. In the o…

feature selection