ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1810.03817
  4. Cited By
Learning Bounds for Greedy Approximation with Explicit Feature Maps from
  Multiple Kernels

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

9 October 2018
Shahin Shahrampour
Vahid Tarokh
ArXiv (abs)PDFHTML

Papers citing "Learning Bounds for Greedy Approximation with Explicit Feature Maps from Multiple Kernels"

3 / 3 papers shown
Title
Graph-Aided Online Multi-Kernel Learning
Graph-Aided Online Multi-Kernel Learning
P. M. Ghari
Yanning Shen
38
3
0
09 Feb 2021
Generalization Guarantees for Sparse Kernel Approximation with Entropic
  Optimal Features
Generalization Guarantees for Sparse Kernel Approximation with Entropic Optimal Features
Liang Ding
Rui Tuo
Shahin Shahrampour
41
8
0
11 Feb 2020
Nested Barycentric Coordinate System as an Explicit Feature Map
Nested Barycentric Coordinate System as an Explicit Feature Map
Lee-Ad Gottlieb
Eran Kaufman
A. Kontorovich
Gabriel Nivasch
Ofir Pele
19
0
0
05 Feb 2020
1