Alternating direction multiplier method for matrix \(l_{2,1}\)-norm optimization in multitask feature learning problems (Q2007113)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Alternating direction multiplier method for matrix lā,1-norm optimization in multitask feature learning problems |
scientific article; zbMATH DE number 7259615
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Alternating direction multiplier method for matrix \(l_{2,1}\)-norm optimization in multitask feature learning problems |
scientific article; zbMATH DE number 7259615 |
Statements
Alternating direction multiplier method for matrix \(l_{2,1}\)-norm optimization in multitask feature learning problems (English)
0 references
12 October 2020
0 references
Summary: The joint feature selection problem can be resolved by solving a matrix \(l_{2,1}\)-norm minimization problem. For \(l_{2,1}\)-norm regularization, one of the most fascinating features is that some similar sparsity structures can be employed by multiple predictors. However, the nonsmooth nature of the problem brings great challenges to the problem. In this paper, an alternating direction multiplier method combined with the spectral gradient method is proposed for solving the matrix \(l_{2,1}\)-norm optimization problem involved with multitask feature learning. Numerical experiments show the effectiveness of the proposed algorithm.
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9005695581436157
0 references
0.8046960234642029
0 references
0.7903798818588257
0 references
0.784290075302124
0 references