10/24/21: An Extensible and Modular Design and Implementation of Monte Carlo Tree Search for the JVM with Larkin Liu & Jun Tao Luo episode artwork

EPISODE · Oct 24, 2021 · 1H 6M

10/24/21: An Extensible and Modular Design and Implementation of Monte Carlo Tree Search for the JVM with Larkin Liu & Jun Tao Luo

from Boston Computation Club · host Max von Hippel

Larkin Liu is an operations research (OR) & machine learning (ML) specialist, currently completing a PhD in Operations Research under the advisement of Stefan Minner at the Technical University of Munich.  Today Larkin joined us to present *An Extensible and Modular Design and Implementation of Monte Carlo Tree Search for the JVM*, a recent preprint he authored with Jun Tao Luo (MS student in CS at Carnegie Mellon; also in attendance at this talk).  The paper is exactly what it sounds like, and the presentation was a lot of fun, with clear mathematical background, a solid foundation in software engineering principles, and some impressive code demos.     - Preprint: https://arxiv.org/abs/2108.10061  - Larkin: https://larkz.github.io/  - Jun: https://www.linkedin.com/in/jun-tao-luo - Video: https://youtu.be/bVpUlJU-piA

Episode metadata supplied by the publisher feed · Published Oct 24, 2021

Embed this episode

NOW PLAYING

10/24/21: An Extensible and Modular Design and Implementation of Monte Carlo Tree Search for the JVM with Larkin Liu & Jun Tao Luo

0:00 1:06:16

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

No similar podcasts found.

Frequently Asked Questions

How long is this episode of Boston Computation Club?

This episode is 1 hour and 6 minutes long.

When was this Boston Computation Club episode published?

This episode was published on October 24, 2021.

Can I download this Boston Computation Club episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!