Sure, it will ask you to confirm before actually executing code. I also find it useful when performing batching processing tasks and you don't want to type every word.
This is also what I was thinking about. Considering that making up bad data does not require any GPU work as opposed to honest calculating nodes, the model can fall quickly if without taking some measures to deal with them (adverserial nodes).
A draft solution would be for the central server to measure the goodness of each update and drop the ones that don't perform well. This could somehow work since inference is much cheaper than gradients computing.
Well, I clicked this link and got disappointed immediatly. Apparently the idea is neither original new nor useful.
Then I got a little offended by myself. Information Theory has stated clearly that universal compression is impossible, and how come that I didn't recall that?
