Algorithmic Assurance: An Active Approach to Algorithmic Testing using Bayesian Optimisation

Gopakumar, Shivapratap, Gupta, Sunil, Rana, Santu, Nguyen, Vu, Venkatesh, Svetha

Neural Information Processing Systems 

We introduce algorithmic assurance, the problem of testing whether machine learning algorithms are conforming to their intended design goal. We address this problem by proposing an efficient framework for algorithmic testing. To provide assurance, we need to efficiently discover scenarios where an algorithm decision deviates maximally from its intended gold standard. We mathematically formulate this task as an optimisation problem of an expensive, black-box function. We use an active learning approach based on Bayesian optimisation to solve this optimisation problem.