You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
hello, I noticed there is a big focus on uncertainty based sampling and information density based sampling techniques which is very nice. but in batch mode active learning, when several data points are sent to the oracle at the same time, it is often desired that the data points sent be diverse to avoid redundancy and maximise improvement of the model. several techniques has been designed, one of the most recent and also one of the simplest is Diverse Mini Batch Active Learning.
TLDR: compute uncertainty with chosen metric (e.g. margin, entropy, ...) and then prefilter ninstances * beta (beta is a prefiltering parameter, typically 10, 50 or 100) topmost uncertain data points. then perform kmeans clustering on those prefiltered points with instances clusters and select closest points to centroids.
it is quite simple to implement and give good results. I already have an implementation ready if you are interested in a PR.
The text was updated successfully, but these errors were encountered:
Sure, this would be awesome! Open the PR and I'll take a look at it. (Just a disclaimer, I am quite busy with other projects at this time, so it might take me 2-3 weeks to review it. Sorry in advance :D)
hello, I noticed there is a big focus on uncertainty based sampling and information density based sampling techniques which is very nice. but in batch mode active learning, when several data points are sent to the oracle at the same time, it is often desired that the data points sent be diverse to avoid redundancy and maximise improvement of the model. several techniques has been designed, one of the most recent and also one of the simplest is Diverse Mini Batch Active Learning.
TLDR: compute uncertainty with chosen metric (e.g. margin, entropy, ...) and then prefilter ninstances * beta (beta is a prefiltering parameter, typically 10, 50 or 100) topmost uncertain data points. then perform kmeans clustering on those prefiltered points with instances clusters and select closest points to centroids.
it is quite simple to implement and give good results. I already have an implementation ready if you are interested in a PR.
The text was updated successfully, but these errors were encountered: