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. 1205.0288
  4. Cited By
A Randomized Mirror Descent Algorithm for Large Scale Multiple Kernel
  Learning

A Randomized Mirror Descent Algorithm for Large Scale Multiple Kernel Learning

1 May 2012
Arash Afkanpour
András Gyorgy
Csaba Szepesvári
Michael Bowling
ArXivPDFHTML

Papers citing "A Randomized Mirror Descent Algorithm for Large Scale Multiple Kernel Learning"

2 / 2 papers shown
Title
Iteration Complexity of Randomized Block-Coordinate Descent Methods for
  Minimizing a Composite Function
Iteration Complexity of Randomized Block-Coordinate Descent Methods for Minimizing a Composite Function
Peter Richtárik
Martin Takáč
86
769
0
14 Jul 2011
Exploring Large Feature Spaces with Hierarchical Multiple Kernel
  Learning
Exploring Large Feature Spaces with Hierarchical Multiple Kernel Learning
Francis R. Bach
BDL
101
250
0
09 Sep 2008
1