The DOI matches its Crossref record; 143 of the 143 references it cites were found in a registry or an index.
Optimization with Sparsity-Inducing Penalties
Abstract
Sparse estimation methods are aimed at using or obtaining parsimonious representations of data or models. They were first dedicated to linear variable selection but numerous extensions have now emerged such as structured sparsity or kernel selection. It turns out that many of the related estimation problems can be cast as convex optimization problems by regularizing the empirical risk with appropriate nonsmooth norms. Optimization with Sparsity-Inducing Penalties presents optimization tools and techniques dedicated to such sparsity-inducing penalties from a general perspective. It covers proximal methods, block-coordinate descent, reweighted ?2-penalized techniques, working-set and homotopy methods, as well as non-convex formulations and extensions, and provides an extensive set of experiments to compare various algorithms from a computational point of view. The presentation of Optimization with Sparsity-Inducing Penalties is essentially based on existing literature, but the process of constructing a general framework leads naturally to new results, connections and points of view. It is an ideal reference on the topic for anyone working in machine learning and related areas.
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
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
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
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
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
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
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
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
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
$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
Robust Face Recognition via Sparse Representation
Wright, J., Yang, A. Y., Ganesh, A., Sastry, S. S., & Ma, Y. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.79 · Cited by 9,388
Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
Matching pursuits with time-frequency dictionaries
Mallat, S. G., & Zhang, Z. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.258082 · Cited by 9,112
(2006) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/978-0-387-40065-5 · Cited by 9,008
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Fan, J., & Li, R. (2001) · Journal of the American Statistical Association · doi:10.1198/016214501753382273 · Cited by 8,900
(2010) · Cited by 8,261
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
Kernel Methods for Pattern Analysis
Shawe-Taylor, J., & Cristianini, N. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511809682 · Cited by 6,587
A Singular Value Thresholding Algorithm for Matrix Completion
Cai, J.-F., Candès, E. J., & Shen, Z. (2010) · SIAM Journal on Optimization · doi:10.1137/080738970 · Cited by 5,809
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
Hierarchical Clustering Schemes
Johnson, S. C. (1967) · Psychometrika · doi:10.1007/bf02289588 · Cited by 4,897
Enhancing Sparsity by Reweighted ℓ 1 Minimization
Candès, E. J., Wakin, M. B., & Boyd, S. P. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9045-x · Cited by 4,863
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
Bayesian Learning for Neural Networks
Neal, R. M. (1996) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-0745-0 · Cited by 4,276
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
Beckman, R. J. (1987) · Technometrics · doi:10.1080/00401706.1987.10488195 · Cited by 2,835
Sparse Approximate Solutions to Linear Systems
Natarajan, B. K. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792240406 · Cited by 2,783
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
Signal Recovery by Proximal Forward-Backward Splitting
Combettes, P. L., & Wajs, V. R. (2005) · Multiscale Modeling & Simulation · doi:10.1137/050626090 · Cited by 2,678
Weik, M. H. (2000) · Computer Science and Communications Dictionary · doi:10.1007/1-4020-0613-6_12436 · Cited by 2,570
Smooth minimization of non-smooth functions
Nesterov, Y. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0552-5 · Cited by 2,455
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-citationAdaptive Algorithms and Stochastic Approximations
Benveniste, A., Métivier, M., & Priouret, P. (1990) · Springer eBooks · doi:10.1007/978-3-642-75894-2 · Cited by 2,006
Splitting Algorithms for the Sum of Two Nonlinear Operators
Lions, P. L., & Mercier, B. (1979) · SIAM Journal on Numerical Analysis · doi:10.1137/0716071 · Cited by 1,972
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
Lectures on Stochastic Programming: Modeling and Theory
Shapiro, A., Dentcheva, D., & Ruszczyński, A. (2009) · Cited by 1,735
Sparse Bayesian Learning for Basis Selection
Wipf, D. P., & Rao, B. D. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.831016 · Cited by 1,559
Convex multi-task feature learning
Argyriou, A., Evgeniou, T., & Pontil, M. (2008) · Machine Learning · doi:10.1007/s10994-007-5040-8 · Cited by 1,528
Multiple kernel learning, conic duality, and the SMO algorithm
Bach, F. R., Lanckriet, G. R. G., & Jordan, M. I. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015424 · Cited by 1,453
Self-citationAlgorithms for simultaneous sparse approximation. Part I: Greedy pursuit
Tropp, J. A., Gilbert, A. C., & Strauss, M. J. (2006) · Signal Processing · doi:10.1016/j.sigpro.2005.05.030 · Cited by 1,347
Argyriou, A., Evgeniou, T., & Pontil, M. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0010 · Cited by 1,333
Iteratively reweighted least squares minimization for sparse recovery
Daubechies, I., DeVore, R., Fornasier, M., & Güntürk, C. S. (2010) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20303 · Cited by 1,295
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
Method of optimal directions for frame design
Engan, K., Aase, S. O., & Hakon Husoy, J. (1999) · 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258) · doi:10.1109/icassp.1999.760624 · Cited by 1,253
Large Scale Multiple Kernel Learning
Sonnenburg, S., Rätsch, G., Schäfer, C., & Schölkopf, B. (2006) · MPG.PuRe (Max Planck Society) · doi:10.5555/1248547.1248604 · Cited by 1,201
Wainwright, M. J. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2016018 · Cited by 1,198
Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
Nesterov, Y. (2012) · SIAM Journal on Optimization · doi:10.1137/100802001 · Cited by 1,187
The Tradeoffs of Large-Scale Learning
Bottou, L., & Bousquet, O. (2011) · Optimization for Machine Learning · doi:10.7551/mitpress/8996.003.0015 · Cited by 1,128
Penalized Regressions: The Bridge versus the Lasso
Fu, W. J. (1998) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.1998.10474784 · Cited by 1,092
Spike and slab variable selection: Frequentist and Bayesian strategies
Ishwaran, H., & Rao, J. S. (2005) · The Annals of Statistics · doi:10.1214/009053604000001147 · Cited by 1,033
Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics
Glowinski, R., & Tallec, P. L. (1989) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970838 · Cited by 1,015
On Model Selection Consistency of Lasso
ZhaoPeng, & Yubin, Y. (2006) · Journal of Machine Learning Research · doi:10.5555/1248547.1248637 · Cited by 996
Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics.
Oden, J. T., Glowinski, R., & Tallec, P. L. (1992) · Mathematics of Computation · doi:10.2307/2153048 · Cited by 972
Maximum-Margin Matrix Factorization
Srebro, N., Rennie, J. D. M., & Jaakkola, T. (2004) · Cited by 962
A rank minimization heuristic with application to minimum order system approximation
Fazel, M., Hindi, H., & Boyd, S. P. (2001) · Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148) · doi:10.1109/acc.2001.945730 · Cited by 956
The Convex Geometry of Linear Inverse Problems
Chandrasekaran, V., Recht, B., Parrilo, P. A., & Willsky, A. S. (2010) · Cited by 921
Sparse multinomial logistic regression: fast algorithms and generalization bounds
Krishnapuram, B., Carin, L., Figueiredo, M. A. T., & Hartemink, A. J. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.127 · Cited by 877
Gradient methods for minimizing composite objective function
Nesterov, Y. E. (2007) · Cited by 867
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
Large-Scale Bayesian Logistic Regression for Text Categorization
Genkin, A., Lewis, D. D., & Madigan, D. (2007) · Technometrics · doi:10.1198/004017007000000245 · Cited by 808
Coordinate descent algorithms for lasso penalized regressionPreprint
Wu, T. T., & Lange, K. L. (2008) · Cited by 735
A coordinate gradient descent method for nonsmooth separable minimization
Tseng, P., & Yun, S. (2009) · Mathematical Programming · doi:10.1007/s10107-007-0170-0 · Cited by 728
Osborne, M. R., Presnell, B., & Turlach, B. A. (2000) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2000.10474883 · Cited by 696
A statistical framework for genomic data fusion
Lanckriet, G. R. G., De Bie, T., Cristianini, N., Jordan, M. I., & Noble, W. S. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth294 · Cited by 671
Consistency 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 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
Dual Averaging Method for Regularized Stochastic Learning and Online Optimization
Xiao, L. (2009) · Cited by 574
An Interior-Point Method for Large-Scale '1-Regularized Logistic Regression
Koh, K., Kim, S.-J., & Boyd, S. (2007) · Cited by 549
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
Fixed-Point Algorithms for Inverse Problems in Science and Engineering
Bauschke, H. H., Burachik, R. S., Combettes, P. L., Elser, V., Luke, D. R., & Wolkowicz, H. (2011) · Springer optimization and its applications · doi:10.1007/978-1-4419-9569-8 · Cited by 508
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
Tseng, P. (1991) · SIAM Journal on Control and Optimization · doi:10.1137/0329006 · Cited by 467
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
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
Self-citationA simple and efficient algorithm for gene selection using sparse logistic regression
Shevade, S. K., & Keerthi, S. S. (2003) · Bioinformatics · doi:10.1093/bioinformatics/btg308 · Cited by 401
Convex 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
Bottou, L., & Cun, Y. L. (2003) · Cited by 359
Fast Optimization Methods for L1 Regularization: A Comparative Study and Two New Approaches
Schmidt, M., Fung, G., & Rosales, R. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74958-5_28 · Cited by 353
ALGORITHMS FOR SIMULTANEOUS SPARSE APPROXIMATIONPreprint
Tropp, J. A. (2006) · Cited by 350
John, R. C. S. (1981) · Journal of Quality Technology · doi:10.1080/00224065.1981.11978757 · Cited by 350
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 new view of automatic relevance determination
Wipf, D., & Nagarajan, S. S. (2008) · Cited by 310
Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
Gasso, G., Rakotomamonjy, A., & Canu, S. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2026004 · Cited by 304
Stochastic methods for l 1 regularized loss minimization
Shalev-Shwartz, S., & Tewari, A. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553493 · Cited by 298
Convex Optimization with Sparsity-Inducing Norms
Bach, F., Jenatton, R., Mairal, J., & Obozinski, G. (2011) · Optimization for Machine Learning · doi:10.7551/mitpress/8996.003.0004 · Cited by 295
Self-citationA 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
Convergence Rates in Forward--Backward Splitting
Chen, G. H.-G., & Rockafellar, R. T. (1997) · SIAM Journal on Optimization · doi:10.1137/s1052623495290179 · Cited by 285
Uncovering shared structures in multiclass classification
Amit, Y., Fink, M., Srebro, N., & Ullman, S. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273499 · Cited by 278
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-citationBayesian Inference and Optimal Design for the Sparse Linear Model
Seeger, M. (2008) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · doi:10.5555/1390681.1390707 · Cited by 277
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
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-citationDimension Reduction: A Guided Tour
Burges, C. J. C. (2009) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000002 · Cited by 271
Convergence 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-citationDual Averaging Methods for Regularized Stochastic Learning and Online Optimization
Xiaolin (2010) · Journal of Machine Learning Research · doi:10.5555/1756006.1953017 · Cited by 233
An Interior-Point Method for Large-Scale l1-Regularized Logistic Regression
KohKwangmoo, KimSeung-Jean, & BoydStephen (2007) · Journal of Machine Learning Research · doi:10.5555/1314498.1314550 · Cited by 231
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
A New Approach to Collaborative Filtering: Operator Estimation with Spectral Regularization
Abernethy, J., Bach, F., Evgeniou, T., & Vert, J.-P. (2008) · arXiv · doi:10.48550/arxiv.0802.1430 · Cited by 210
Self-citationAn O(n) algorithm for quadratic knapsack problems
Brucker, P. (1984) · Operations Research Letters · doi:10.1016/0167-6377(84)90010-5 · Cited by 206
Robust PCA via Outlier Pursuit
Xu, H., Caramanis, C., & Sanghavi, S. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1010.4237 · Cited by 192
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
C-HiLasso: A Collaborative Hierarchical Sparse Modeling Framework
Sprechmann, P., Ramirez, I., Sapiro, G., & Eldar, Y. C. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2157912 · Cited by 184
Learning with structured sparsity
Huang, J., Zhang, T., & Metaxas, D. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553429 · Cited by 182
Consistency of trace norm minimization
Bach, F. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0710.2848 · Cited by 182
Self-citationTaking Advantage of Sparsity in Multi-Task Learning
Lounici, K., Pontil, M., Tsybakov, A. B., & van de Geer, S. (2009) · Cited by 179
Taking Advantage of Sparsity in Multi-Task LearningPreprint
Lounici, K., Pontil, M., Tsybakov, A. B., & van de Geer, S. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0903.1468 · Cited by 178
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-citationSparse 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
On Total Variation Minimization and Surface Evolution Using Parametric Maximum Flows
Chambolle, A., & Darbon, J. (2009) · International Journal of Computer Vision · doi:10.1007/s11263-009-0238-9 · Cited by 160
Forward sequential algorithms for best basis selection
Cotter, S. F., Rao, B. D., Kreutz-Delgado, K., & Adler, J. (1999) · IEE Proceedings - Vision Image and Signal Processing · doi:10.1049/ip-vis:19990445 · Cited by 152
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-citationAccelerated Gradient Methods for Stochastic Optimization and Online Learning
Hu, C., Pan, W., & Kwok, J. T.-Y. (2009) · Cited by 140
Convex Sparse Matrix FactorizationsPreprint
Bach, F., Mairal, J., & Ponce, J. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0812.1869 · Cited by 129
Self-citationSparse Probabilistic Projections
Archambeau, C., & Bach, F. (2009) · Cited by 126
Self-citationSparse Bayesian nonparametric regression
Caron, F., & Arnaud Doucet, B. (2008) · International Conference on Machine Learning · doi:10.1145/1390156.1390168 · Cited by 94
GROUP SPARSITY VIA LINEAR-TIME PROJECTION
van den Berg, E., Schmidt, M., Friedlander, M. P., & Murphy, K. J. (2008) · Cited by 90
Catching Change-points with Lasso
Lévy‐Leduc, C., & Harchaoui, Z. (2007) · neural information processing systems · Cited by 90
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-citationSolving Structured Sparsity Regularization with Proximal Methods
Mosci, S., Rosasco, L., Santoro, M., Verri, A., & Villa, S. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15883-4_27 · Cited by 86
Classification of arrayCGH data using fused SVM
Rapaport, F., Barillot, E., & Vert, J. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btn188 · Cited by 85
Sparse coding for machine learning, image processing and computer vision
Mairal, J. (2010) · theses.fr (ABES) · doi:10.70675/72faf70fze619z44adzb071z7e7ca54a5a67 · Cited by 74
Compressible Distributions for High-dimensional StatisticsPreprint
Member, S., Cevher, V., Member, S., Davies, M. E., & Member, S. (2016) · Cited by 72
Structured Sparsity in Structured Prediction
Martins, A. F. T., Smith, N. A., Aguiar, P. M. Q., & Figueiredo, M. A. T. (2018) · Figshare · doi:10.1184/r1/6473714 · Cited by 66
SpicyMKL: a fast algorithm for Multiple Kernel Learning with thousands of kernels
Suzuki, T., & Tomioka, R. (2011) · Machine Learning · doi:10.1007/s10994-011-5252-9 · Cited by 57
Outcomes of the Equivalence of Adaptive Ridge with Least Absolute Shrinkage
Grandvalet, Y., & Canu, S. (1998) · Cited by 52
Collaborative 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
Variable Sparsity Kernel Learning
Aflalo, J., Ben‐Tal, A., Bhattacharyya, C., et al. (2011) · NOT FOUND REPOSITORY (Indian Institute of Science Bangalore) · doi:10.5555/1953048.1953065 · Cited by 43
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-citationEin Verfahren zur Lösung parameterabhängiger, nichtlinearer Maximum-Probleme
Ritter, K. (1962) · Mathematical Methods of Operations Research · doi:10.1007/bf01920852 · Cited by 26
Regularizers for Structured SparsityPreprint
Micchelli, C. A., Morales, J. M., & Pontil, M. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1010.0556 · Cited by 6
Multi-scale Mining of fMRI data with Hierarchical Structured SparsityPreprint
Jenatton, R., Gramfort, A., Michel, V., Obozinski, G., Eger, E., Bach, F., & Thirion, B. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1105.0363 · Cited by 3
Self-citation
Cited by
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
Global Convergence of ADMM in Nonconvex Nonsmooth Optimization
Wang, Y., Yin, W., & Zeng, J. (2019) · Journal of Scientific Computing · doi:10.1007/s10915-018-0757-z · Cited by 1,268
Optimization for Machine Learning
(2011) · The MIT Press eBooks · doi:10.7551/mitpress/8996.001.0001 · Cited by 875
Sparse Iterative Closest Point
Bouaziz, S., Tagliasacchi, A., & Pauly, M. (2013) · Computer Graphics Forum · doi:10.1111/cgf.12178 · Cited by 534
Group Sparse Beamforming for Green Cloud-RAN
(2014) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2014.040214.131770 · Cited by 468
Metadata
- Authors
- Bach, F.
- Venue
- now publishers, Inc. eBooks
- Publisher
- now Publishers Inc
- Published
- 2011
- OpenAlex
- W2093545205
- Cited by
- 608
- References
- 143
- FWCI
- 15.00
- Type
- book
- 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.