The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Joint covariate selection and joint subspace selection for multiple classification problems
Open accessAbstract
We address the problem of recovering a common set of covariates that are relevant simultaneously to several classification problems. By penalizing the sum of ℓ 2 norms of the blocks of coefficients associated with each covariate across different classification problems, similar sparsity patterns in all models are encouraged. To take computational advantage of the sparsity of solutions at high regularization levels, we propose a blockwise path-following scheme that approximately traces the regularization path. As the regularization coefficient decreases, the algorithm maintains and updates concurrently a growing set of covariates that are simultaneously active for all problems. We also show how to use random projections to extend this approach to the problem of joint subspace selection, where multiple predictors are found in a common low-dimensional subspace. We present theoretical results showing that this random projection approach converges to the solution yielded by trace-norm regularization. Finally, we present a variety of experimental results exploring joint covariate selection and joint subspace selection, comparing the path-following approach to competing algorithms in terms of prediction accuracy and running time.
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
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
Advances in neural information processing systems 7
Cios, K., & Shields, M. (1997) · Neurocomputing · doi:10.1016/s0925-2312(97)90018-7 · Cited by 22,059
(2005) · Technometrics · doi:10.1198/tech.2005.s303 · Cited by 17,923
Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
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
Draper, N. R., & Smith, H. (1998) · Wiley Series in Probability and Statistics · doi:10.1002/9781118625590 · Cited by 5,024
Gunst, R. F. (1999) · Technometrics · doi:10.1080/00401706.1999.10485680 · Cited by 4,002
Khan, J., Wei, J. S., Ringnér, M., Saal, L. H., Ladanyi, M., Westermann, F., Berthold, F., Schwab, M., Antonescu, C. R., Peterson, C., et al. (2001) · Nature Medicine · doi:10.1038/89044 · Cited by 2,644
Donoho, D. L. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20132 · Cited by 2,490
Sliced Inverse Regression for Dimension Reduction
Li, K.-C. (1991) · Journal of the American Statistical Association · doi:10.1080/01621459.1991.10475035 · Cited by 2,144
Advances in Neural Information Processing Systems 18
Murray, I., Mackay, D., Zoubin Ghahramani, A., & Skilling, J. (2006) · Cited by 1,927
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
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-citationRegularized multi--task learning
Evgeniou, T., & Pontil, M. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014067 · Cited by 1,433
A Framework for Learning Predictive Structures from Multiple Tasks and Unlabeled Data
Ando, R. K., & Zhang, T. (2005) · doi:10.5555/1046920.1194905 · Cited by 1,311
Asymptotics for lasso-type estimators
Fu, W., & Knight, K. (2000) · The Annals of Statistics · doi:10.1214/aos/1015957397 · Cited by 1,276
Proceedings of the twenty-first international conference on Machine learning
Brodley, C. E. (2004) · Cited by 1,020
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
A new approach to variable selection in least squares problems
Osborne, M. (2000) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/20.3.389 · Cited by 859
Sharing features: efficient boosting procedures for multiclass object detection
Torralba, A., Murphy, K. P., & Freeman, W. T. (2004) · Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004. · doi:10.1109/cvpr.2004.1315241 · Cited by 577
Fazel, M., Hindi, H., & Boyd, S. P. (2004) · Proceedings of the 2003 American Control Conference, 2003. · doi:10.1109/acc.2003.1243393 · Cited by 574
Piecewise linear regularized solution paths
Rosset, S., & Zhu, J. (2007) · The Annals of Statistics · doi:10.1214/009053606000001370 · Cited by 481
Srebro, N., & Shraibman, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11503415_37 · Cited by 316
Kernel dimension reduction in regression
Fukumizu, K., Bach, F. R., & Jordan, M. I. (2009) · The Annals of Statistics · doi:10.1214/08-aos637 · Cited by 289
Self-citationSutton, C., Rohanimanesh, K., & McCallum, A. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015422 · Cited by 284
Multi-task feature and kernel selection for SVMs
Jebara, T. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015426 · Cited by 218
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
Grouped and Hierarchical Model Selection through Composite Absolute Penalties
Zhao, P., Rocha, G. V., & Yu, B. (2007) · Cited by 195
Handwritten digit recognition by combined classifiers
van Breukelen, M., Duin, R. P. W., Tax, D. M. J., & den Hartog, J. E. (1998) · Czech digital mathematics library · Cited by 184
Consistency of trace norm minimization
Bach, F. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0710.2848 · Cited by 182
Generalization Error Bounds for Collaborative Prediction with Low-Rank Matrices
Srebro, N., Alon, N., & Jaakkola, T. (2004) · neural information processing systems · Cited by 143
Bounds for Linear Multi-Task Learning
Maurer, A. (2006) · Cited by 138
Zhao, P., & Yu, B. (2007) · Cited by 132
A notion of task relatedness yielding provable multiple-task learning guarantees
Ben-David, S., & Schuller, R. (2008) · Machine Learning · doi:10.1007/s10994-007-5043-5 · Cited by 103
Wu, B. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti827 · Cited by 40
Cited by
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
Cross-Stitch Networks for Multi-task Learning
Misra, I., Shrivastava, A., Gupta, A., & Hebert, M. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.433 · Cited by 1,397
An overview of multi-task learning
Zhang, Y., & Yang, Q. (2018) · National Science Review · doi:10.1093/nsr/nwx105 · Cited by 1,117
Optimization for Machine Learning
(2011) · The MIT Press eBooks · doi:10.7551/mitpress/8996.001.0001 · Cited by 875
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-citation
Metadata
- Authors
- Obozinski, G., Taskar, B., & Jordan, M. I.
- Venue
- Statistics and Computing
- Published
- 2009-01-14
- Volume
- 20
- Issue
- 2
- Pages
- 231-252
- ISSN
- 0960-3174 (ISSN-L)
- 1573-1375
- OpenAlex
- W2159514083
- Cited by
- 451
- References
- 39
- FWCI
- 29.52
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.