From ebf48873d3cc9562ddf65764ba6d9bf45a846740 Mon Sep 17 00:00:00 2001 From: sync Date: Tue, 10 Sep 2024 08:43:54 +0000 Subject: [PATCH] =?UTF-8?q?Edit=20=E2=80=98good=5Fideas=E2=80=99:=20Synced?= =?UTF-8?q?=201725957515073?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- good_ideas.myco | 1 + 1 file changed, 1 insertion(+) diff --git a/good_ideas.myco b/good_ideas.myco index a67be1c..09ad133 100644 --- a/good_ideas.myco +++ b/good_ideas.myco @@ -6,6 +6,7 @@ * { Similarly, contrastive RL for computer algebra (specifically, proving that expressions equal other expressions via making substitutions repeatedly). Try and contrastively learn a "how close is this expression to this other one" function (I think with an action input?). Bootstrap to progressively harder problems. * What does Gyges mean by "anyone who wants it: you should be able to train contrastive models way faster if you use lsh to determine pairs to contrast"? This might contain alpha. +* Maybe this should be a "theorem prover" and not an "expression rewriter". I think they're fairly similar anyway. } * { Startup ideas: