Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Arpad Rimmel Connect in order to contact the contributor
Submitted on : Tuesday, April 28, 2009 - 8:20:37 PM
Last modification on : Sunday, June 26, 2022 - 11:49:46 AM
Long-term archiving on: : Thursday, June 10, 2010 - 7:44:00 PM


Files produced by the author(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. ⟨inria-00379523⟩



Record views


Files downloads