Name
Abstract | ||
|---|---|---|
Sparse mapping has been a key methodology in many high-dimensional scientific problems. When multiple tasks share the set of relevant features, learning them jointly in a group drastically improves the quality of relevant feature selection. However, in practice this technique is used limitedly since such grouping information is usually hidden. In this paper, our goal is to recover the group structure on the sparsity patterns and leverage that information in the sparse learning. Toward this, we formulate a joint optimization problem in the task parameter and the group membership, by constructing an appropriate regularizer to encourage sparse learning as well as correct recovery of task groups. We further demonstrate that our proposed method recovers groups and the sparsity patterns in the task parameters accurately by extensive experiments. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-71246-8_41 | Lecture Notes in Artificial Intelligence |
Field | DocType | Volume |
Cluster (physics),Semi-supervised learning,Multi-task learning,Group structure,Feature selection,Computer science,Artificial intelligence,Optimization problem,Machine learning,Sparse learning | Conference | 10535 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.35 |
References | Authors | |
18 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Meghana Kshirsagar | 1 | 104 | 5.08 |
| Eunho Yang | 2 | 132 | 27.43 |
| Aurelie C. Lozano | 3 | 145 | 20.21 |