Improved Error Bounds Based on Worst Likely Assignments

03/31/2015
by   Eric Bax, et al.
0

Error bounds based on worst likely assignments use permutation tests to validate classifiers. Worst likely assignments can produce effective bounds even for data sets with 100 or fewer training examples. This paper introduces a statistic for use in the permutation tests of worst likely assignments that improves error bounds, especially for accurate classifiers, which are typically the classifiers of interest.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/09/2014

Speculate-Correct Error Bounds for k-Nearest Neighbor Classifiers

We introduce the speculate-correct method to derive error bounds for loc...
research
08/16/2018

Complete Test Sets And Their Approximations

We use testing to check if a combinational circuit N always evaluates to...
research
10/04/2021

Learning to shortcut and shortlist order fulfillment deciding

With the increase of order fulfillment options and business objectives t...
research
10/28/2019

Interrupted and cascaded permutation invariant training for speech separation

Permutation Invariant Training (PIT) has long been a stepping stone meth...
research
09/18/2021

Ensemble Learning using Error Correcting Output Codes: New Classification Error Bounds

New bounds on classification error rates for the error-correcting output...
research
11/27/2017

Classifier Selection with Permutation Tests

This work presents a content-based recommender system for machine learni...
research
12/01/2018

Auto-Grading for 3D Modeling Assignments in MOOCs

Bottlenecks such as the latency in correcting assignments and providing ...

Please sign up or login with your details

Forgot password? Click here to reset