Monte Carlo Tree Search for Poetry Using GPT

Hacker News

I've been working on enact, a framework that simplifies the implementation of complex generative software flows at https://github.com/agentic-ai/enact . Enact's core features include the ability to rewind and replay executions of python functions that are annotated in the framework. The linked notebook shows how this can be used to implement a generic Monte Carlo Tree Search (MCTS) algorithm that can be deployed over any annotated python program and directly searches the space of program executions. MCTS (used, e.g., in the AlphaZero family of algorithms) searches a tree of generative possibilities using a scoring function in order to find high-scoring branches. The notebook deploys MCTS over a line-by-line poetry generator, allowing the algorithm to backtrack and search different completions for the same starting lines. Baseline (no MCTS): > While shadows stir and breathe beneath the moon's licentious glow. > Nightly whispers wind through trees, long lost in their verdurous flow. > In the echoing silence, secrets lie dormant, awaiting the raven's crow. > A path unfolds beneath the thorns, where memories and shadows grow. MCTS Example 1: >Under the hush of leaves, ancient secrets pass as whispers. >Shadows dance as the daylight fades, echoing the rhythm of heartbeats. >In hallowed silence roots entwine, sharing stories with the undergrowth. >A shiver of twilight laces through, the phantom pulse of a forest's breath. MCTS Example 2: > Under the neon hum, craft recedes into shadow, > Where artistry and mechanics clash, souls are traded for steam and gas. > Echoes of creation's heart, usurped by iron’s brazen art. > Infernal gears grind dreams, artists' tears oiling their ceaseless horseplay. MCTS Example 3: > Spun by silent looms of determination ragged from use. > Eyes search the horizon, fingers till the marrow of invention. > Under quiet cover of the moon, the night was sown with ceaseless creation. > Mastering chaos, coaxing stars from a coal-darkened hand.

Visit product View on Hacker NewsSep 20, 2023

Share card

Actual performance

1points

Did not reach leaderboard

Launch Intel predictions

Analyze your own launch →

Indie HackersFits the IH revenue-focused audience · Missing: supports, reddit linkedin, podcasting

72%72% predicted probability of success on Indie Hackers, based on ML models trained on real launch data.

best fitHighest predicted score across all platforms for this description.

Product HuntOn track for Day 1 leaderboard · Strong signals: agent, agentic, using · Missing: mac, agents, macos

68%68% predicted probability of success on Product Hunt, based on ML models trained on real launch data.

TrustMRRLess likely to generate early MRR · Missing: mobile apps, ios, personal

43%43% predicted probability of success on TrustMRR, based on ML models trained on real launch data.

Hacker NewsMay not resonate with HN audience · Strong signals: io · Missing: https docs, excited, just released

42%42% predicted probability of success on Hacker News, based on ML models trained on real launch data.

nativeThis product was originally launched on this platform.

AppSumoMay struggle as an AppSumo deal · Missing: plus, platform, intuitive

36%36% predicted probability of success on AppSumo, based on ML models trained on real launch data.

Acquire.comPre-revenue stage for this audience · Strong signals: arr, growth · Missing: mrr, revenue, profit

9%9% predicted probability of success on Acquire.com, based on ML models trained on real launch data.

BetaListMay not resonate with beta-testers · Missing: web3, chat, crypto

1%1% predicted probability of success on BetaList, based on ML models trained on real launch data.

Correct prediction on native model

Similar products

FAQify – Algolia for FAQs using GPT-369%Launch Intel prediction score: how likely this product is to succeed on its source platform, based on its name, tagline, and description.

FAQify – Algolia for FAQs using GPT-3

Hacker News8

less than 650 LOC trainable GPT only using NumPy55%Launch Intel prediction score: how likely this product is to succeed on its source platform, based on its name, tagline, and description.

less than 650 LOC trainable GPT only using NumPy

Hacker News90

Angular 2 AoT Compilation and Tree Shaking Example46%Launch Intel prediction score: how likely this product is to succeed on its source platform, based on its name, tagline, and description.

Angular 2 AoT Compilation and Tree Shaking Example

Hacker News9

Implementation of a 3-pointer AVL Tree46%Launch Intel prediction score: how likely this product is to succeed on its source platform, based on its name, tagline, and description.

Implementation of a 3-pointer AVL Tree

Hacker News2

Visualizing Binary Tree59%Launch Intel prediction score: how likely this product is to succeed on its source platform, based on its name, tagline, and description.

Visualizing Binary Tree

Hacker News2

Ldd as a Tree and Much More49%Launch Intel prediction score: how likely this product is to succeed on its source platform, based on its name, tagline, and description.

Ldd as a Tree and Much More

Hacker News2

Toy LISP compiler in C# (LINQ) expression tree73%Launch Intel prediction score: how likely this product is to succeed on its source platform, based on its name, tagline, and description.

Toy LISP compiler in C# (LINQ) expression tree

Hacker News2

Tree Dangler58%Launch Intel prediction score: how likely this product is to succeed on its source platform, based on its name, tagline, and description.

Tree Dangler

Hacker News1

I ported Tree-sitter to Go57%Launch Intel prediction score: how likely this product is to succeed on its source platform, based on its name, tagline, and description.

I ported Tree-sitter to Go

Hacker News222

KD-tree recommender system in Literate Coffeescript49%Launch Intel prediction score: how likely this product is to succeed on its source platform, based on its name, tagline, and description.

KD-tree recommender system in Literate Coffeescript

Hacker News2

Browse all products Analyze your launch