Pith. sign in

REVIEW

tau-FPL: Tolerance-Constrained Learning in Linear Time

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 1801.04701 v1 pith:OSRZZEWT submitted 2018-01-15 cs.LG cs.AIstat.ML

classification cs.LGcs.AIstat.ML
keywords false-positivelearningratetau-fplapproachesclassifierexistinglinear
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Learning a classifier with control on the false-positive rate plays a critical role in many machine learning applications. Existing approaches either introduce prior knowledge dependent label cost or tune parameters based on traditional classifiers, which lack consistency in methodology because they do not strictly adhere to the false-positive rate constraint. In this paper, we propose a novel scoring-thresholding approach, tau-False Positive Learning (tau-FPL) to address this problem. We show the scoring problem which takes the false-positive rate tolerance into accounts can be efficiently solved in linear time, also an out-of-bootstrap thresholding method can transform the learned ranking function into a low false-positive classifier. Both theoretical analysis and experimental results show superior performance of the proposed tau-FPL over existing approaches.

Discussion (0). Sign in to comment.

Pith tools