The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
DASSO: Connections Between the Dantzig Selector and Lasso
Open accessAbstract
Summary: We propose a new algorithm, DASSO, for fitting the entire coefficient path of the Dantzig selector with a similar computational cost to the least angle regression algorithm that is used to compute the lasso. DASSO efficiently constructs a piecewise linear path through a sequential simplex-like algorithm, which is remarkably similar to the least angle regression algorithm. Comparison of the two algorithms sheds new light on the question of how the lasso and Dantzig selector are related. In addition, we provide theoretical conditions on the design matrix X under which the lasso and Dantzig selector coefficient estimates will be identical for certain tuning parameters. As a consequence, in many instances, we can extend the powerful non-asymptotic bounds that have been developed for the Dantzig selector to the lasso. Finally, through empirical studies of simulated and real world data sets we show that in practice, when the bounds hold for the Dantzig selector, they almost always also hold for the lasso.
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
Regularization and Variable Selection Via the Elastic Net
Zou, H., & Hastie, T. (2005) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00503.x · Cited by 20,957
Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
The adaptive lasso and its oracle properties
Zou, H. (2006) · Journal of the American Statistical Association · doi:10.1198/016214506000000735 · Cited by 7,470
High-dimensional graphs and variable selection with the Lasso
Meinshausen, N., & Bühlmann, P. (2006) · The Annals of Statistics · doi:10.1214/009053606000000281 · Cited by 2,521 · cited 1×
“Meinshausen and Buhlmann (2006) , Zhang and Huang (2007) and Zhao and Yu (2006).”
BackgroundA generalized Dantzig selector with shrinkage tuning
James, G. M., & Radchenko, P. (2009) · Biometrika · doi:10.1093/biomet/asp013 · Cited by 67
Self-citation
Cited by
Feature selection for classification: A review
Tang, J., Alelyani, S., & Liu, H. (2014) · doi:10.1201/b17320-7 · Cited by 757
Templates for convex cone problems with applications to sparse signal recovery
Becker, S. R., Candès, E. J., & Grant, M. C. (2011) · Mathematical Programming Computation · doi:10.1007/s12532-011-0029-5 · Cited by 608
The solution path of the generalized lasso
Tibshirani, R. J., & Taylor, J. (2011) · The Annals of Statistics · doi:10.1214/11-aos878 · Cited by 553
High-dimensional semiparametric Gaussian copula graphical models
Liu, H., Han, F., Yuan, M., Lafferty, J., & Wasserman, L. (2012) · The Annals of Statistics · doi:10.1214/12-aos1037 · Cited by 507
A unified approach to model selection and sparse recovery using regularized least squares
Lv, J., & Fan, Y. (2009) · The Annals of Statistics · doi:10.1214/09-aos683 · Cited by 252
Self-citation
Metadata
- Authors
- James, G. M., Radchenko, P., & Lv, J.
- Venue
- Journal of the Royal Statistical Society Series B: Statistical Methodology
- Publisher
- Oxford University Press (OUP)
- Published
- 2008-07-24
- Volume
- 71
- Issue
- 1
- Pages
- 127-142
- ISSN
- 1369-7412 (ISSN-L)
- 1467-9868
- OpenAlex
- W2138170572
- Cited by
- 171
- References
- 5
- FWCI
- 20.18
- 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: DASSO: Connections Between the Dantzig Selector and Lasso. https://app.cochat.ai/papers/10.1111/j.1467-9868.2008.00668.x
- The paper
- James, G. M., Radchenko, P., & Lv, J. (2009). DASSO: Connections Between the Dantzig Selector and Lasso. Journal of the Royal Statistical Society Series B: Statistical Methodology. https://doi.org/10.1111/j.1467-9868.2008.00668.x
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.