public class RandomizedBudgetPerceptron extends BudgetedLearningAlgorithm
[CavallantiCOLT2006] G. Cavallanti, N. Cesa-Bianchi, C. Gentile. Tracking the best hyperplane with a simple budget Perceptron. In proc. of the 19-th annual conference on Computational Learning Theory. (2006)
Until the budget is not reached the online learning updating policy is the one of the baseAlgorithm that this meta-algorithm is exploiting. When the budget is full, a random support vector is deleted and the perceptron updating policy is adopted
baseAlgorithm, budget, label
Constructor and Description |
---|
RandomizedBudgetPerceptron() |
RandomizedBudgetPerceptron(int budget,
OnlineLearningAlgorithm baseAlgorithm,
long seed,
List<Label> labels) |
Modifier and Type | Method and Description |
---|---|
RandomizedBudgetPerceptron |
duplicate()
Creates a new instance of the LearningAlgorithm initialized with the same parameters
of the learningAlgorithm to be duplicated.
|
Prediction |
predictAndLearnWithFullBudget(Example example)
Learns from a single example applying a specific policy that must be adopted when the budget is reached
|
void |
reset()
Resets all the learning process, returning to the default state.
|
void |
setSeed(long seed)
Sets the seed for the random generator adopted to select the support vector to delete
|
getBaseAlgorithm, getBudget, getLabel, getLabels, getPredictionFunction, learn, learn, setBaseAlgorithm, setBudget, setLabel, setLabels
public RandomizedBudgetPerceptron()
public RandomizedBudgetPerceptron(int budget, OnlineLearningAlgorithm baseAlgorithm, long seed, List<Label> labels)
public void setSeed(long seed)
seed
- the seed of the randomGeneratorpublic RandomizedBudgetPerceptron duplicate()
LearningAlgorithm
public void reset()
LearningAlgorithm
public Prediction predictAndLearnWithFullBudget(Example example)
BudgetedLearningAlgorithm
predictAndLearnWithFullBudget
in class BudgetedLearningAlgorithm
example
- the example to be exploited in the learning processCopyright © 2014 Semantic Analytics Group @ Uniroma2. All rights reserved.