Part of a series on |

Machine learning and data mining |
---|

**Active learning** is a special case of machine learning in which a learning algorithm can interactively query a user (or some other information source) to label new data points with the desired outputs.^{[1]}^{[2]}^{[3]} In statistics literature, it is sometimes also called optimal experimental design.^{[4]} The information source is also called *teacher* or *oracle*.

There are situations in which unlabeled data is abundant but manual labeling is expensive. In such a scenario, learning algorithms can actively query the user/teacher for labels. This type of iterative supervised learning is called active learning. Since the learner chooses the examples, the number of examples to learn a concept can often be much lower than the number required in normal supervised learning. With this approach, there is a risk that the algorithm is overwhelmed by uninformative examples. Recent developments are dedicated to multi-label active learning,^{[5]} hybrid active learning^{[6]} and active learning in a single-pass (on-line) context,^{[7]} combining concepts from the field of machine learning (e.g. conflict and ignorance) with adaptive, incremental learning policies in the field of online machine learning.

Large-scale active learning projects may benefit from crowdsourcing frameworks such as Amazon Mechanical Turk that include many humans in the active learning loop.

Let T be the total set of all data under consideration. For example, in a protein engineering problem, T would include all proteins that are known to have a certain interesting activity and all additional proteins that one might want to test for that activity.

During each iteration, i, T is broken up into three subsets

- : Data points where the label is
**known**. - : Data points where the label is
**unknown**. - : A subset of T
_{U,i}that is**chosen**to be labeled.

Most of the current research in active learning involves the best method to choose the data points for T_{C,i}.

**Membership Query Synthesis**: This is where the learner generates its own instance from an underlying natural distribution. For example, if the dataset are pictures of humans and animals, the learner could send a clipped image of a leg to the teacher and query if this appendage belongs to an animal or human. This is particularly useful if the dataset is small.^{[8]}**Pool-Based Sampling**: In this scenario, instances are drawn from the entire data pool and assigned a confidence score, a measurement of how well the learner “understands” the data. The system then selects the instances for which it is the least confident and queries the teacher for the labels.**Stream-Based Selective Sampling**: Here, each unlabeled data point is examined one at a time with the machine evaluating the informativeness of each item against its query parameters. The learner decides for itself whether to assign a label or query the teacher for each datapoint.

Algorithms for determining which data points should be labeled can be organized into a number of different categories, based upon their purpose:^{[1]}

**Balance exploration and exploitation**: the choice of examples to label is seen as a dilemma between the exploration and the exploitation over the data space representation. This strategy manages this compromise by modelling the active learning problem as a contextual bandit problem. For example, Bouneffouf et al.^{[9]}propose a sequential algorithm named Active Thompson Sampling (ATS), which, in each round, assigns a sampling distribution on the pool, samples one point from this distribution, and queries the oracle for this sample point label.**Expected model change**: label those points that would most change the current model.**Expected error reduction**: label those points that would most reduce the model's generalization error.**Exponentiated Gradient Exploration for Active Learning**:^{[10]}In this paper, the author proposes a sequential algorithm named exponentiated gradient (EG)-active that can improve any active learning algorithm by an optimal random exploration.**Random Sampling:**a sample is randomly selected.^{[11]}**Uncertainty sampling**: label those points for which the current model is least certain as to what the correct output should be.**Entropy Sampling:**The entropy formula is used on each sample, and the sample with the highest entropy is considered to be the least certain.^{[11]}**Margin Sampling:**The sample with the smallest difference between the two highest class probabilities is considered to be the most uncertain.^{[11]}**Least Confident Sampling:**The sample with the smallest best probability is considered to be the most uncertain.^{[11]}

**Query by committee**: a variety of models are trained on the current labeled data, and vote on the output for unlabeled data; label those points for which the "committee" disagrees the most**Querying from diverse subspaces or partitions**:^{[12]}When the underlying model is a forest of trees, the leaf nodes might represent (overlapping) partitions of the original feature space. This offers the possibility of selecting instances from non-overlapping or minimally overlapping partitions for labeling.**Variance reduction**: label those points that would minimize output variance, which is one of the components of error.**Conformal predictors**: This method predicts that a new data point will have a label similar to old data points in some specified way and degree of the similarity within the old examples is used to estimate the confidence in the prediction.^{[13]}**Mismatch-first farthest-traversal**: The primary selection criterion is the prediction mismatch between the current model and nearest-neighbour prediction. It targets on wrongly predicted data points. The second selection criterion is the distance to previously selected data, the farthest first. It aims at optimizing the diversity of selected data.^{[14]}**User Centered Labeling Strategies:**Learning is accomplished by applying dimensionality reduction to graphs and figures like scatter plots. Then the user is asked to label the compiled data (categorical, numerical, relevance scores, relation between two instances.^{[15]}

A wide variety of algorithms have been studied that fall into these categories.^{[1]}^{[4]}

Some active learning algorithms are built upon support-vector machines (SVMs) and exploit the structure of the SVM to determine which data points to label. Such methods usually calculate the margin, W, of each unlabeled datum in T_{U,i} and treat W as an n-dimensional distance from that datum to the separating hyperplane.

Minimum Marginal Hyperplane methods assume that the data with the smallest W are those that the SVM is most uncertain about and therefore should be placed in T_{C,i} to be labeled. Other similar methods, such as Maximum Marginal Hyperplane, choose data with the largest W. Tradeoff methods choose a mix of the smallest and largest Ws.