Learning to superoptimize programs — mentioned by Eug894

Thu, 20 Feb 2020 17:59:05 GMT

Isn't it interesting what is more efficient: neural nets or a learning Mealy machine? Anyway, an optimization of an exhaustive search is a slow but assured way of solving a car driver problem. You don't need the most accurate simulation for it as Elon says here: https://www.youtube.com/watch?v=Ucp0TTmvqOE&t=7358 A "brute-force" algorithm (an exhaustive search, in other words) is the easiest way to find an answer to almost any engineering problem. But it often must be optimized before being computed. The optimization may be done by an AI agent based on Neural Nets, or on a Learning Mealy…

Paper and discussion history. A mention is not an endorsement.

Learning to superoptimize programs — HN submission

Sun, 20 Nov 2016 08:00:29 GMT

Learning to Superoptimize Programs

121 points; 24 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Learning to superoptimize programs · HackerPapers discussions

Learning to superoptimize programs — mentioned by Eug894

Learning to superoptimize programs — HN submission