Offline Imitation Learning from Multiple Baselines with Applications to Compiler Optimization — mentioned by vanderZwan

Tue, 05 Nov 2024 16:22:57 GMT

I find it a little annoying that in the paper[0] they show various graphs of megabytes saved in the paper, but no actual size of the binaries that these policies are applied to, as far as I can tell. So when they say the inline policies end up saving 20 MiB on the training data, and then only a few megabyte on a different binary not in the training data, I lack the context to really judge what that says. Is the other binary much smaller? The same size? What if it's bigger and therefore hides a much smaller relative size savings? At the very end of the paper do they mention one binary size…

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

Offline Imitation Learning from Multiple Baselines with Applications to Compiler Optimization · HackerPapers discussions

Offline Imitation Learning from Multiple Baselines with Applications to Compiler Optimization — mentioned by vanderZwan