The DOI matches its OpenAlex record.
Learning with Structured Sparsity
Abstract
This paper investigates a learning formulation called structured sparsity, which is a natural extension of the standard sparsity concept in statistical learning and compressive sensing. By allowing...
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
Cited by
Feature Selection: A Data Perspective
Li, J., Cheng, K., Wang, S., Morstatter, F., Trevino, R. P., Tang, J., & Liu, H. (2018) · ACM Computing Surveys · doi:10.1145/3136625 · Cited by 2,442
Feature Selection: A Data Perspective
Li, J., Cheng, K., Wang, S., Morstatter, F., Treviño, R. P., Tang, J., & Liu, H. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1601.07996 · Cited by 739
Radar and Communication Coexistence: An Overview: A Review of Recent Methods
Zheng, L., Lops, M., Eldar, Y. C., & Wang, X. (2019) · IEEE Signal Processing Magazine · doi:10.1109/msp.2019.2907329 · Cited by 659
Feature Selection Based on Structured Sparsity: A Comprehensive Study
Gui, J., Sun, Z., Ji, S., Tao, D., & Tan, T. (2017) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2016.2551724 · Cited by 335
Structured Sparsity through Convex Optimization
Bach, F., Jenatton, R., Mairal, J., & Obozinski, G. (2012) · Statistical Science · doi:10.1214/12-sts394 · Cited by 315
Metadata
- Authors
- HuangJunzhou, ZhangTong, & MetaxasDimitris
- Venue
- Journal of Machine Learning Research
- Publisher
- The MIT Press
- Published
- 2011-11-01
- ISSN
- 1532-4435 (ISSN-L)
- DOI
- 10.5555/1953048.2078213
- OpenAlex
- W3005708632
- Cited by
- 166
- References
- 0
- FWCI
- 10.32
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Learning with Structured Sparsity. https://app.cochat.ai/papers/10.5555/1953048.2078213
- The paper
- HuangJunzhou, ZhangTong, & MetaxasDimitris. (2011). Learning with Structured Sparsity. Journal of Machine Learning Research. https://doi.org/10.5555/1953048.2078213
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.