Title
Absolute Fused Lasso and Its Application to Genome-Wide Association Studies
Abstract
In many real-world applications, the samples/features acquired are in spatial or temporal order. In such cases, the magnitudes of adjacent samples/features are typically close to each other. Meanwhile, in the high-dimensional scenario, identifying the most relevant samples/features is also desired. In this paper, we consider a regularized model which can simultaneously identify important features and group similar features together. The model is based on a penalty called Absolute Fused Lasso (AFL). The AFL penalty encourages sparsity in the coefficients as well as their successive differences of absolute values' i.e., local constancy of the coefficient components in absolute values. Due to the non-convexity of AFL, it is challenging to develop efficient algorithms to solve the optimization problem. To this end, we employ the Difference of Convex functions (DC) programming to optimize the proposed non-convex problem. At each DC iteration, we adopt the proximal algorithm to solve a convex regularized sub-problem. One of the major contributions of this paper is to develop a highly efficient algorithm to compute the proximal operator. Empirical studies on both synthetic and real-world data sets from Genome-Wide Association Studies demonstrate the efficiency and effectiveness of the proposed approach in simultaneous identifying important features and grouping similar features.
Year
DOI
Venue
2016
10.1145/2939672.2939827
KDD
Keywords
Field
DocType
Absolute Fused Lasso,Non-convex Optimization,Proximal Operator,GWAS
Non convex optimization,Data set,Computer science,Absolute value,Lasso (statistics),Regular polygon,Convex function,Artificial intelligence,Operator (computer programming),Optimization problem,Machine learning
Conference
Citations 
PageRank 
References 
3
0.40
6
Authors
6
Name
Order
Citations
PageRank
Tao Yang1243.47
Jun Liu282238.24
Pinghua Gong334915.61
ruiwen zhang4191.03
Xiaotong Shen533125.75
Jieping Ye66943351.37