Bandit-Based Optimization on Graphs with Application to Library Performance Tuning

Abstract : The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language generated by a suitably defined grammar. We propose a novel algorithm that solves this problem by reducing it to maximizing an objective function over the sinks of a directed acyclic graph. This algorithm valuates nodes using Monte-Carlo and grows a subgraph in the most promising directions by considering local maximum k-armed bandits. When used inside an adaptive linear transform library, it cuts down the search time by an order of magnitude compared to the existing algorithm. In some cases, the performance of the implementations found is also increased by up to 10% which is of considerable practical importance since it consequently improves the performance of all applications using the library.
Type de document :
Communication dans un congrès
ICML, Jun 2009, Montréal, Canada. 2009
Liste complète des métadonnées

Littérature citée [19 références]  Voir  Masquer  Télécharger
Contributeur : Arpad Rimmel <>
Soumis le : mardi 28 avril 2009 - 20:20:37
Dernière modification le : samedi 2 juin 2018 - 11:24:01
Document(s) archivé(s) le : jeudi 10 juin 2010 - 19:44:00


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00379523, version 1



Frédéric De Mesmay, Arpad Rimmel, Yevgen Voronenko, Markus Püschel. Bandit-Based Optimization on Graphs with Application to Library Performance Tuning. ICML, Jun 2009, Montréal, Canada. 2009. 〈inria-00379523〉



Consultations de la notice


Téléchargements de fichiers