The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Group lasso with overlap and graph lasso
Abstract
We propose a new penalty function which, when used as regularization for empirical risk minimization procedures, leads to sparse estimators. The support of the sparse vector is typically a union of potentially overlapping groups of co-variates defined a priori, or a set of covariates which tend to be connected to each other when a graph of covariates is given. We study theoretical properties of the estimator, and illustrate its behavior on simulated and breast cancer gene expression data.
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
Subramanian, A., Tamayo, P., Mootha, V. K., Mukherjee, S., Ebert, B. L., Gillette, M. A., Paulovich, A., Pomeroy, S. L., Golub, T. R., Lander, E. S., et al. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0506580102 · Cited by 53,625
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
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
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
A Gene-Expression Signature as a Predictor of Survival in Breast Cancer
van de Vijver, M. J., He, Y. D., van 't Veer, L. J., Dai, H., Hart, A. A. M., Voskuil, D. W., Schreiber, G. J., Peterse, J. L., Roberts, C., Marton, M. J., et al. (2002) · New England Journal of Medicine · doi:10.1056/nejmoa021967 · Cited by 6,488
The Group Lasso for Logistic Regression
Meier, L., Van De Geer, S., & Bühlmann, P. (2008) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2007.00627.x · Cited by 1,674
Network‐based classification of breast cancer metastasis
Chuang, H., Lee, E., Liu, Y., Lee, D., & Ideker, T. (2007) · Molecular Systems Biology · doi:10.1038/msb4100180 · Cited by 1,431
Asymptotics for lasso-type estimators
Fu, W., & Knight, K. (2000) · The Annals of Statistics · doi:10.1214/aos/1015957397 · Cited by 1,276
On Model Selection Consistency of Lasso
ZhaoPeng, & Yubin, Y. (2006) · Journal of Machine Learning Research · doi:10.5555/1248547.1248637 · Cited by 996
Consistency of the group Lasso and multiple kernel learning
Bach, F. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0707.3390 · Cited by 669
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
“Group Lasso (Yuan and Lin 2006; Bach 2008; Jacob et al. 2009; Meier et al. 2008), which derives feature coefficients from certain groups to be small or exact zero, is a solution to this problem.”
BackgroundOnline Learning for Matrix Factorization and Sparse Coding
Mairal, J., Bach, F., Ponce, J., & Sapiro, G. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0908.0050 · Cited by 2,258
Theory-Guided Data Science: A New Paradigm for Scientific Discovery from Data
Karpatne, A., Atluri, G., Faghmous, J. H., Steinbach, M., Banerjee, A., Ganguly, A., Shekhar, S., Samatova, N., & Kumar, V. (2017) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2720168 · Cited by 1,752
Simon, N., Friedman, J., Hastie, T., & Tibshirani, R. (2013) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2012.681250 · Cited by 1,380
“” Jacob, Obozinski, and Vert (2009) gave a very nice fix for this issue by slightly reformulating the problem, but this more general framework is beyond the scope of our article.”
BackgroundHigh-Dimensional Statistics: A Non-Asymptotic Viewpoint
Wainwright, M. J. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108627771 · Cited by 882
Feature selection for classification: A review
Tang, J., Alelyani, S., & Liu, H. (2014) · doi:10.1201/b17320-7 · Cited by 757
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
Stability of feature selection algorithm: A review
Khaire, U. M., & Dhanalakshmi, R. (2022) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2019.06.012 · Cited by 630
Optimization with Sparsity-Inducing Penalties
Bach, F. (2011) · now publishers, Inc. eBooks · doi:10.1561/9781601985118 · Cited by 608
Quantum machine learning: a classical perspective
Ciliberto, C., Herbster, M., Ialongo, A. D., Pontil, M., Rocchetto, A., Severini, S., & Wossnig, L. (2018) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2017.0551 · Cited by 518
Liu, L., Larsson, E. G., Yu, W., Popovski, P., Stefanovic, C., & de Carvalho, E. (2018) · IEEE Signal Processing Magazine · doi:10.1109/msp.2018.2844952 · Cited by 510
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
A review on machine learning principles for multi-view biological data integration
Li, Y., Wu, F.-X., & Ngom, A. (2016) · Briefings in Bioinformatics · doi:10.1093/bib/bbw113 · Cited by 421
Direct Localization for Massive MIMO
Garcia, N., Wymeersch, H., Larsson, E. G., Haimovich, A. M., & Coulon, M. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2666779 · Cited by 379
Tree-Guided Group Lasso for Multi-Task Regression with Structured Sparsity
Kim, S., & Xing, E. P. (2018) · Figshare · doi:10.1184/r1/6476414 · Cited by 374
Laplacian Sparse Coding, Hypergraph Laplacian Sparse Coding, and Applications
Gao, S., Tsang, I. W.-H., & Chia, L.-T. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.63 · Cited by 357
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
Sparse Modeling for Image and Vision Processing
Mairal, J. (2014) · now publishers, Inc. eBooks · doi:10.1561/9781680830095 · Cited by 322
Structured Sparsity through Convex Optimization
Bach, F., Jenatton, R., Mairal, J., & Obozinski, G. (2012) · Statistical Science · doi:10.1214/12-sts394 · Cited by 315
Self-citationA Selective Review of Group Selection in High-Dimensional Models
Huang, J., Breheny, P., & Ma, S. (2012) · Statistical Science · doi:10.1214/12-sts392 · Cited by 300
A Unified Framework for High-Dimensional Analysis of $M$-Estimators with Decomposable Regularizers
Negahban, S. N., Ravikumar, P., Wainwright, M. J., & Yu, B. (2012) · Statistical Science · doi:10.1214/12-sts400 · Cited by 287
Structured Sparse Principal Component Analysis
Jenatton, R., Obozinski, G., & Bach, F. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0909.1440 · Cited by 277
Self-citationLearning with Structured Sparsity
Huang, J., Zhang, T., & Metaxas, D. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0903.3002 · Cited by 275
Learning Interactions via Hierarchical Group-Lasso Regularization
Lim, M., & Hastie, T. (2015) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2014.938812 · 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
Self-citationInterpretation of cancer mutations using a multiscale map of protein systems
Zheng, F., Kelly, M. R., Ramms, D. J., Heintschel, M. L., Tao, K., Tutuncuoglu, B., Lee, J. J., Ono, K., Foussard, H., Chen, M., et al. (2021) · Science · doi:10.1126/science.abf3067 · Cited by 81
“This model, HiSig, was inspired by the technique of overlapping group lasso regression (114), albeit with a different mathematical formulation.”
MethodA group lasso based sparse KNN classifier
Zheng, S., & Ding, C. (2020) · Pattern Recognition Letters · doi:10.1016/j.patrec.2019.12.020 · Cited by 22
Xie, L., He, B., Varathan, P., Nho, K., Risacher, S. L., Saykin, A. J., Salama, P., & Yan, J. (2021) · Briefings in Bioinformatics · doi:10.1093/bib/bbab121 · Cited by 16
Xie, L., Varathan, P., Nho, K., Saykin, A. J., Salama, P., & Yan, J. (2020) · PLOS ONE · doi:10.1371/journal.pone.0234748 · Cited by 9
Metadata
- Authors
- Jacob, L., Obozinski, G., & Vert, J.-P.
- Venue
- Proceedings of the 26th Annual International Conference on Machine Learning
- Publisher
- ACM
- Published
- 2009-06-14
- Pages
- 433-440
- OpenAlex
- W1970554427
- Cited by
- 833
- References
- 15
- FWCI
- 144.12
- 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.