Entropy-Based Search Algorithm for Experimental Design

by   N. K. Malakar, et al.

The scientific method relies on the iterated processes of inference and inquiry. The inference phase consists of selecting the most probable models based on the available data; whereas the inquiry phase consists of using what is known about the models to select the most relevant experiment. Optimizing inquiry involves searching the parameterized space of experiments to select the experiment that promises, on average, to be maximally informative. In the case where it is important to learn about each of the model parameters, the relevance of an experiment is quantified by Shannon entropy of the distribution of experimental outcomes predicted by a probable set of models. If the set of potential experiments is described by many parameters, we must search this high-dimensional entropy space. Brute force search methods will be slow and computationally expensive. We present an entropy-based search algorithm, called nested entropy sampling, to select the most informative experiment for efficient experimental design. This algorithm is inspired by Skilling's nested sampling algorithm used in inference and borrows the concept of a rising threshold while a set of experiment samples are maintained. We demonstrate that this algorithm not only selects highly relevant experiments, but also is more efficient than brute force search. Such entropic search techniques promise to greatly benefit autonomous experimental design.



There are no comments yet.


page 5

page 7


A tabu search algorithm with efficient diversification strategy for high school timetabling problem

The school timetabling problem can be described as scheduling a set of l...

BAS: Beetle Antennae Search Algorithm for Optimization Problems

Meta-heuristic algorithms have become very popular because of powerful p...

Hypernetwork-Based Augmentation

Data augmentation is an effective technique to improve the generalizatio...

On-line force capability evaluation based on efficient polytope vertex search

Ellipsoid-based manipulability measures are often used to characterize t...

Stabilized Nested Rollout Policy Adaptation

Nested Rollout Policy Adaptation (NRPA) is a Monte Carlo search algorith...

Entropic Herding

Herding is a deterministic algorithm used to generate data points that c...

Retrieval of Experiments by Efficient Estimation of Marginal Likelihood

We study the task of retrieving relevant experiments given a query exper...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.