Diffusion on syntax trees for program synthesis
61–70 of 95 posts
Re: Diffusion on syntax trees for program synthesis
#62Earlier quoted context omitted.
It is a computationally clever application of the chain rule to minimize the amount of computation needed to compute gradients for all parameters in the network.
> to minimize the amount of computation IMO backprop is the most trivial implementation of differentiation in neural networks. Do you know an easier way to compute gradients with larger overhead? If so, please share it.
Re: Diffusion on syntax trees for program synthesis
#63Re: Diffusion on syntax trees for program synthesis
#64It's funny, this kind of subtree mutation was looked at pretty deeply by Koza and Adamı in the 90s under the rubric of Genetic Algorithms, but with a slightly different optimization function One ref in the paper to 2000 for GAs for fast generation of program trees, but that's missing the main show Hope they're reading this and dig into those guys work
Re: Diffusion on syntax trees for program synthesis
#65Earlier quoted context omitted.
What's with the last author/first author thing in science papers? I've read several times that the author listed last is usually the most significant contributor, and the first author the least significant, due to some kind of tradition around modesty plus favourably introducing new names. (Which then of course doesn't work, if everyone knows it's happening...) Here, you've interpreted it as the reverse, and by that…
Conventions vary by field, but within a specific field they're usually pretty consistent. In natural sciences (except large physics papers) the convention is that the first author is the one doing most of the practical work. The last author is the PI (principal investigator) of the group who had a hand in designing the experiments and oversaw the research. Now, the latter can mean anything from barely doing any work…
Eg, as a sibling commented this convention may not be common in ML research, I wonder then if it may be something less common in emergent fields where researchers are generally be younger and less likely to follow older traditions.
Re: Diffusion on syntax trees for program synthesis
#66There's been talk in the past about github adding integrations with common build tools (automatically?). What if you could compile every llvm-compiled project on github and run a diffusion model over the intermediate representations?
Re: Diffusion on syntax trees for program synthesis
#67Earlier quoted context omitted.
What's with the last author/first author thing in science papers? I've read several times that the author listed last is usually the most significant contributor, and the first author the least significant, due to some kind of tradition around modesty plus favourably introducing new names. (Which then of course doesn't work, if everyone knows it's happening...) Here, you've interpreted it as the reverse, and by that…
>the author listed last is usually the most significant contributor Where did you read that? That's definitely not the case in machine learning.
https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3010799/
(And note how points 1 through 4 all quite conflict with each other!)
Re: Diffusion on syntax trees for program synthesis
#68There's been talk in the past about github adding integrations with common build tools (automatically?). What if you could compile every llvm-compiled project on github and run a diffusion model over the intermediate representations?
what's the output?
Re: Diffusion on syntax trees for program synthesis
#69Earlier quoted context omitted.
>the author listed last is usually the most significant contributor Where did you read that? That's definitely not the case in machine learning.
I've read it in several places over the years, and just had a search now to find a reference to cite. Here's a PubMed paper on the subject: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3010799/ (And note how points 1 through 4 all quite conflict with each other!)
Re: Diffusion on syntax trees for program synthesis
#70Earlier quoted context omitted.
what's the output?
I guess the output would be an llvm intermediate representation that you can compile down and run, right? I'm stretching pretty far past my knowledge here.