paper-with-me

홈 › Papers

ProTuner: Tuning Programs with Monte Carlo Tree Search

2020-05-27 · Ameer Haj-Ali, Hasan Genc, Qijing Huang, William Moses, John Wawrzynek, Krste Asanović, Ion Stoica

We explore applying the Monte Carlo Tree Search (MCTS) algorithm in a notoriously difficult task: tuning programs for high-performance deep learning and image processing. We build our framework on top of Halide and show that MCTS can outperform the state-of-the-art beam-search algorithm. Unlike beam search, which is guided by greedy intermediate performance comparisons between partial and less meaningful schedules, MCTS compares complete schedules and looks ahead before making any intermediate scheduling decision. We further explore modifications to the standard MCTS algorithm as well as combining real execution time measurements with the cost model. Our results show that MCTS can outperform beam search on a suite of 16 real benchmarks.

📄 PDF Abstract BibTeX arXiv:2005.13685

Code (0)

등록된 구현이 없습니다.

Tasks

Scheduling

Similar Papers 제목 키워드 기반

Convolutional Monte Carlo Rollouts in Go

2015-12-10 · Peter H. Jin, Kurt Keutzer

In this work, we present a MCTS-based Go-playing program which uses convolutional networks in all parts. Our method performs MCTS in batches, explores the Monte Carlo search tree using Thompson sampling and a convolution…

GPUThompson Sampling

VerMCTS: Synthesizing Multi-Step Programs using a Verifier, a Large Language Model, and Tree Search

2024-02-13 · David Brandfonbrener, Simon Henniger, Sibi Raja, Tarun Prasad 외

Large Language Models (LLMs) can generate useful code, but often the code they generate cannot be trusted to be sound. In this paper, we present VerMCTS, an approach to begin to resolve this issue by generating verified …

Language ModelingLanguage ModellingLarge Language Model

Nonparametric Hamiltonian Monte Carlo

2021-06-18 · Carol Mak, Fabian Zaiser, Luke Ong

Probabilistic programming uses programs to express generative models whose posterior probability is then computed by built-in inference engines. A challenging goal is to develop general purpose inference algorithms that …

Probabilistic Programming

Policy Gradient Search: Online Planning and Expert Iteration without Search Trees

2019-04-07 · Thomas Anthony, Robert Nishihara, Philipp Moritz, Tim Salimans 외

Monte Carlo Tree Search (MCTS) algorithms perform simulation-based search to improve policies online. During search, the simulation policy is adapted to explore the most promising lines of play. MCTS has been used by sta…

Neural Network simulation

Solving Multi-Period Financial Planning Models: Combining Monte Carlo Tree Search and Neural Networks

2022-02-15 · Afşar Onat Aydınhan, Xiaoyue Li, John M. Mulvey

This paper introduces the MCTS algorithm to the financial world and focuses on solving significant multi-period financial planning models by combining a Monte Carlo Tree Search algorithm with a deep neural network. The M…