Pith. sign in

REVIEW

Online Passive-Aggressive Total-Error-Rate Minimization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2002.01771 v1 pith:VE4SJ4FH submitted 2020-02-05 stat.ML cs.LG

classification stat.MLcs.LG
keywords learningonlinealgorithmdatapateralgorithmsclassificationminimization
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We provide a new online learning algorithm which utilizes online passive-aggressive learning (PA) and total-error-rate minimization (TER) for binary classification. The PA learning establishes not only large margin training but also the capacity to handle non-separable data. The TER learning on the other hand minimizes an approximated classification error based objective function. We propose an online PATER algorithm which combines those useful properties. In addition, we also present a weighted PATER algorithm to improve the ability to cope with data imbalance problems. Experimental results demonstrate that the proposed PATER algorithms achieves better performances in terms of efficiency and effectiveness than the existing state-of-the-art online learning algorithms in real-world data sets.

Discussion (0). Continue with ORCID to comment.

Pith tools