Skip to main content

Learning Bounds for Greedy Approximation with Explicit Feature Maps from Multiple Kernels.

Publication ,  Conference
Shahrampour, S; Tarokh, V
Published in: NeurIPS
2018

Duke Scholars

Published In

NeurIPS

Publication Date

2018

Start / End Page

4695 / 4706
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Shahrampour, S., & Tarokh, V. (2018). Learning Bounds for Greedy Approximation with Explicit Feature Maps from Multiple Kernels. In S. Bengio, H. M. Wallach, H. Larochelle, K. Grauman, N. Cesa-Bianchi, & R. Garnett (Eds.), NeurIPS (pp. 4695–4706).
Shahrampour, Shahin, and Vahid Tarokh. “Learning Bounds for Greedy Approximation with Explicit Feature Maps from Multiple Kernels.” In NeurIPS, edited by Samy Bengio, Hanna M. Wallach, Hugo Larochelle, Kristen Grauman, Nicolò Cesa-Bianchi, and Roman Garnett, 4695–4706, 2018.
Shahrampour S, Tarokh V. Learning Bounds for Greedy Approximation with Explicit Feature Maps from Multiple Kernels. In: Bengio S, Wallach HM, Larochelle H, Grauman K, Cesa-Bianchi N, Garnett R, editors. NeurIPS. 2018. p. 4695–706.
Shahrampour, Shahin, and Vahid Tarokh. “Learning Bounds for Greedy Approximation with Explicit Feature Maps from Multiple Kernels.NeurIPS, edited by Samy Bengio et al., 2018, pp. 4695–706.
Shahrampour S, Tarokh V. Learning Bounds for Greedy Approximation with Explicit Feature Maps from Multiple Kernels. In: Bengio S, Wallach HM, Larochelle H, Grauman K, Cesa-Bianchi N, Garnett R, editors. NeurIPS. 2018. p. 4695–4706.

Published In

NeurIPS

Publication Date

2018

Start / End Page

4695 / 4706