The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Learning with structured sparsity
Abstract
This paper investigates a new learning formulation called structured sparsity, which is a natural extension of the standard sparsity concept in statistical learning and compressive sensing. By allowing arbitrary structures on the feature set, this concept generalizes the group sparsity idea. A general theory is developed for learning with structured sparsity, based on the notion of coding complexity associated with the structure. Moreover, a structured greedy algorithm is proposed to efficiently solve the structured sparsity problem. Experiments demonstrate the advantage of structured sparsity over standard sparsity.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
Model Selection and Estimation in Regression with Grouped Variables
Yuan, M., & Lin, Y. (2006) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00532.x · Cited by 7,261
Cited by
Data-Driven Intelligent Transportation Systems: A Survey
Zhang, J., Wang, F.-Y., Wang, K., Lin, W.-H., Xu, X., & Chen, C. (2011) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2011.2158001 · Cited by 1,817
“idea [112].”
Feature selection for classification: A review
Tang, J., Alelyani, S., & Liu, H. (2014) · doi:10.1201/b17320-7 · Cited by 757
Optimization with Sparsity-Inducing Penalties
Bach, F., Jenatton, R., Mairal, J., & Obozinski, G. (2025) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000015 · Cited by 730
Traditional and recent approaches in background modeling for foreground detection: An overview
Bouwmans, T. (2014) · Computer Science Review · doi:10.1016/j.cosrev.2014.04.001 · Cited by 676
Sensor Technologies for Intelligent Transportation Systems
Guerrero-Ibáñez, J., Zeadally, S., & Contreras-Castillo, J. (2018) · Sensors · doi:10.3390/s18041212 · Cited by 637
Optimization with Sparsity-Inducing Penalties
Bach, F. (2011) · now publishers, Inc. eBooks · doi:10.1561/9781601985118 · Cited by 608
Compressive Sensing via Nonlocal Low-Rank Regularization
Dong, W., Shi, G., Li, X., Ma, Y., & Huang, F. (2014) · IEEE Transactions on Image Processing · doi:10.1109/tip.2014.2329449 · Cited by 598
Yu, G., Sapiro, G., & Mallat, S. (2012) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2176743 · Cited by 561
Extension of SBL Algorithms for the Recovery of Block Sparse Signals With Intra-Block Correlation
Zhang, Z., & Rao, B. D. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2241055 · Cited by 558
Structured Variable Selection with Sparsity-Inducing Norms
Jenatton, R., Audibert, J.-Y., & Bach, F. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0904.3523 · Cited by 431
Yang, J., Luo, L., Qian, J., Tai, Y., Zhang, F., & Xu, Y. (2017) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2016.2535218 · Cited by 360
Exploiting Geographical Neighborhood Characteristics for Location Recommendation
Liu, Y., Wei, W., Sun, A., & Miao, C. (2014) · Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management · doi:10.1145/2661829.2662002 · Cited by 345
Zhang, Z., Jung, T.-P., Makeig, S., & Rao, B. D. (2013) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2012.2226175 · Cited by 340
Super-Resolution With Sparse Mixing Estimators
Mallat, S., & Yu, G. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2049927 · Cited by 296
Tank, A., Covert, I., Foti, N., Shojaie, A., & Fox, E. B. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2021.3065601 · Cited by 282
Structured Sparse Principal Component Analysis
Jenatton, R., Obozinski, G., & Bach, F. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0909.1440 · Cited by 277
Learning with Submodular Functions: A Convex Optimization Perspective
Bach, F. (2013) · now publishers, Inc. eBooks · doi:10.1561/9781601987570 · Cited by 273
Proximal Methods for Hierarchical Sparse Coding
Jenatton, R., Mairal, J., Obozinski, G., & Bach, F. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1009.2139 · Cited by 272
Bouwmans, T., Sobral, A., Javed, S., Jung, S. K., & Zahzah, E.-H. (2017) · Computer Science Review · doi:10.1016/j.cosrev.2016.11.001 · Cited by 267
Metadata
- Authors
- Huang, J., Zhang, T., & Metaxas, D.
- Venue
- Proceedings of the 26th Annual International Conference on Machine Learning
- Publisher
- ACM
- Published
- 2009-06-14
- Pages
- 417-424
- OpenAlex
- W2119330592
- Cited by
- 182
- References
- 2
- FWCI
- 59.08
- Type
- conference paper
- Language
- en
- Open access
- closed
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
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.