Fetching the paper…
Reading the bibliography…
Sparse estimation methods are aimed at using or obtaining parsimonious representations of data or models.
[author] Moreau, J. J.J. J. (1962). Fonctions convexes duales et points proximaux dans un espace hilbertien. C. R. Acad. Sci. Paris Sér. A Math. 255 2897–2899
1962
Earlier work this paper cites.
[author] Kimeldorf, G. S.G. S. and Wahba, G.G. (1971). Some results on Tchebycheffian spline functions. J. Math. Anal. Applicat. 33 82–95
1971
Earlier work this paper cites.
[author] Rudin, L. I.L. I., Osher, S.S. and Fatemi, E.E. (1992). Nonlinear total variation based noise removal algorithms. Physica D: Nonlinear Phenomena 60 259–268
1992
Earlier work this paper cites.
[author] Donoho, D. L.D. L. and Johnstone, I. M.I. M. (1995). Adapting to Unknown Smoothness Via Wavelet Shrinkage. Journal of the American Statistical Association 90 1200–1224
1995
Earlier work this paper cites.
[author] Olshausen, B. A.B. A. and Field, D. J.D. J. (1996). Emergence of simple-cell receptive field properties by learning a sparse code for natural images. Nature 381 607–609
1996
Earlier work this paper cites.
[author] Tibshirani, R.R. (1996). Regression shrinkage and selection via the Lasso. Journal of the Royal Statistical Society. Series B 267–288
1996
Earlier work this paper cites.
[author] Chen, S. S.S. S., Donoho, D. L.D. L. and Saunders, M. A.M. A. (1998). Atomic Decomposition by Basis Pursuit. SIAM Journal on Scientific Computing 20 33–61
1998
Earlier work this paper cites.
[author] Lee, D. D.D. D. and Seung, H. S.H. S. (1999). Learning the parts of objects by non-negative matrix factorization. Nature 401 788–791
1999
Earlier work this paper cites.
[author] Mallat, S. G.S. G. (1999). A wavelet tour of signal processing. Academic Press
1999
Earlier work this paper cites.
[author] Baraniuk, R. G.R. G., Cevher, V.V., Duarte, M. F.M. F. and Hegde, C.C. (2010). Model-based compressive sensing. IEEE Transactions on Information Theory 56 1982–2001
2001
Earlier work this paper cites.
[author] Hastie, T.T., Tibshirani, R.R. and Friedman, J.J. (2001). The Elements of Statistical Learning. Springer-Verlag
2001
Earlier work this paper cites.
[author] Martinez, A. M.A. M. and Kak, A. C.A. C. (2001). PCA versus LDA. IEEE Transactions on Pattern Analysis and Machine Intelligence 23 228–233
2001
Earlier work this paper cites.
Buntine, W. L
2002
Earlier work this paper cites.
[author] Blei, D.D., Ng, A.A. and Jordan, M.M. (2003). Latent Dirichlet allocation. Journal of Machine Learning Research 3 993–1022
2003
Earlier work this paper cites.
[author] Jolliffe, I. T.I. T., Trendafilov, N. T.N. T. and Uddin, M.M. (2003). A modified principal component technique based on the Lasso. Journal of Computational and Graphical Statistics 12 531–547
2003
Earlier work this paper cites.
[author] Efron, B.B., Hastie, T.T., Johnstone, I.I. and Tibshirani, R.R. (2004). Least angle regression. Annals of Statistics 32 407–451
2004
Earlier work this paper cites.
[author] Griffiths, T. L.T. L. and Steyvers, M.M. (2004). Finding scientific topics. Proceedings of the National Academy of Sciences 101 5228–5235
2004
Earlier work this paper cites.
[author] Huang, J.J. and Zhang, T.T. (2010). The benefit of group sparsity. Annals of Statistics 38 1978–2004
2004
Earlier work this paper cites.
[author] Nesterov, Y.Y. (2004). Introductory lectures on convex optimization: a basic course. Kluwer Academic Publishers
2004
Earlier work this paper cites.
[author] Shawe-Taylor, J.J. and Cristianini, N.N. (2004). Kernel Methods for Pattern Analysis. Cambridge University Press
2004
Earlier work this paper cites.
[author] Tropp, J. A.J. A. (2004). Greed is good: Algorithmic results for sparse approximation. IEEE Transactions on Information Theory 50 2231–2242
2004
Earlier work this paper cites.
[author] Candès, E. J.E. J. and Tao, T.T. (2005). Decoding by linear programming. IEEE Transactions on Information Theory 51 4203–4215
2005
Earlier work this paper cites.
[author] Tibshirani, R.R., Saunders, M.M., Rosset, S.S., Zhu, J.J. and Knight, K.K. (2005). Sparsity and smoothness via the fused Lasso. J. Roy. Stat. Soc. B 67 91–108
2005
Earlier work this paper cites.
[author] Turlach, B. A.B. A., Venables, W. N.W. N. and Wright, S. J.S. J. (2005). Simultaneous variable selection. Technometrics 47 349–363
2005
Earlier work this paper cites.
[author] Aharon, M.M., Elad, M.M. and Bruckstein, A.A. (2006). K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation. IEEE Trans. Signal Processing 54 4311–4322
2006
Earlier work this paper cites.
[author] Borwein, J. M.J. M. and Lewis, A. S.A. S. (2006). Convex Analysis and Nonlinear Optimization: Theory and Examples. Springer
2006
Earlier work this paper cites.
[author] Lin, Y.Y. and Zhang, H. H.H. H. (2006). Component selection and smoothing in multivariate nonparametric regression. Annals of Statistics 34 2272–2297
2006
Earlier work this paper cites.
[author] Meinshausen, N.N. and Bühlmann, P.P. (2006). High-dimensional graphs and variable selection with the Lasso. Annals of Statistics 34 1436–1462
2006
Earlier work this paper cites.
Moghaddam, B
2006
Earlier work this paper cites.
[author] Tropp, J. A.J. A. (2006). Just relax: Convex programming methods for identifying sparse signals in noise. IEEE Transactions on Information Theory 52
2006
Earlier work this paper cites.
[author] Yuan, M.M. and Lin, Y.Y. (2006). Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society. Series B 68 49–67
2006
Earlier work this paper cites.
[author] Zhao, P.P. and Yu, B.B. (2006). On model selection consistency of Lasso. Journal of Machine Learning Research 7 2541–2563
2006
Earlier work this paper cites.
[author] Zou, H.H. (2006). The adaptive Lasso and its oracle properties. Journal of the American Statistical Association 101 1418–1429
2006
Cited alongside, same era.
[author] Zou, H.H., Hastie, T.T. and Tibshirani, R.R. (2006). Sparse principal component analysis. Journal of Computational and Graphical Statistics 15 265–286
2006
Cited alongside, same era.
[author] Friedman, J.J., Hastie, T.T., Höfling, H.H. and Tibshirani, R.R. (2007). Pathwise coordinate optimization. Annals of Applied Statistics 1 302–332
2007
Cited alongside, same era.
[author] Nesterov, Y.Y. (2007). Gradient methods for minimizing composite objective function Technical Report, Center for Operations Research and Econometrics (CORE), Catholic University of Louvain
2007
Cited alongside, same era.
[author] Bach, F.F. (2008). Consistency of the group Lasso and multiple kernel learning. Journal of Machine Learning Research 9 1179–1225
[author] Zhao, P.P., Rocha, G.G. and Yu, B.B. (2009). The composite absolute penalties family for grouped and hierarchical variable selection. Annals of Statistics 37 3468–3497
2009
Later among the works it cites.
[author] Adams, RyanR., Ghahramani, ZoubinZ. and Jordan, MichaelM. (2010). Tree-Structured Stick Breaking for Hierarchical Data. In Advances in Neural Information Processing Systems 23 (J.J. Lafferty, C. K. I.C. K. I. Williams, J.J. Shawe-Taylor, R. S.R. S. Zemel and A.A. Culotta, eds.) 19–27
2010
Later among the works it cites.
[author] Blei, D.D., Griffiths, T. L.T. L. and Jordan, M. I.M. I. (2010). The nested Chinese restaurant process and Bayesian nonparametric inference of topic hierarchies. Journal of the ACM 57 1–30
2010
Later among the works it cites.
[author] Combettes, P. L.P. L. and Pesquet, J. C.J. C. (2010). Proximal splitting methods in signal processing. In Fixed-Point Algorithms for Inverse Problems in Science and Engineering Springer
2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2008
Cited alongside, same era.
2008
Cited alongside, same era.
[author] Bondell, H. D.H. D. and Reich, B. J.B. J. (2008). Simultaneous regression shrinkage, variable selection, and supervised clustering of predictors with OSCAR. Biometrics 64 115–123
2008
Cited alongside, same era.
Cevher, V
2008
Cited alongside, same era.
[author] d’Aspremont, A.A., Bach, F.F. and El Ghaoui, L.L. (2008). Optimal Solutions for Sparse Principal Component Analysis. Journal of Machine Learning Research 9 1269–1294
2008
Cited alongside, same era.
[author] Rapaport, F.F., Barillot, E.E. and Vert, J. P.J. P. (2008). Classification of arrayCGH data using fused SVM. Bioinformatics 24 i375–i382
2008
Cited alongside, same era.
Singh, A. P
2008
Cited alongside, same era.
[author] Wu, T. T.T. T. and Lange, K.K. (2008). Coordinate descent algorithms for Lasso penalized regression. Annals of Applied Statistics 2 224–244
2008
Cited alongside, same era.
[author] Friedman, J.J., Hastie, T.T. and Tibshirani, R.R. (2010). A note on the group Lasso and a sparse group Lasso. preprint
2010
Later among the works it cites.
Jenatton, R
2010
Later among the works it cites.
[author] Mairal, J.J. (2010). Sparse coding for machine learning, image processing and computer vision PhD thesis, École normale supérieure de Cachan - ENS Cachan Available at http://tel.archives-ouvertes.fr/tel-00595312/fr/
2010
Later among the works it cites.
[author] Mairal, J.J., Bach, F.F., Ponce, J.J. and Sapiro, G.G. (2010). Online learning for matrix factorization and sparse coding. Journal of Machine Learning Research 11 19–60
2010
Later among the works it cites.
[author] Obozinski, G.G., Taskar, B.B. and Jordan, M. I.M. I. (2010). Joint covariate selection and joint subspace selection for multiple classification problems. Statistics and Computing 20 231–252
2010
Later among the works it cites.
Schmidt, M
2010
Later among the works it cites.
[author] Shalev-Shwartz, S.S., Srebro, N.N. and Zhang, T.T. (2010). Trading accuracy for sparsity in optimization problems with sparsity constraints. SIAM Journal on Optimization 20
2010
Later among the works it cites.
[author] Shen, X.X. and Huang, H. C.H. C. (2010). Grouping pursuit through a regularization solution surface. Journal of the American Statistical Association 105 727–739
2010
Later among the works it cites.
Sprechmann, P
2010
Later among the works it cites.
van de Geer, S
2010
Later among the works it cites.
Varoquaux, G
2010
Later among the works it cites.
[author] Yuan, M.M. (2010). High Dimensional Inverse Covariance Matrix Estimation via Linear Programming. Journal of Machine Learning Research 11 2261–2286
2010
Later among the works it cites.
[author] Yuan, G. X.G. X., Chang, K. W.K. W., Hsieh, C. J.C. J. and Lin, C. J.C. J. (2010). Comparison of Optimization Methods and Software for Large-scale L1-regularized Linear Classification. Journal of Machine Learning Research 11 3183–3234
2010
Later among the works it cites.
[author] Bach, FF. (2011). Learning with Submodular Functions: A Convex Optimization Perspective Technical Report No. 00645271, HAL
2011
Closest in time.
[author] Huang, J.J., Zhang, T.T. and Metaxas, D.D. (2011). Learning with structured sparsity. Journal of Machine Learning Research 12 3371–3412
2011
Closest in time.
[author] Jenatton, R.R., Audibert, J. Y.J. Y. and Bach, F.F. (2011). Structured Variable Selection with Sparsity-Inducing Norms. Journal of Machine Learning Research 12 2777–2824
2011
Closest in time.
[author] Lounici, K.K., Pontil, M.M., van de Geer, S.S. and Tsybakov, A. B.A. B. (2011). Oracle inequalities and optimal inference under group sparsity. Annals of Statistics 39 2164–2204
2011
Closest in time.
[author] Mairal, J.J., Jenatton, R.R., Obozinski, G.G. and Bach, F.F. (2011). Convex and Network Flow Optimization for Structured Sparsity. Journal of Machine Learning Research 12 2681–2720
2011
Closest in time.
[author] Negahban, S. N.S. N. and Wainwright, M. J.M. J. (2011). Simultaneous Support Recovery in High Dimensions: Benefits and Perils of Block e l l _ ell\_ { 1 1 } / e l l _ /ell\_ { i n f t y infty }-Regularization. Information Theory, IEEE Transactions on 57 3841--3863
2011
Closest in time.
[author] Obozinski, G.G., Jacob, L.L. and Vert, J. P.J. P. (2011). Group Lasso with overlaps: the Latent group Lasso approach Technical Report No. inria-00628498, HAL
2011
Closest in time.
[author] Obozinski, G.G., Wainwright, M. J.M. J. and Jordan, M. I.M. I. (2011). Support Union Recovery in High-dimensional Multivariate regression. Annals of statistics 39 1–47
2011
Closest in time.
Rao, N. S
2011
Closest in time.
Schmidt, M
2011
Closest in time.
Zhong, L. W
2011
Closest in time.
[author] Bach, F.F., Jenatton, R.R., Mairal, J.J. and Obozinski, G.G. (2012). Optimization with sparsity-inducing penalties. Foundations and Trends in Machine Learning 4 1–106
2012
Closest in time.
[author] Obozinski, G.G. and Bach, F.F. (2012). Convex relaxation for combinatorial penalties Technical Report, HAL
2012
Closest in time.
[author] Percival, D.D. (2012). Theoretical Properties of the Overlapping Group Lasso. Electron. J. Statist. 6 269–288
2012
Closest in time.