Active Learning

Reference: -The active learning algorithm is described in detail in Agnostic Active Learning without Constraints [pdf]. -https://arxiv.org/pdf/0812.4952.pdf

Usage:

Active Learning options --active active learning mode --simulation active learning simulation mode --mellowness arg (=8) active learning mellowness parameter c_0. Default 8 Given a fully labeled dataset, experimenting with active learning can be done with --simulation. All active learning algorithms need a parameter that defines the trade off between label complexity and generalization performance. This is specified here with --mellowness. A value of 0 means that the algorithm will not ask for any label. A large value means that the algorithm will ask for all the labels. If instead of --simulation, --active is specified (together with --daemon) real active learning is implemented (examples are passed to VW via a TCP/IP port and VW responds with its prediction as well as how much it wants this example to be labeled if at all). If this is confusing, watch Daniel's explanation at the VW tutorial.