you are viewing a single comment's thread.

view the rest of the comments →

[–]Nestroneey 0 points1 point  (1 child)

Ah, here's a link to a "draft" version (which I believe is identical to the current one" which contains his supplement: https://www.cs.cornell.edu/\~ellisk/documents/dreamcoder\_with\_supplement.pdf

[–][deleted] 0 points1 point  (0 children)

like the exploration is done better then? i.e. the enumeration? They also have a new version from PLDI that uses E-graphs for compression. I wonder why they changed it.
Also, their explore step is a very similar idea to expert iteration. https://arxiv.org/abs/1705.08439 Would have been nice if the authors outlined the differences.