Bandit-based optimization on graphs with application to library performance tuning

Proceedings of the 26th International Conference On Machine Learning, ICML 2009

Volumn , Issue , 2009, Pages 729-736

  De Mesmay, Frédéric ^a   Rimmel, Arpad ^b   Voronenko, Yevgen ^a   Püschel, Markus ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED ACYCLIC GRAPHS; FAST IMPLEMENTATION; LINEAR TRANSFORM; LOCAL MAXIMUM; MONTE CARLO; NOVEL ALGORITHM; OBJECTIVE FUNCTIONS; OPTIMIZATION PROBLEMS; ORDER OF MAGNITUDE; PERFORMANCE TUNING; PRACTICAL IMPORTANCE; RECURSIVE ALGORITHMS; SEARCH TIME; SUBGRAPHS;

ALGORITHMS; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; ROBOT LEARNING;

FAST FOURIER TRANSFORMS;

EID: 71149107214     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002). Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47, 235-256.
2. Chaslot, G., De Jong, S., Saito, J.-T., & Uiterwijk, J. W. H. M. (2006). Monte-Carlo tree search in production management problems. Proc. 18th BeNeLux Conf. on Artificial Intel. (BNAIC) (pp. 91-98).
3. Cicirello, V., & Smith, S. (2005). The max k-armed bandit: A new model for exploration applied to search heuristic selection. Proc. 20th National Conf. on Artificial Intelligence (AAAI) (pp. 1355-1361).
4. Coulom, R. (2006). Efficient selectivity and backup operators in Monte-Carlo tree search. Proc. 5th Int. Conf. on Computers and Games (CG), 72-83.
5. Frigo, M., & Johnson, S. (2005). The design and implementation of FFTW3. Proc. IEEE, 93, 216-231.
6. Gelly, S., & Silver, D. (2007). Combining online and offline knowledge in UCT. Proc. 24th Int. Conf. on Machine Learning (ICML) (pp. 273-280). ACM.
7. Intel (2008). Integrated performance primitives.
8. Johnson, J., & Püschel, M. (2000). In search of the optimal Walsh-Hadamard transform. Proc. Int. Conf. on Acoustics, Speech and Signal Processing (ICASSP) (pp. 3347-3350).
9. Kocsis, L., & Szepesvi, C. (2006). Bandit based Monte-Carlo planning. Euro. Conf. on Mach. Learn. (ECML), LNCS 4212 (pp. 282-293). Springer.
10. Lai, T., & Robbins, H. (1985). Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics, 6, 4-22.
11. Püschel, M., Moura, J. M. F., Johnson, J., Padua, D., Veloso, M., et al. (2005). SPIRAL: Code generation for DSP transforms. Proc. of the IEEE, 93, 232-275.
12. Singer, B., & Veloso, M. (2002). Learning to construct fast signal processing implementations. Journal of Machine Learning Research, 3, 887-919.
13. Streeter, M. J., & Smith, S. F. (2006). A simple distribution-free approach to the max k-armed bandit problem. Principles and Practice of Constraint Programming (CP) (pp. 560-574).
14. Voronenko, Y. (2008). Library generation for linear transforms. Doctoral dissertation, Electrical and Computer Engineering, Carnegie Mellon University.
15. Voronenko, Y., de Mesmay, F., & Püschel, M. (2009). Computer generation of general size linear transform libraries. Int. Symp. on Code Generation and Optimization (CGO).
16. Vuduc, R., Demmel, J. W., & Yelick, K. A. (2005). Oski: A library of automatically tuned sparse matrix kernels. Journal of Physics: Conf. Series, 16, 521-530.
17. Wang, Y., & Gelly, S. (2007). Modifications of UCT and sequence-like simulations for Monte-Carlo Go. IEEE Symp. on Computational Intelligence and Games (CIG) (pp. 175-182).
18. Whaley, R. C., & Petitet, A. (2005). Minimizing development and maintenance costs in supporting persistently optimized BLAS. Software: Practice and Experience, 35, 101-121.