forked from google/active-learning
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmargin_AL.py
64 lines (52 loc) · 2.01 KB
/
margin_AL.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
# Copyright 2017 Google Inc.
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
"""Margin based AL method.
Samples in batches based on margin scores.
"""
from __future__ import absolute_import
from __future__ import division
from __future__ import print_function
import numpy as np
from sampling_methods.sampling_def import SamplingMethod
class MarginAL(SamplingMethod):
def __init__(self, X, y, seed):
self.X = X
self.y = y
self.name = 'margin'
def select_batch_(self, model, already_selected, N, **kwargs):
"""Returns batch of datapoints with smallest margin/highest uncertainty.
For binary classification, can just take the absolute distance to decision
boundary for each point.
For multiclass classification, must consider the margin between distance for
top two most likely classes.
Args:
model: scikit learn model with decision_function implemented
already_selected: index of datapoints already selected
N: batch size
Returns:
indices of points selected to add using margin active learner
"""
try:
distances = model.decision_function(self.X)
except:
distances = model.predict_proba(self.X)
if len(distances.shape) < 2:
min_margin = abs(distances)
else:
sort_distances = np.sort(distances, 1)[:, -2:]
min_margin = sort_distances[:, 1] - sort_distances[:, 0]
rank_ind = np.argsort(min_margin)
rank_ind = [i for i in rank_ind if i not in already_selected]
active_samples = rank_ind[0:N]
return active_samples