2 ms·
This looks just like the simulated annealing work AI researchers were using on chip design and verification in the 1980s.
by gumby 7y ago
This looks just like the simulated annealing work AI researchers were using on chip design and verification in the 1980s.
- B1FF_PSUVM 7y agoI think the trick is here: "In our proposed method, we devised a model to predict the performance before simulation and only simulate those samples which have better predicted performance." In other words, build a model for the system, use that for (cheap) sample point evaluation, occasionally check (doing an expensive circuit simulation) and adjust. P.S. back in 80s the guys doing simulated annealing were not claiming to be AI researchers, and the actual AI researchers were doing other stuff (neural networks and knowledge-based systems, among others).
- peterwoerner 7y agoSurrogate modeling techniques have been around for a while. They come standard in many optimization software e.g. DAKOTA. https://dakota.sandia.gov/ https://dakota.sandia.gov/
- gumby 7y agoThere were some folks doing it at the mit AI lab where I also was at the time, hence my unfortunate conflation. I know there were folks elsewhere working on it too, sorry. (Not so much NN in the 80s except for a few holdouts like Rumelhart and Hinton).
- peterwoerner 7y agoThat's because genetic algorithms and simulated annealing algorithms are really similar. You could imagine a GA as being a multiple simulated annealing algorithm in which you occasionally cross pollinated your solutions. Technically, in GA you keep the top solutions and SA you will move to a less optimal solution with some probability. But the mechanics of them are quite similar.