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 accessAbstract
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.
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
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
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
(2003) · Journal of Machine Learning Research · doi:10.5555/944919.944937 · Cited by 32,337
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
A Wavelet Tour of Signal Processing
(1999) · Elsevier eBooks · doi:10.1016/b978-0-12-466606-1.x5000-4 · Cited by 16,227
Nonlinear total variation based noise removal algorithms
Rudin, L. I., Osher, S., & Fatemi, E. (1992) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(92)90242-f · Cited by 15,704
Learning the parts of objects by non-negative matrix factorization
Lee, D. D., & Seung, H. S. (1999) · Nature · doi:10.1038/44565 · Cited by 13,868
Blei, D. M., Ng, A. Y., & Jordan, M. I. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0082 · Cited by 12,223
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
$rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
Aharon, M., Elad, M., & Bruckstein, A. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.881199 · Cited by 9,451
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
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
Decoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
Fast approximate energy minimization via graph cuts
Boykov, Y., Veksler, O., & Zabih, R. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.969114 · Cited by 6,988
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
Kernel Methods for Pattern Analysis
Shawe-Taylor, J., & Cristianini, N. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511809682 · Cited by 6,587
Griffiths, T. L., & Steyvers, M. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307752101 · Cited by 6,049
Emergence of simple-cell receptive field properties by learning a sparse code for natural images
Olshausen, B. A., & Field, D. J. (1996) · Nature · doi:10.1038/381607a0 · Cited by 5,694
Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries
Elad, M., & Aharon, M. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2006.881969 · Cited by 5,321
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (2001) · SIAM Review · doi:10.1137/s003614450037906x · Cited by 5,085
Adapting to Unknown Smoothness via Wavelet Shrinkage
Donoho, D. L., & Johnstone, I. M. (1995) · Journal of the American Statistical Association · doi:10.1080/01621459.1995.10476626 · Cited by 4,630
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
Needell, D., & Tropp, J. A. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2008.07.002 · Cited by 4,326
Sparse coding with an overcomplete basis set: A strategy employed by V1?
Olshausen, B. A., & Field, D. J. (1997) · Vision Research · doi:10.1016/s0042-6989(97)00169-7 · Cited by 3,642
Greed is Good: Algorithmic Results for Sparse Approximation
Tropp, J. A. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834793 · Cited by 3,635
Introductory Lectures on Convex Optimization: A Basic Course
Nesterov, Y. E. (2014) · Medical Entomology and Zoology · Cited by 3,557
Martinez, A. M., & Kak, A. C. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.908974 · Cited by 3,249
Sparse Principal Component Analysis
Zou, H., Hastie, T., & Tibshirani, R. (2006) · Journal of Computational and Graphical Statistics · doi:10.1198/106186006x113430 · Cited by 3,152
Sparsity and Smoothness Via the Fused Lasso
Tibshirani, R., Saunders, M., Rosset, S., Zhu, J., & Knight, K. (2005) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00490.x · Cited by 2,724
Introductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698
High dimensional graphs and variable selection with the Lasso
Meinshausen, N., & Bühlmann, P. (2006) · Cited by 2,539
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
Simultaneous analysis of Lasso and Dantzig selector
Bickel, P. J., Ritov, Y., & Tsybakov, A. B. (2009) · The Annals of Statistics · doi:10.1214/08-aos620 · Cited by 2,396
Efficient sparse coding algorithms
Lee, H., Battle, A., Raina, R., & Ng, A. Y. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0105 · Cited by 2,394
Online 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
Self-citationProximal Splitting Methods in Signal Processing
Combettes, P. L., & Pesquet, J.-C. (2011) · Springer Optimization and Its Applications · doi:10.1007/978-1-4419-9569-8_10 · Cited by 2,183
Pathwise coordinate optimization
Friedman, J., Hastie, T., Höfling, H., & Tibshirani, R. (2007) · The Annals of Applied Statistics · doi:10.1214/07-aoas131 · Cited by 1,895
Sparse Reconstruction by Separable Approximation
Wright, S. J., Nowak, R. D., & Figueiredo, M. A. T. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2016892 · Cited by 1,854
Mallat, S. (1999) · A Wavelet Tour of Signal Processing · doi:10.1016/b978-012466606-1/50008-8 · Cited by 1,770
Non-local sparse models for image restoration
Mairal, J., Bach, F., Ponce, J., Sapiro, G., & Zisserman, A. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459452 · Cited by 1,666
Self-citationWitten, D. M., Tibshirani, R., & Hastie, T. (2009) · Biostatistics · doi:10.1093/biostatistics/kxp008 · Cited by 1,535
Just relax: convex programming methods for identifying sparse signals in noise
Tropp, J. A. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.864420 · Cited by 1,407
Model-Based Compressive Sensing
Baraniuk, R. G., Cevher, V., Duarte, M. F., & Hegde, C. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2040894 · Cited by 1,308
Some results on Tchebycheffian spline functions
Kimeldorf, G., & Wahba, G. (1971) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(71)90184-3 · Cited by 1,254
Wainwright, M. J. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2016018 · Cited by 1,198
Submodular Functions and Optimization
(2005) · Annals of discrete mathematics · doi:10.1016/s0167-5060(05)x8001-3 · Cited by 1,145
A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
Negahban, S. N. (2011) · Cited by 1,099
On Model Selection Consistency of Lasso
ZhaoPeng, & Yubin, Y. (2006) · Journal of Machine Learning Research · doi:10.5555/1248547.1248637 · Cited by 996
Supervised Dictionary Learning
Mairal, J., Bach, F., Ponce, J., Sapiro, G., & Zisserman, A. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0809.3083 · Cited by 938
Self-citationHierarchical Topic Models and the Nested Chinese Restaurant Process
Griffiths, T. L., Jordan, M. I., Tenenbaum, J. B., & Blei, D. M. (2003) · Cited by 912
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Becker, S., Bobin, J., & Candès, E. J. (2009) · Cited by 897
Gradient methods for minimizing composite objective function
Nesterov, Y. E. (2007) · Cited by 867
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Becker, S., Bobin, J., & Candès, E. J. (2011) · SIAM Journal on Imaging Sciences · doi:10.1137/090756855 · Cited by 848
Group lasso with overlap and graph lasso
Jacob, L., Obozinski, G., & Vert, J.-P. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553431 · Cited by 833
Self-citationA Modified Principal Component Technique Based on the LASSO
Jolliffe, I. T., Trendafilov, N. T., & Uddin, M. (2003) · Journal of Computational and Graphical Statistics · doi:10.1198/1061860032148 · Cited by 809
Convex Analysis and Nonlinear Optimization
Borwein, J. M., & Lewis, A. S. (2006) · CMS books in mathematics · doi:10.1007/978-0-387-31256-9 · Cited by 780
Coordinate descent algorithms for lasso penalized regressionPreprint
Wu, T. T., & Lange, K. L. (2008) · Cited by 740
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
Self-citationConsistency of the group Lasso and multiple kernel learning
Bach, F. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0707.3390 · Cited by 669
Self-citationThe nested chinese restaurant process and bayesian nonparametric inference of topic hierarchies
Blei, D. M., Griffiths, T. L., & Jordan, M. I. (2010) · Journal of the ACM · doi:10.1145/1667053.1667056 · Cited by 646
The composite absolute penalties family for grouped and hierarchical variable selection
Zhao, P., Rocha, G., & Yu, B. (2009) · The Annals of Statistics · doi:10.1214/07-aos584 · Cited by 631
A note on the group lasso and a sparse group lasso
Friedman, J. H., Hastie, T. J., & Tibshirani, R. J. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1001.0736 · Cited by 619
Optimization with Sparsity-Inducing Penalties
Bach, F. (2011) · now publishers, Inc. eBooks · doi:10.1561/9781601985118 · Cited by 608
Self-citationSignal Reconstruction From Noisy Random Projections
Haupt, J., & Nowak, R. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.880031 · Cited by 608
Coordinate descent algorithms for lasso penalized regression
Wu, T. T., & Lange, K. (2008) · The Annals of Applied Statistics · doi:10.1214/07-aoas147 · Cited by 563
Component selection and smoothing in multivariate nonparametric regression
Lin, Y., & Zhang, H. H. (2006) · The Annals of Statistics · doi:10.1214/009053606000000722 · Cited by 550
Ravikumar, P., Lafferty, J., Liu, H., & Wasserman, L. (2009) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2009.00718.x · Cited by 535
Huang, J., & Zhang, T. (2010) · The Annals of Statistics · doi:10.1214/09-aos778 · Cited by 521
Fonctions convexes duales et points proximaux dans un espace hilbertien
Moreau, J. J. (1962) · HAL (Le Centre pour la Communication Scientifique Directe) · Cited by 501
Non-Asymptotic Analysis of Stochastic Approximation Algorithms for Machine Learning
Bach, F., & Moulines, É. (2011) · Cited by 488
Self-citationHigh Dimensional Inverse Covariance Matrix Estimation via Linear Programming
Yuan, M. (2010) · Journal of Machine Learning Research · doi:10.5555/1756006.1859930 · Cited by 468
Bondell, H. D., & Reich, B. J. (2008) · Biometrics · doi:10.1111/j.1541-0420.2007.00843.x · Cited by 465
Joint covariate selection and joint subspace selection for multiple classification problems
Obozinski, G., Taskar, B., & Jordan, M. I. (2010) · Statistics and Computing · doi:10.1007/s11222-008-9111-x · Cited by 451
Self-citationStructured 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
Self-citationConvex Analysis and Nonlinear Optimization
Borwein, J. M., & Lewis, A. S. (2000) · Springer eBooks · doi:10.1007/978-1-4757-9859-3 · Cited by 394
Simultaneous Variable Selection
Turlach, B. A., Venables, W. N., & Wright, S. J. (2005) · Technometrics · doi:10.1198/004017005000000139 · Cited by 386
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
Support union recovery in high-dimensional multivariate regression
Obozinski, G., Wainwright, M. J., & Jordan, M. I. (2011) · The Annals of Statistics · doi:10.1214/09-aos776 · Cited by 350
Self-citationNear-optimal Nonmyopic Value of Information in Graphical Models
Krause, A., & Guestrin, C. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.1394 · Cited by 349
Oracle inequalities and optimal inference under group sparsity
Lounici, K., Pontil, M., van de Geer, S., & Tsybakov, A. B. (2011) · The Annals of Statistics · doi:10.1214/11-aos896 · Cited by 341
Total Variation Minimization and a Class of Binary MRF Models
Chambolle, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11585978_10 · Cited by 324
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 invariant features through topographic filter maps
Kavukcuoglu, K., Ranzato, M., Fergus, R., & LeCun, Y. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206545 · Cited by 274
Learning with Submodular Functions: A Convex Optimization Perspective
Bach, F. (2013) · now publishers, Inc. eBooks · doi:10.1561/9781601987570 · Cited by 273
Self-citationProximal 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-citationOptimal Solutions for Sparse Principal Component Analysis
d’Aspremont, A., Bach, F., & Ghaoui, L. E. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0707.0705 · Cited by 250
Self-citationConvergence Rates of Inexact Proximal-Gradient Methods for Convex Optimization
Schmidt, M., Roux, N. L., & Bach, F. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1109.2415 · Cited by 237
Self-citationSmoothing proximal gradient method for general structured sparse regression
Chen, X., Lin, Q., Kim, S., Carbonell, J. G., & Xing, E. P. (2012) · The Annals of Applied Statistics · doi:10.1214/11-aoas514 · Cited by 226
Liu, H., Palatucci, M., & Zhang, J. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553458 · Cited by 216
Learning with Submodular Functions: A Convex Optimization Perspective
Bach, F. (2013) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000039 · Cited by 211
Self-citationSome sharp performance bounds for least squares regression with L1 regularizationPreprint
Zhang, T. (2009) · Cited by 208
Spectral Bounds for Sparse PCA: Exact and Greedy Algorithms
Moghaddam, B., Weiss, Y., & Avidan, S. (2005) · Cited by 207
Some sharp performance bounds for least squares regression with L1 regularization
Zhang, T. (2009) · The Annals of Statistics · doi:10.1214/08-aos659 · Cited by 200
Grouped and Hierarchical Model Selection through Composite Absolute Penalties
Zhao, P., Rocha, G. V., & Yu, B. (2007) · Cited by 196
Deflation Methods for Sparse PCA
Mackey, L. W. (2008) · Cited by 193
Exclusive Lasso for Multi-task Feature Selection
Zhou, Y., Jin, R., & Hoi, S. C. H. (2010) · Cited by 190
Group Lasso with Overlaps: the Latent Group Lasso approachPreprint
Obozinski, G., Jacob, L., & Vert, J. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1110.0413 · Cited by 186
Self-citationTaking Advantage of Sparsity in Multi-Task Learning
Lounici, K., Pontil, M., Tsybakov, A. B., & van de Geer, S. (2009) · Cited by 179
A multivariate regression approach to association analysis of a quantitative trait network
Kim, S., Sohn, K.-A., & Xing, E. P. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp218 · Cited by 173
Exploring Large Feature Spaces with Hierarchical Multiple Kernel Learning
Bach, F. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0809.1493 · Cited by 172
Self-citationProximal Splitting Methods in Signal ProcessingPreprint
Combettes, P. L., & Pesquet, J.-C. (2009) · doi:10.48550/arxiv.0912.3522 · Cited by 169
Sparse Signal Recovery Using Markov Random Fields
Cevher, V., Hegde, C., Duarte, M. F., & Baraniuk, R. G. (2009) · Defense Technical Information Center (DTIC) · doi:10.21236/ada520187 · Cited by 167
Learning with Structured Sparsity
HuangJunzhou, ZhangTong, & MetaxasDimitris (2011) · Journal of Machine Learning Research · doi:10.5555/1953048.2078213 · Cited by 166
Zass, R., & Shashua, A. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0200 · Cited by 165
Variational Extensions to EM and Multinomial PCA
Buntine, W. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36755-1_3 · Cited by 163
Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
Shalev‐Shwartz, S., Srebro, N., & Zhang, T. (2010) · SIAM Journal on Optimization · doi:10.1137/090759574 · Cited by 152
A Unified View of Matrix Factorization Models
Singh, A. P., & Gordon, G. J. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-87481-2_24 · Cited by 150
Network Flow Algorithms for Structured SparsityPreprint
Mairal, J., Jenatton, R., Obozinski, G., & Bach, F. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1008.5209 · Cited by 148
Self-citationStructured sparsity-inducing norms through submodular functionsPreprint
Bach, F. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1008.4220 · Cited by 136
Self-citationGrouping Pursuit Through a Regularization Solution Surface
Shen, X., & Huang, H. (2010) · Journal of the American Statistical Association · doi:10.1198/jasa.2010.tm09380 · Cited by 135
Convex Sparse Matrix FactorizationsPreprint
Bach, F., Mairal, J., & Ponce, J. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0812.1869 · Cited by 129
Self-citationTree-Structured Stick Breaking for Hierarchical Data
Ghahramani, Z., Jordan, M. I., & Adams, R. P. (2010) · Cited by 128
Negahban, S. N., & Wainwright, M. J. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2144150 · Cited by 122
An efficient projection for l 1 , ∞ regularization
Quattoni, A., Carreras, X., Collins, M., & Darrell, T. (2009) · International Conference on Machine Learning · doi:10.1145/1553374.1553484 · Cited by 113
Convex and Network Flow Optimization for Structured SparsityPreprint
Mairal, J., Jenatton, R., Obozinski, G., & Bach, F. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1104.1872 · Cited by 87
Self-citationClassification of arrayCGH data using fused SVM
Rapaport, F., Barillot, E., & Vert, J. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btn188 · Cited by 85
Multiscale Mining of fMRI Data with Hierarchical Structured Sparsity
Jenatton, R., Gramfort, A., Michel, V., Obozinski, G., Eger, E., Bach, F., & Thirion, B. (2012) · SIAM Journal on Imaging Sciences · doi:10.1137/110832380 · Cited by 82
Self-citationEfficient Sparse Modeling With Automatic Feature Grouping
Zhong, W., & Kwok, J. T.-Y. (2012) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2012.2200262 · Cited by 75
Sparse coding for machine learning, image processing and computer vision
Mairal, J. (2010) · theses.fr (ABES) · doi:10.70675/72faf70fze619z44adzb071z7e7ca54a5a67 · Cited by 74
Self-citationConvex Relaxation for Combinatorial PenaltiesPreprint
Obozinski, G., & Bach, F. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1205.1240 · Cited by 46
Self-citationCollaborative hierarchical sparse modeling
Sprechmann, P., Ramírez, I., Sapiro, G., & Eldar, Y. C. (2010) · Conference on Information Sciences and Systems · doi:10.1109/ciss.2010.5464845 · Cited by 44
Theoretical properties of the overlapping groups lasso
Percival, D. (2012) · Electronic Journal of Statistics · doi:10.1214/12-ejs672 · Cited by 36
Multi-scale Mining of fMRI Data with Hierarchical Structured Sparsity
Jenatton, R., Gramfort, A., Michel, V., Obozinski, G., Bach, F., & Thirion, B. (2011) · International Workshop on Pattern Recognition in NeuroImaging · doi:10.1109/prni.2011.15 · Cited by 29
Self-citationBoosting with Spatial Regularization
Xi, Y., Hasson, U., Ramadge, P. J., & Xiang, Z. J. (2009) · neural information processing systems · Cited by 29
Cited by
Representation Learning: A Review and New Perspectives
Bengio, Y., Courville, A., & Vincent, P. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.50 · Cited by 13,001
Machine Learning for Survival Analysis: A Survey
Wang, P., Li, Y., & Reddy, C. K. (2019) · ACM Computing Surveys · doi:10.1145/3214306 · Cited by 691
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
Deep Learning of Representations: Looking Forward
Bengio, Y. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-39593-2_1 · Cited by 513
Xu, T., Feng, Z.-H., Wu, X.-J., & Kittler, J. (2019) · IEEE Transactions on Image Processing · doi:10.1109/tip.2019.2919201 · Cited by 412
Metadata
- Authors
- Bach, F., Jenatton, R., Mairal, J., & Obozinski, G.
- Venue
- Statistical Science
- Publisher
- Institute of Mathematical Statistics
- 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
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.