3 ms·
> Sure. But not in a form that's applicable for ML / AI. You have a cost function you want to minimize. That can't form the basis of a search among valid prog
by haberman 9y ago
> Sure. But not in a form that's applicable for ML / AI.
You have a cost function you want to minimize. That can't form the basis of a search among valid program transformations?
> Just because a technology worked for one field, doesn't mean it's trivially applicable for other fields
I didn't say "trivially." I just pushed back on the idea that it's "magic."
There are precedents for ML-like approaches to optimization for regular compilers. For example, superoptimizers.
- superoptimiz 9y agoYes; as we all know, superoptimizers were revolutionary and now form the core of compilers. Also, superoptimizers are stochastic search algorithms, which are only tangentially related to ML, which is again only tangentially related to AI. The relation between AI and superoptimization is close to nil.