paper-with-me

홈 › Papers

Neural Machine Translation with Monte-Carlo Tree Search

2020-04-27 · Jerrod Parker, Jerry Zikun Chen

Recent algorithms in machine translation have included a value network to assist the policy network when deciding which word to output at each step of the translation. The addition of a value network helps the algorithm perform better on evaluation metrics like the BLEU score. After training the policy and value networks in a supervised setting, the policy and value networks can be jointly improved through common actor-critic methods. The main idea of our project is to instead leverage Monte-Carlo Tree Search (MCTS) to search for good output words with guidance from a combined policy and value network architecture in a similar fashion as AlphaZero. This network serves both as a local and a global look-ahead reference that uses the result of the search to improve itself. Experiments using the IWLST14 German to English translation dataset show that our method outperforms the actor-critic methods used in recent machine translation papers.

📄 PDF Abstract BibTeX arXiv:2004.12527

Code (1)

chenziku/NMT-MCTS 공식 구현 pytorch

Tasks

Machine TranslationTranslation

Methods 이 논문이 사용한 방법론

Monte-Carlo Tree Search Monte-Carlo Tree Search is a planning algorithm that accumulates value estimates obtained from Monte Carlo simulations in order to successively direct simulations towards more…
AlphaZero AlphaZero is a reinforcement learning agent for playing board games such as Go, chess, and shogi.

Similar Papers 제목 키워드 기반

Monte Carlo Search Algorithms Discovering Monte Carlo Tree Search Exploration Terms

2024-04-14 · Tristan Cazenave

Monte Carlo Tree Search and Monte Carlo Search have good results for many combinatorial problems. In this paper we propose to use Monte Carlo Search to design mathematical expressions that are used as exploration terms f…

Graph Sparsifications using Neural Network Assisted Monte Carlo Tree Search

2023-11-17 · Alvin Chiu, Mithun Ghosh, Reyan Ahmed, Kwang-Sung Jun 외

Graph neural networks have been successful for machine learning, as well as for combinatorial and graph problems such as the Subgraph Isomorphism Problem and the Traveling Salesman Problem. We describe an approach for co…

Graph Neural NetworkTraveling Salesman Problem

Hedging of Financial Derivative Contracts via Monte Carlo Tree Search

2021-02-11 · Oleg Szehr

The construction of approximate replication strategies for pricing and hedging of derivative contracts in incomplete markets is a key problem of financial engineering. Recently Reinforcement Learning algorithms for hedgi…

Q-Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)

Learning Position Evaluation Functions Used in Monte Carlo Softmax Search

2019-01-30 · Harukazu Igarashi, Yuichi Morioka, Kazumasa Yamamoto

This paper makes two proposals for Monte Carlo Softmax Search, which is a recently proposed method that is classified as a selective search like the Monte Carlo Tree Search. The first proposal separately defines the node…

PositionReinforcement Learning

Is Monte Carlo Tree Search Just Every-Visit Monte Carlo Control?

2026-08-28 · Xianyi Wu arxiv

Monte Carlo Tree Search (MCTS) and every-visit Monte Carlo (MC) control are usually presented as different methods. MCTS is described in the language of search (selection, expansion, simulation, and backup), whereas MC c…

Reinforcement Learning