Non-parametric group orthogonal matching pursuit for Sparse Learning with Multiple Kernels

Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011, NIPS 2011

Volumn , Issue , 2011, Pages

  Sindhwani, Vikas ^a   Lozano, Aurélie C ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

ALGORITHMICS; GROUP SPARSITIES; MULTIPLE KERNEL LEARNING; MULTIPLE KERNELS; NONPARAMETRICS; ORTHOGONAL MATCHING PURSUIT; REGULARIZER; REPRODUCING KERNEL HILBERT SPACES; RISK MINIMIZATION; SPARSE MULTIPLES;

RELAXATION PROCESSES;

EID: 85162475298     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. N. Aronszajn. Theory of reproducing kernel hilbert spaces. Transactions of the American Mathematical Society, 68(3):337-404, 1950.
2. F. Bach. Consistency of group lasso and multiple kernel learning. JMLR, 9:1179-1225, 2008.
3. F. Bach. High-dimensional non-linear variable selection through hierarchical kernel learning. In Technical report, HAL 00413473, 2009.
4. F. Bach, R. Jenatton, J. Mairal, and G. Obozinski. Optimization with sparsity-inducing penalties. In Technical report, HAL 00413473, 2010.
5. F. R. Bach, G. R. G. Lanckriet, and M. I. Jordan. Multiple kernel learning, conic duality, and the smo algorithm. In ICML, 2004.
6. P. Bartlett and S. Mendelson. Rademacher and gaussian complexities: Risk bounds and structural results. JMLR, 3:463-482, 2002.
7. A. Ben-Hur andW. S. Noble. Kernel methods for predicting protein-protein interactions. Bioinformatics, 21, January 2005.
8. C. Cortes, M. Mohri, and Afshin Rostamizadeh. Generalization bounds for learning kernels. In ICML, 2010.
9. A. K. Fletcher and S. Rangan. Orthogonal matching pursuit from noisy measurements: A new analysis. In NIPS, 2009.
10. p-norm multiple kernel learning. JMLR, 12:953-997, 2011.
11. M. Kloft, U. Ruckert, and P. Bartlett. A unifying view ofmultiple kernel learning. In European Conference on Machine Learning (ECML), 2010.
12. V. Koltchinskii and M. Yuan. Sparsity in multiple kernel learning. The Annals of Statistics, 38(6):3660-3695, 2010.
13. G. R. G. Lanckriet, N. Cristianini, P. Bartlett, L. El Ghaoui, and M. I. Jordan. Learning the kernel matrix with semidefinite programming. J. Mach. Learn. Res., 5:27-72, December 2004.
14. G. R. G. Lanckriet, T. De Bie, N. Cristianini, M. I. Jordan, and W. S. Noble. A statistical framework for genomic data fusion. Bioinformatics, 20, November 2004.
15. A. C. Lozano and V. Sindhwani. Block variable selection in multivariate regression and high-dimensional causal inference. In NIPS, 2010.
16. A. C. Lozano, G. Swirszcz, and N. Abe. Group orthogonal matching pursuit for variable selection and prediction. In NIPS, 2009.
17. C. Michelli and M. Pontil. Learning the kernel function via regularization. JMLR, 6:1099-1125, 2005.
18. H. Liu P. Ravikumar, J. Lafferty and L. Wasserman. Sparse additive models. Journal of the Royal Statistical Society: Series B (Statistical Methodology) (JRSSB), 71 (5):1009-1030, 2009.
19. P. Pavlidis, J. Cai, J.Weston, andW.S. Noble. Learning gene functional classifications from multiple data types. Journal of Computational Biology, 9:401-411, 2002.
20. A. Rakotomamonjy, F.Bach, S. Cano, and Y. Grandvalet. SimpleMKL. Journal of Machine Learning Research, 9:2491-2521, 2008.
21. G. Raskutti, M. Wainwrigt, and B. Yu. Minimax-optimal rates for sparse additive models over kernel classes via convex programming. In Technical Report 795, Statistics Department, UC Berkeley., 2010.
22. Bernhard Scholkopf and Alexander J. Smola. Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond. MIT Press, 2001.
23. J. Shawe-Taylor and N. Cristianini. Kernel Methods for Pattern Analysis. Cambridge University Press, 2004.
24. S. Sonnenburg, G. Rätsch, C. Schäfer, and B. Schölkopf. Large scale multiple kernel learning. J. Mach. Learn. Res., 7, December 2006.
25. Zhang T. Sparse recovery with orthogonal matching pursuit under rip. Computing Research Repository, 2010.
26. R. Tomioka and T. Suzuki. Sparsity-accuracy tradeoff in mkl. In NIPSWorkshop: UnderstandingMultiple Kernel Learning Methods. Technical report, arXiv:1001.2615v1, 2010.
27. J. Tropp. Greed is good: Algorithmic results for sparse approximation. IEEE Trans. Inform. Theory, 50(10):2231-2242, 2004.
28. P. Vincent and Y. Bengio. Kernel matching pursuit. Machine Learning, 48:165-188, 2002.
29. Z. Xu, R. Jin, H. Yang, I. King, and M.R. Lyu. Simple and efficient multiple kernel learning by group lasso. In ICML, 2010.
30. Ming Yuan, Ali Ekici, Zhaosong Lu, and Renato Monteiro. Dimension reduction and coefficient estimation in multivariate linear regression. Journal Of The Royal Statistical Society Series B, 69(3):329-346, 2007.
31. Tong Zhang. On the consistency of feature selection using greedy least squares regression. J. Mach. Learn. Res., 10, June 2009.
32. H. Zhou and T. Hastie. Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society, 67(2):301-320, 2005.
33. A. Zien and Cheng S. Ong. Multiclass multiple kernel learning. ICML, 2007.