Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 315

The DOI matches its Crossref record; 127 of the 127 references it cites were found in a registry or an index.

Structured Sparsity through Convex Optimization

Open access
Bach, Francis, Jenatton, Rodolphe, Mairal, Julien, Obozinski, Guillaume·2012·Statistical Science

Abstract

Sparse estimation methods are aimed at using or obtaining parsimonious representations of data or models. While naturally cast as a combinatorial optimization problem, variable or feature selection admits a convex relaxation through the regularization by the $\ell_{1}$-norm. In this paper, we consider situations where we are not only interested in sparsity, but where some structural prior knowledge is available as well. We show that the $\ell_{1}$-norm can then be extended to structured norms built on either disjoint or overlapping groups of variables, leading to a flexible framework that can deal with various structures. We present applications to unsupervised learning, for structured sparse principal component analysis and hierarchical dictionary learning, and to supervised learning in the context of nonlinear variable selection.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1214/12-sts394

Cites

127 of 127 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 127 references

Cited by

See all 315

Metadata

Authors
Bach, F., Jenatton, R., Mairal, J., & Obozinski, G.
Venue
Statistical Science
Published
2012-11-01
Volume
27
Issue
4
Pages
450-468
ISSN
0883-4237 (ISSN-L)
OpenAlex
W2138265962
Cited by
315
References
127
FWCI
29.96
Type
journal article
Language
en
Open access
bronze

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: Structured Sparsity through Convex Optimization. https://app.cochat.ai/papers/10.1214/12-sts394
The paper
Bach, F., Jenatton, R., Mairal, J., & Obozinski, G. (2012). Structured Sparsity through Convex Optimization. Statistical Science. https://doi.org/10.1214/12-sts394

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.