

![0_image_0.png](0_image_0.png)

## 5 Conclusion

The paper proposes an improvement to a widely used class of VOI-based optimization algorithms.

The improvement allows to decrease the computation time while only slightly affecting the performance. The proposed algorithm rationally reuses computations of VOI and recomputes VOI only for measurements for which a change in VOI is likely to affect the choice of the next measurement.

## 6 Acknowledgements

The research is partially supported by the IMG4 Consortium under the MAGNET program of the Israeli Ministry of Trade and Industry, by Israel Science Foundation grant 305/09, by the Lynn and William Frankel Center for Computer Sciences, and by the Paul Ivanier Center for Robotics Research and Production Management.

## References

[Ackley, 1987] Ackley, D. H. (1987). *A connectionist machine for genetic hillclimbing*. Kluwer Academic Publishers, Norwell, MA, USA.

[Bilgic and Getoor, 2007] Bilgic, M. and Getoor, L. (2007). Voila: Efficient feature-value acquisition for classification. In *AAAI*, pages 1225–1230. AAAI Press.

[Heckerman et al., 1993] Heckerman, D., Horvitz, E., and Middleton, B. (1993). An approximate nonmyopic computation for value of information. *IEEE Trans. Pattern Anal. Mach. Intell.*, 15(3):292–298.