, τ , the querying algorithm selects an instance ofx t ∈ C u for which the learning algorithm is least certain.
our learning goal of active learning is to minimize the expected loss L (i.e., hinge loss) with limited querying opportunities to obtain a decision function f (1) , f (2) , .