The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Accelerated Gradient Method for Multi-task Sparse Learning Problem
Open accessAbstract
Many real world learning problems can be recast as multi-task learning problems which utilize correlations among different tasks to obtain better generalization performance than learning each task individually. The feature selection problem in multi-task setting has many applications in fields of computer vision, text classification and bio-informatics. Generally, it can be realized by solving a L-1-infinity regularized optimization problem. And the solution automatically yields the joint sparsity among different tasks. However, due to the nonsmooth nature of the L-1-infinity norm, there lacks an efficient training algorithm for solving such problem with general convex loss functions. In this paper, we propose an accelerated gradient method based on an ``optimal'' first order black-box method named after Nesterov and provide the convergence rate for smooth convex loss functions. For nonsmooth convex loss functions, such as hinge loss, our method still has fast convergence rate empirically. Moreover, by exploiting the structure of the L-1-infinity ball, we solve the black-box oracle in Nesterov's method by a simple sorting scheme. Our method is suitable for large-scale multi-task learning problem since it only utilizes the first order information and is very easy to implement. Experimental results show that our method significantly outperforms the most state-of-the-art methods in both convergence speed and learning accuracy.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
Cited by
Robust visual tracking via multi-task sparse learning
Zhang, T., Ghanem, B., Liu, S., & Ahuja, N. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247908 · Cited by 647
Visual Classification With Multitask Joint Sparse Representation
Yuan, X.-T., Liu, X., & Yan, S. (2012) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2205006 · Cited by 364
Visual classification with multi-task joint sparse representation
Yuan, X.-T., & Yan, S. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539967 · Cited by 303
Initiative, T. A. D. N., Zu, C., Jie, B., Liu, M., Chen, S., Shen, D., & Zhang, D. (2016) · Brain Imaging and Behavior · doi:10.1007/s11682-015-9480-7 · Cited by 95
Metadata
- Authors
- Chen, X., Pan, W., Kwok, J. T., & Carbonell, J. G.
- Venue
- 2009 Ninth IEEE International Conference on Data Mining
- Publisher
- IEEE
- Published
- 2009-12
- Pages
- 746-751
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2135562430
- Cited by
- 176
- References
- 1
- FWCI
- 6.11
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Accelerated Gradient Method for Multi-task Sparse Learning Problem. https://app.cochat.ai/papers/10.1109/icdm.2009.128
- The paper
- Chen, X., Pan, W., Kwok, J. T., & Carbonell, J. G. (2009). Accelerated Gradient Method for Multi-task Sparse Learning Problem. 2009 Ninth IEEE International Conference on Data Mining. https://doi.org/10.1109/icdm.2009.128
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.