Search Results for author:
Found 2 papers, 0 papers with code
Variance Penalizing AdaBoost
Thus, the proposed algorithm solves a key limitation of previous empirical Bernstein boosting methods which required brute force enumeration of all possible weak learners.
Relative Margin Machines
In classification problems, Support Vector Machines maximize the margin of separation between two classes.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
