Implicit Deep Adaptive Design: Policy-Based Experimental Design without Likelihoods
About
We introduce implicit Deep Adaptive Design (iDAD), a new method for performing adaptive experiments in real-time with implicit models. iDAD amortizes the cost of Bayesian optimal experimental design (BOED) by learning a design policy network upfront, which can then be deployed quickly at the time of the experiment. The iDAD network can be trained on any model which simulates differentiable samples, unlike previous design policy work that requires a closed form likelihood and conditionally independent experiments. At deployment, iDAD allows design decisions to be made in milliseconds, in contrast to traditional BOED approaches that require heavy computation during the experiment itself. We illustrate the applicability of iDAD on a number of experiments, and show that it provides a fast and effective mechanism for performing adaptive design with implicit models.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Sequential Optimal Experimental Design | Location Finding (LF) (test) | sPCE7.75 | 25 | |
| Source Finding | Source Finding 3D | Avg sPCE Lower Bound4.22 | 9 | |
| Source Finding | Source Finding (2D) | Avg sPCE Lower Bound7.97 | 9 | |
| Source Finding | Source Finding 5D | Average sPCE LB2.46 | 8 | |
| Bayesian Optimal Experimental Design | Location Finding 4D L=5e5 (test) | Total Information Lower Bound7.75 | 7 | |
| Bayesian Optimal Experimental Design | Location Finding 6D L=5e5 (test) | Lower Bound Total Information (I_10(pi))5.986 | 7 | |
| Bayesian Optimal Experimental Design | Location Finding (10D) L=5e5 (test) | Lower Bound Total Info (I_10(pi))3.252 | 7 | |
| Bayesian Optimal Experimental Design | Location Finding 20D L=5e5 (test) | Total Information Lower Bound (I_10(pi))0.877 | 7 | |
| Masked Classification | MNIST (train) | Cross-entropy0.099 | 5 | |
| Masked Classification | MNIST (test) | Cross-Entropy Loss0.164 | 5 |